Epigrams on Programming

Epigrams on Programming

Alan J. Perlis, Yale, September 1980

The phenomena surrounding computers are diverse and yield a surprisingly rich base for launching metaphors at individual and group activities. Conversely, classical human endeavors provide an inexhaustible source of metaphor for those of us who are in labor within computation. Such relationships between society and device are not new, but the incredible growth of the computer's influence (both real and implied) lends this symbiotic dependency a vitality like a gangly youth growing out of his clothes within an endless puberty.

The epigrams that follow attempt to capture some of the dimensions of this traffic in imagery that sharpens, focuses, clarifies, enlarges, and beclouds our view of this most remarkable of all mans' artifacts, the computer.

1. One man's constant is another man's variable.

2. Functions tend to delay binding; data structures tend to induce binding. Moral: Structure data late in the programming process.

3. Syntactic sugar causes cancer of the semi-colons.

4. Every program is a part of some other program and rarely fits perfectly.

5. If a program manipulates a large amount of data, it does so in a small number of ways.

6. Symmetry is a complexity reducing concept (co-routines include sub-routines); seek it everywhere.

7. It is easier to write an incorrect program than understand a correct one.

8. A programming language in which the irrelevant is as portentious as the critical in programs is a low order language.

9. It is better to have 100 functions operate on one data structure than 10 functions on 10 data structures.

10. Get into a rut early: Do the same processes the same way. Accumulate idioms. Standardize. The only difference(!) between Shakespeare and you was the size of his idiom list -- not the size of his vocabulary.

11. If you have a procedure with 10 parameters, you probably missed some.

12. Recursion is at the root of computation since it trades description for time.

13. If two people write exactly the same program, each should be put in micro-code and then they certainly won't be the same.

14. In the long run every program becomes rococo -- then rubble.

15. Everything should be built top-down, except the first time.

16. Every program has (at least) two purposes: the one for which it was written and another for which it wasn't.

17. If a listener nods his head when you're explaining your program, wake him up.

18. A program without a loop and a structured variable isn't worth writing.

19. If a language doesn't affect the way you think about programming, it's not worth knowing.

20. Wherever there is modularity there is the potential for misunderstanding: Hiding information implies a need to check communication.

21. Optimization often delays evolution.

22. A system is a collection of weakly interacting procedures that, in various combinations, perform a varietoy functions, in short, a system is a (general purpose?) computer. Hence the command language (order code) is critical. A good system can't have a weak command language.

23. To understand a program you must become the machine that executes it, often the programs that process it.

24. Perhaps if we wrote programs from childhood on, as adults we'd be able to read them. However, reading a program is not like reading a book, it is more like being a psychiatrist to a recumbent patient.

25. One can only display complex information in the mind. Like seeing, movement or flow or alteration of view is more important than the static picture, no matter how lovely.

26. There will always be things we wish to say in our programs that in all languages can only be said poorly.

27. Once you understand how to write a program get someone else to write it.

28. Around computers it is difficult to find the correct grain of time to measure progress. Some cathedrals took a century to complete. Can you imagine the grandeur and scope of a program that would take as long?

29. For systems, the analogue of a face-lift is to add to the control graph an edge that creates a cycle, not just toan additional node.

30. In programming, everything we do is a special case of something more general -- and we often know it too quickly.

31. Simplicity does not precede complexity, but follows it.

32. Good Programmers are not so much to be measured by their ingenuity and their logic as the completeness of their case analysis.

33. The 11th commandment was "Thou Shalt Compute" or "Thou Shalt Not Compute" -- I forget which.

34. The string is a stark data structure and everywhere it is passed there is much duplication of process. It is a perfect vehicle for hiding information.

35. Everyone can be taught to sculpt: Michelangelo would have had to be taught how not to. So it is with the great programmers.

36. The use of a program to prove the 4-color theorem will not change mathematics -- it merely demonstrates that the theorem, a challenge for a century, is probably not important to mathematics.

37. The most important computer is the one that rages in our skulls and ever seeks that satisfactory external emulator. The standardization of real computers would be a disaster -- and so it probably won't happen.

38. Structured Programming supports the law of the excluded muddle.

39. Re graphics: A picture is worth 10K words -- but only those to describe the picture. Hardly any sets of 10K words can be adequately described with pictures.

40. There are two ways to write error-free programs; only the third one works.

41. Some programming languages manage to absorb change, but withstand progress.

42. You can measure a programmer's perspective by noting his attitude on the continuing vitality of FORTRAN.

43. In software systems it is often the early bird that makes the worm.

44. Sometimes I think the only universal in the computing field is the fetch-execute cycle.

45. The goal of computation is the emulation of our synthetic abilities, not the understanding of our analytic ones.

