转载自:http://www-pu.informatik.uni-tuebingen.de/users/klaeren/epigrams.html
Epigrams on Programming
Alan J. Perlis
Yale University
This text has been published in SIGPLAN Notices Vol. 17, No. 9, September 1982, pages 7 - 13. I'm offering it here online until ACM stops me.
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.
- One man's constant is another man's variable.
- Functions delay binding: data structures induce binding. Moral: Structure data late in the programming process.
- Syntactic sugar causes cancer of the semi-colons.
- Every program is a part of some other program and rarely fits.
- If a program manipulates a large amount of data, it does so in a small number of ways.
- Symmetry is a complexity reducing concept (co-routines include sub-routines); seek it everywhere.
- It is easier to write an incorrect program than understand a correct one.
- A programming language is low level when its programs require attention to the irrelevant.
- It is better to have 100 functions operate on one data structure than 10 functions on 10 data structures.
- 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.
- If you have a procedure with 10 parameters, you probably missed some.
- Recursion is the root of computation since it trades description for time.
- If two people write exactly the same program, each should be put in micro-code and then they certainly won't be the same.
- In the long run every program becomes rococo - then rubble.
- Everything should be built top-down, except the first time.
- Every program has (at least) two purposes: the one for which it was written and another for which it wasn't.
- If a listener nods his head when you're explaining your program, wake him up.
- A program without a loop and a structured variable isn't worth writing.
- A language that doesn't affect the way you think about programming, is not worth knowing.
- Wherever there is modularity there is the potential for misunderstanding: Hiding information implies a need to check communication.
- Optimization hinders evolution.
- A good system can't have a weak command language.
- To understand a program you must become both the machine and the program.
- Perhaps if we wrote programs from childhood on, as adults we'd be able to read them.
- 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.
- There will always be things we wish to say in our programs that in all known languages can only be said poorly.
- Once you understand how to write a program get someone else to write it.
- Around computers it is difficult to find the correct unit 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?
- For systems, the analogue of a face-lift is to add to the control graph an edge that creates a cycle, not just an additional node.
- In programming, everything we do is a special case of something more general - and often we know it too quickly.
- Simplicity does not precede complexity, but follows it.
- Programmers are not to be measured by their ingenuity and their logic but by the completeness of their case analysis.
- The 11th commandment was "Thou Shalt Compute" or "Thou Shalt Not Compute" - I forget which.
- 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.
- Everyone can be taught to sculpt: Michelangelo would have had to be taught how not to. So it is with the great programmers.
- 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.
- 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.
- Structured Programming supports the law of the excluded muddle.
- 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.
- There are two ways to write error-free programs; only the third one works.
- Some programming languages manage to absorb change, but withstand progress.
- You can measure a programmer's perspective by noting his attitude on the continuing vitality of FORTRAN.
- In software systems it is often the early bird that makes the worm.
- Sometimes I think the only universal in the computing field is the fetch-execute-cycle.
- The goal of computation is the emulation of our synthetic abilities, not the understanding of our analytic ones.
- Like punning, programming is a play on words.
- As Will Rogers would have said, "There is no such thing as a free variable."
- 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.
- 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.
- When we understand knowledge-based systems, it will be as before - except our finger-tips will have been singed.
- Bringing computers into the home won't change either one, but may revitalize the corner saloon.
- Systems have sub-systems and sub-systems have sub-systems and so on ad infinitum - which is why we're always starting over.
- So many good ideas are never heard from again once they embark in a voyage on the semantic gulf.
- Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy.
- A LISP programmer knows the value of everything, but the cost of nothing.
- Software is under a constant tension. Being symbolic it is arbitrarily perfectible; but also it is arbitrarily changeable.
- It is easier to change the specification to fit the program than vice versa.
- Fools ignore complexity. Pragmatists suffer it. Some can avoid it. Geniuses remove it.
- In English every word can be verbed. Would that it were so in our programming languages.
- Dana Scott is the Church of the Lattice-Way Saints.
- In programming, as in everything else, to be in error is to be reborn.
- In computing, invariants are ephemeral.
- When we write programs that "learn", it turns out we do and they don't.
- Often it is means that justify ends: Goals advance technique and technique survives even when goal structures crumble.
- 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.
- Making something variable is easy. Controlling duration of constancy is the trick.
- Think of all the psychic energy expended in seeking a fundamental distinction between "algorithm" and "program".
- 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 the other?
- In a 5 year period we get one superb programming language. Only we can't control when the 5 year period will begin.
- 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.
- Documentation is like term insurance: It satisfies because almost no one who subscribes to it depends on its benefits.
- An adequate bootstrap is a contradiction in terms.
- 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.
- It is 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?
- Because of its vitality, the computing field is always in desperate need of new cliches: Banality soothes our nerves.
- It is the user who should parameterize procedures, not their creators.
- The cybernetic exchange between man, computer and algorithm is like a game of musical chairs: The frantic search for balance always leaves one of the three standing ill at ease.
- If your computer speaks English it was probably made in Japan.
- A year spent in artificial intelligence is enough to make one believe in God.
- Prolonged contact with the computer turns mathematicians into clerks and vice versa.
- In computing, turning the obvious into the useful is a living definition of the word "frustration".
- We are on the verge: Today our program proved Fermat's next-to-last theorem!
- 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.
- Motto for a research laboratory: What we work on today, others will first think of tomorrow.
- Though the Chinese should adore APL, it's FORTRAN they put their money on.
- We kid ourselves if we think that the ratio of procedure to data in an active data-base system can be made arbitrarily small or even kept small.
- We have the mini and the micro computer. In what semantic niche would the pico computer fall?
- It is not the computer's fault that Maxwell's equations are not adequate to design the electric motor.
- One does not learn computing by using a hand calculator, but one can forget arithmetic.
- Computation has made the tree flower.
- The computer reminds one of Lon Chaney - it is the machine of a thousand faces.
- The computer is the ultimate polluter. Its feces are indistinguishable from the food it produces.
- When someone says "I want a programming language in which I need only say what I wish done," give him a lollipop.
- Interfaces keep things tidy, but don't accelerate growth: Functions do.
- Don't have good ideas if you aren't willing to be responsible for them.
- Computers don't introduce order anywhere as much as they expose opportunities.
- When a professor insists computer science is X but not Y, have compassion for his graduate students.
- In computing, the mean time to failure keeps getting shorter.
- In man-machine symbiosis, it is man who must adjust: The machines can't.
- We will never run out of things to program as long as there is a single program around.
- 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.
- One can't proceed from the informal to the formal by formal means.
- Purely applicative languages are poorly applicable.
- The proof of a system's value is its existence.
- You can't communicate complexity, only an awareness of it.
- It's difficult to extract sense from strings, but they're the only communication coin we can count on.
- The debate rages on: Is PL/I Bactrian or Dromedary?
- Whenever two programmers meet to criticize their programs, both are silent.
- Think of it! With VLSI we can pack 100 ENIACs in 1 sq.cm.
- Editing is a rewording activity.
- Why did the Roman Empire collapse? What is the Latin for office automation?
- Computer Science is embarrassed by the computer.
- The only constructive theory connecting neuroscience and psychology will arise from the study of software.
- Within a computer natural language is unnatural.
- Most people find the concept of programming obvious, but the doing impossible.
- You think you know when you learn, are more sure when you can write, even more when you can teach, but certain when you can program.
- It goes against the grain of modern education to teach children to program. What fun is there in making plans, acquiring discipline in organizing thoughts, devoting attention to detail and learning to be self-critical?
- If you can imagine a society in which the computer-robot is the only menial, you can imagine anything.
- Programming is an unnatural act.
- Adapting old programs to fit new machines usually means adapting new machines to behave like old ones.
- In seeking the unattainable, simplicity only gets in the way.
If there are epigrams, there must be meta-epigrams.
- Epigrams are interfaces across which appreciation and insight flow.
- Epigrams parameterize auras.
- Epigrams are macros, since they are executed at read time.
- Epigrams crystallize incongruities.
- Epigrams retrieve deep semantics from a data base that is all procedure.
- Epigrams scorn detail and make a point: They are a superb high-level documentation.
- Epigrams are more like vitamins than protein.
- Epigrams have extremely low entropy.
- The last epigram? Neither eat nor drink them, snuff epigrams.
分享到:
相关推荐
Alan Perlis 是计算机科学领域的一位先驱人物,他的33条编程准则(Alan Perlis’s Epigrams on Programming)被广泛引用。其中一些经典语录包括: 1. “We should forget about small efficiencies, say about 97% ...
关于编程的典范-艾伦·佩利斯(Alan J. Perlis) 一个人的常数就是另一个人的变量。 函数延迟绑定:数据结构诱导绑定。 道德:在编程过程中后期构造数据。 句法糖引起分号的癌症。 每个程序都是其他程序的一部分,很...
内容概要:本文档《数据结构》(02331)第一章主要介绍数据结构的基础概念,涵盖数据与数据元素的定义及其特性,详细阐述了数据结构的三大要素:逻辑结构、存储结构和数据运算。逻辑结构分为线性结构(如线性表、栈、队列)、树形结构(涉及根节点、父节点、子节点等术语)和其他结构。存储结构对比了顺序存储和链式存储的特点,包括访问方式、插入删除操作的时间复杂度以及空间分配方式,并介绍了索引存储和散列存储的概念。最后讲解了抽象数据类型(ADT)的定义及其组成部分,并探讨了算法分析中的时间复杂度计算方法。 适合人群:计算机相关专业学生或初学者,对数据结构有一定兴趣并希望系统学习其基础知识的人群。 使用场景及目标:①理解数据结构的基本概念,掌握逻辑结构和存储结构的区别与联系;②熟悉不同存储方式的特点及应用场景;③学会分析简单算法的时间复杂度,为后续深入学习打下坚实基础。 阅读建议:本章节内容较为理论化,建议结合实际案例进行理解,尤其是对于逻辑结构和存储结构的理解要深入到具体的应用场景中,同时可以尝试编写一些简单的程序来加深对抽象数据类型的认识。
内容概要:本文详细介绍了施耐德M580系列PLC的存储结构、系统硬件架构、上电写入程序及CPU冗余特性。在存储结构方面,涵盖拓扑寻址、Device DDT远程寻址以及寄存器寻址三种方式,详细解释了不同类型的寻址方法及其应用场景。系统硬件架构部分,阐述了最小系统的构建要素,包括CPU、机架和模块的选择与配置,并介绍了常见的系统拓扑结构,如简单的机架间拓扑和远程子站以太网菊花链等。上电写入程序环节,说明了通过USB和以太网两种接口进行程序下载的具体步骤,特别是针对初次下载时IP地址的设置方法。最后,CPU冗余部分重点描述了热备功能的实现机制,包括IP通讯地址配置和热备拓扑结构。 适合人群:从事工业自动化领域工作的技术人员,特别是对PLC编程及系统集成有一定了解的工程师。 使用场景及目标:①帮助工程师理解施耐德M580系列PLC的寻址机制,以便更好地进行模块配置和编程;②指导工程师完成最小系统的搭建,优化系统拓扑结构的设计;③提供详细的上电写入程序指南,确保程序下载顺利进行;④解释CPU冗余的实现方式,提高系统的稳定性和可靠性。 其他说明:文中还涉及一些特殊模块的功能介绍,如定时器事件和Modbus串口通讯模块,这些内容有助于用户深入了解M580系列PLC的高级应用。此外,附录部分提供了远程子站和热备冗余系统的实物图片,便于用户直观理解相关概念。
某型自动垂直提升仓储系统方案论证及关键零部件的设计.zip
2135D3F1EFA99CB590678658F575DB23.pdf#page=1&view=fitH
可以搜索文本内的内容,指定目录,指定文件格式,匹配大小写等
Windows 平台 Android Studio 下载与安装指南.zip
Android Studio Meerkat 2024.3.1 Patch 1(android-studio-2024.3.1.14-windows.zip)适用于Windows系统,文件使用360压缩软件分割成两个压缩包,必须一起下载使用: part1: https://download.csdn.net/download/weixin_43800734/90557033 part2: https://download.csdn.net/download/weixin_43800734/90557035
国网台区终端最新规范
国网台区终端最新规范
1.【锂电池剩余寿命预测】Transformer-GRU锂电池剩余寿命预测(Matlab完整源码和数据) 2.数据集:NASA数据集,已经处理好,B0005电池训练、B0006测试; 3.环境准备:Matlab2023b,可读性强; 4.模型描述:Transformer-GRU在各种各样的问题上表现非常出色,现在被广泛使用。 5.领域描述:近年来,随着锂离子电池的能量密度、功率密度逐渐提升,其安全性能与剩余使用寿命预测变得愈发重要。本代码实现了Transformer-GRU在该领域的应用。 6.作者介绍:机器学习之心,博客专家认证,机器学习领域创作者,2023博客之星TOP50,主做机器学习和深度学习时序、回归、分类、聚类和降维等程序设计和案例分析,文章底部有博主联系方式。从事Matlab、Python算法仿真工作8年,更多仿真源码、数据集定制私信。
Android项目原生java语言课程设计,包含LW+ppt
大学生入门前端-五子棋vue项目
这是一个完整的端到端解决方案,用于分析和预测阿联酋(UAE)地区的二手车价格。数据集包含 10,000 条二手车信息,覆盖了迪拜、阿布扎比和沙迦等城市,并提供了精确的地理位置数据。此外,项目还包括一个基于 Dash 构建的 Web 应用程序代码和一个训练好的 XGBoost 模型,帮助用户探索区域市场趋势、预测车价以及可视化地理空间洞察。 数据集内容 项目文件以压缩 ZIP 归档形式提供,包含以下内容: 数据文件: data/uae_used_cars_10k.csv:包含 10,000 条二手车记录的数据集,涵盖车辆品牌、型号、年份、里程数、发动机缸数、价格、变速箱类型、燃料类型、颜色、描述以及销售地点(如迪拜、阿布扎比、沙迦)。 模型文件: models/stacking_model.pkl:训练好的 XGBoost 模型,用于预测二手车价格。 models/scaler.pkl:用于数据预处理的缩放器。 models.py:模型相关功能的实现。 train_model.py:训练模型的脚本。 Web 应用程序文件: app.py:Dash 应用程序的主文件。 callback
资源内项目源码是来自个人的毕业设计,代码都测试ok,包含源码、数据集、可视化页面和部署说明,可产生核心指标曲线图、混淆矩阵、F1分数曲线、精确率-召回率曲线、验证集预测结果、标签分布图。都是运行成功后才上传资源,毕设答辩评审绝对信服的保底85分以上,放心下载使用,拿来就能用。包含源码、数据集、可视化页面和部署说明一站式服务,拿来就能用的绝对好资源!!! 项目备注 1、该资源内项目代码都经过测试运行成功,功能ok的情况下才上传的,请放心下载使用! 2、本项目适合计算机相关专业(如计科、人工智能、通信工程、自动化、电子信息等)的在校学生、老师或者企业员工下载学习,也适合小白学习进阶,当然也可作为毕设项目、课程设计、大作业、项目初期立项演示等。 3、如果基础还行,也可在此代码基础上进行修改,以实现其他功能,也可用于毕设、课设、作业等。 下载后请首先打开README.txt文件,仅供学习参考, 切勿用于商业用途。
资源内项目源码是来自个人的毕业设计,代码都测试ok,包含源码、数据集、可视化页面和部署说明,可产生核心指标曲线图、混淆矩阵、F1分数曲线、精确率-召回率曲线、验证集预测结果、标签分布图。都是运行成功后才上传资源,毕设答辩评审绝对信服的保底85分以上,放心下载使用,拿来就能用。包含源码、数据集、可视化页面和部署说明一站式服务,拿来就能用的绝对好资源!!! 项目备注 1、该资源内项目代码都经过测试运行成功,功能ok的情况下才上传的,请放心下载使用! 2、本项目适合计算机相关专业(如计科、人工智能、通信工程、自动化、电子信息等)的在校学生、老师或者企业员工下载学习,也适合小白学习进阶,当然也可作为毕设项目、课程设计、大作业、项目初期立项演示等。 3、如果基础还行,也可在此代码基础上进行修改,以实现其他功能,也可用于毕设、课设、作业等。 下载后请首先打开README.txt文件,仅供学习参考, 切勿用于商业用途。
此为代码审查工具 可查 文件数,字节数,总行数,代码行数,注释行数,空白行数,注释率等
内容概要:本文档涵盖了一项关于企业破产概率的详细分析任务,分为书面回答和Python代码实现两大部分。第一部分涉及对业务类型和破产状态的边际分布、条件分布及相对风险的计算,并绘制了相应的二维条形图。第二部分利用Python进行了数据处理和可视化,包括计算比值比、识别抽样技术类型、分析鱼类数据集以及探讨辛普森悖论。此外,还提供了针对鱼类和树木数据的统计分析方法。 适合人群:适用于有一定数学和编程基础的学习者,尤其是对统计学、数据分析感兴趣的大学生或研究人员。 使用场景及目标:①帮助学生掌握统计学概念如边际分布、条件分布、相对风险和比值比的实际应用;②教授如何用Python进行数据清洗、分析和可视化;③提高对不同类型抽样技术和潜在偏见的理解。 其他说明:文档不仅包含了理论知识讲解,还有具体的代码实例供读者参考实践。同时提醒读者在完成作业时需要注意提交格式的要求。