Tags:functional-programming, lambda-terms, Self-compiling and self-evaluator
Abstract:
Several results of Corrado Böhm will be presented that have made programming more transparant and efficient.
Self-compiling. In his PhD thesis Corrado carefully presented a program that could translate itself to machine code. This resulted in the boot-strap of computers warming up efficiently.
Eliminating the go-to. With Giuseppe Jacopini Corrado showed that jumps in programming can be avoided. This resulted in structured programming.
The foundation of functional programming. Corrado was one of the first to realize that the computational model of lambda calculus can be used for programming by introducing the CUCH-machine.
Fine-structure of lambda terms. In a paper in Italian Corrado studied what lambda terms cannot be equated. This resulted in a deep analysis of lambda models.
A short self-evaluator. It has the magical shape E=<<K,S,C>>, as it was Stephe Cole Kleene who constructed the first, very long self-evaluator. Here Kleene's initials are the well nown combinators K=\xy.x, S=\xyz.xz(yz), C=\xyz.xzy, and <P,Q,R>=\z.zPQR etcetera. Just by coincidence.
Corrado Böhm: the white magician in programming and its semantics