46. Like punning, programming is a play on words.

47. As Will Rogers would have said, "There is no such thing as a free variable."

48. The best book on programming for the layman is "Alice in Wonderland"; but that's because it's the best book

on anything for the layman.

49. Giving up on assembly language was the apple in our Garden of Eden: Languages whose use squanders machine cycles are sinful. The LISP machine now permits LISP programmers to abandon bra and fig-leaf.

50. When we understand knowledge-based systems, it will be as before -- except our finger-tips will have be singed.

51. Bringing computers into the home won't change either one, but may revitalize the corner saloon.

52. Systems have sub-systems and sub-systems have sub-systems and so on ad finitum -- which is why we're always starting over.

53. So many good ideas are never heard from again once they embark in a voyage on the semantic gulf.

54. Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy.

55. A LISP programmer knows the value of everything, but the cost of nothing.

56. Software is under a constant tension. Being symbolic it is arbitrarily perfectible; but also it is arbitrarily changeable.

57. It is easier to change the specification to fit the program than vice versa.

58. Fools ignore complexity. Pragmatists suffer it. Some can avoid it. Geniuses remove it.

59. In English every word can be verbed. Would that it were so in our programming languages.

60. Dana Scott is the Church of the Lattice-Way Saints.

61. In programming, as in everything else, to be in error is to be reborn.

62. In computing, invariants are ephemeral.

63. When we write programs that "learn", it turns out we do and they don't.

64. Often it is means that justify ends: Goals advance technique and technique survives even when goal structures crumble.

65. Make no mistake about it: Computers process numbers -- not symbols. We measure our understanding (and control) by the extent to which we can arithmetize an activity.

66. Making something variable is easy. Controlling duration of constancy is the trick.

67. Think of all the psychic energy expended in seeking a fundamental distinction between "algorithm" and "program".

68. If we believe in data structures, we must believe in independent (hence simultaneous) processing. For why else would we collect items within a structure? Why do we tolerate languages that give us the one without t other?

69. In a five year period we get one superb programming language. Only we can't control when the 5 year period will begin.

70. Over the centuries the Indians developed sign language for communicating phenomena of interest. Programmers from different tribes (FORTRAN, LISP, ALGOL, SNOBOL, etc.) could use one that doesn't

require them to carry a blackboard on their ponies.

71. Documentation is like term insurance: It satisfies because almost no one who subscribes to it depends on its benefits.

72. An adequate bootstrap is a contradiction in terms.

73. It is not a language's weaknesses but its strengths that control the gradient of its change: Alas, a language never escapes its embryonic sac.

74. Is it possible that software is not like anything else, that it is meant to be discarded; that the whole point is to always see it as soap bubble?

75. Because of its vitality, the computing field is always in desperate need of new cliches: Banality soothes our nerves.

76. It is the user who should parametrize procedures, not their creators.

77. the cybernetic exchange between man, computer and algorithm is like a game of musical chairs: The frant search for balance always leaves one of the three standing ill at ease.

78. If your computer speaks English it was probably made in Japan.

79. A year spent in artificial intelligence is enough to make one believe in God.

80. Prolonged contact with the computer turns mathematicians into clerks and vice versa.

81. In computing, turning the obvious into the useful is a living definition of the word "frustration."

82. We are on the verge: Today our program proved Fermat's next-to-last theorem!

83. What is the difference between a Turing machine and the modern computer? It's the same as that between

Hillary's ascent of Everest and the establishment of a Hilton hotel on its peak.

84. Motto for a research laboratory: What we work on today, others will first think of tomorrow.

85. Though the Chinese should adore APL, it's FORTRAN they put their money on.

86. We kid ourselves if we think that the ratio of procedure to data in an active data-base system can be ma arbitrarily small or even kept small.

87. We have the mini and the micro computer. In what semantic niche would the pico computer fall?

88. It is not the computer's fault that Maxwell's equations are not adequate to design the electric motor.

89. One does not learn computing by using a hand calculator, but one can forget arithmetic.

90. Computation has made the tree flower.

91. The computer reminds one of Lon Chaney -- it is the machine of a thousand faces.

92. The computer is the ultimate polluter: Its feces are indistinguishable from the food it produces.

93. When someone says "I want a programming language in which I need only say what I wish done," give him a lollipop.

94. Interfaces keep things tidy, but don't accelerate growth: Functions do.

95. Don't have good ideas if you aren't willing to be responsible for them.

96. Computers don't introduce order anywhere as much as they expose opportunities.

97. When a professor insists computer science is X but not Y, have compassion for his graduate students.

98. In computing, the mean time to failure keeps getting shorter.

99. In man-machine symbiosis, it is man who must adjust: The machines can't.

100. We will never run out of things to program as long as there is a single program around.

101. Dealing with failure is easy: Work hard to improve. Success is also easy to handle: You've solved the wrong problem. Work hard to improve.

102. One can't proceed from the informal to the formal by formal means.

103. Epigrams are interfaces across which appreciation and insight flow.

104. Epigrams parametrize auras.

105. Epigrams are macros, since they are executed at read time.

106. Epigrams crystallize incongruities.

107. Epigrams retrieve deep semantics from a data base that is all procedure.

108. Epigrams scorn detail and make a point: They are a superb high-level documentation.

109. Epigrams are more like vitamins that protein.

110. Epigrams have extremely low entropy.

111. Purely applicative languages are poorly applicable.

112. The proof of a system's value is its existence.

113. You can't communicate complexity, only an awareness of it.

114. It's difficult to extract sense from strings, but they're the only communication coin we can count on.

115. The debate rages on: Is PL/I Bachtrian or Dromedary?

116. Whenever two programmers meet to criticize their programs, both are silent.

117. Think of it! With VLSI we can pack 100 ENIACS in 1 sq. cm.

118. Editing is a rewording activity.

119. Why did the Roman Empire collapse? What is the Latin for office automation?

120. Computer Science is embarrassed by the computer.

121. The only constructive theory connecting neuroscience and psychology will arise from the study of the computer.

122. Within a computer natural language is unnatural.

123. Most people find the concept of programming obvious, but the doing impossible.

124. You think you know when you learn, are more sure when you can write, even more when you teach, but certain when you can program.

125. It goes against the grain of modern education to teach children to program. What fun is there in making plans, acquiring discipline in organizing thoughs, devoting attention to detail and learning to be self-critical?

126. If you can imagine a society in which the computer-robot is the only menial, you can imagine anything.

127. Programming is an unnatural act.

128. Adapting old programs to fit new machines usually means adapting new machines to behave like old ones.

129. In seeking the unattainable, simplicity only gets in the way.

130. The last epigram? Neither eat nor drink them, snuff epigrams.

 

Alan J. Perlis(04/01/1922--02/07/1990)

 

图 灵 奖 获 得 时 间 ：

1966 年 。 第 一 位 图 灵 奖 (1966 年 ) 获 得 者 。

 

图 灵 奖 引 用 (Turing Award Citation) ：

 

Original English Version ：

"For his influence in the area of advanced programming techniques and compiler construction"

 

中 文 翻 译 ：

” ( 授 予 Alan J. Perlis 图 灵 奖 以 表 彰 其 在 ) 高 级 编 程 技 术 及 其 编 译 器 构 造 领 域 的 影 响 。 “

 

编 者 注 ： Alan 上 述 的 工 作 主 要 来 源 于 ， 作 为 一 个 开 发 成 员 ， 在 ALGOL(ALGOrithmic Language) 编 程 语 言 方 面 的 贡 献 。 ALGOL 语 言 直 接 导 致 了 PASCAL 语 言 的 产 生 。

Turing Award Lecture(图灵奖演讲文章)：

 

“The Synthesis of Algorithmic Systems"(算法系统的合成), Journal of the ACM, 14(1):1-9, January 1967

 

Alan J. Perlis 简 介 :

 

Alan J. Perlis Wiki: http://en.wikipedia.org/wiki/Alan_Perlis

 

Alan ，出生于美国宾州 Pittsburgh , Pennsylvania.1943 年 获 得 CMU(www.cmu.edu) 的 化 学 学 士 学 位 。 1949 年 和 1950 年 ， 分 别 获 得MIT 的 数 学 硕 士 与 博 士 学 位 。 其 博 士 论 文 题 目 为 “ "On Integral Equations, their Solution by Iteration and Analytic Continuation".

 

Alan 是 著 名 的 CMU 计 算 机 科 学 系 的 首 位 系 主 任 在 1965 年 到 1971 年 。 在 1971 年 ，Alan 加 入 耶 鲁 大 学 计 算 机 科 学 系 ， 并 在 1976 年 到 1980 年 出 任 计 算 机 系 系 主 任 。 1982 年 ， Alan ， 在 耶 鲁 大 学 计 算 机 系 任 职 期 间 ， 撰 写 了 一 篇 著 名 的 文 章 -- ”  Epigrams on Programming"( 编 程 警 言 ) 并 发 表 在 ACM SIGPLAN 杂 志 上 (Vol. 17, No. 9,  September 1982) 。 这 篇 包 含 130 个 警 言 的 文 章 得 到 了 工 业 界 和 学 术 界 广 泛 的 注 意 和引 用 。