A full meta-circular compiler, capable of translating a programming language while written in that same language, was first described in a 1951 doctoral dissertation. This pioneering work by Corrado Böhm established a foundation for computer science, bridging the gap between mathematical theory and practical machine implementation through his extensive research into functional programming, lambda calculus, and structured program logic.
Academic Foundation
Born in Milan in 1923, Böhm maintained citizenship in the Kingdom of Italy and later Italy. He pursued his education at ETH Zurich and the Swiss Federal Institute of Technology in Lausanne. His formal training in mathematics and logic provided the basis for his subsequent academic career as a university teacher in Turin and Rome, where he served at the Sapienza University of Rome.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Contributions to Structured Programming
In 1966, Böhm co-authored a seminal paper with Giuseppe Jacopini regarding flow diagrams and Turing machines. This publication introduced P'', a minimal imperative language designed without GOTO statements, which was proven to be Turing-complete. This effort was central to the development of structured programming, providing a theoretical framework that remains influential in the design and implementation of modern programming languages.
Lambda Calculus and Theoretical Research
Böhm made significant advancements in the lambda calculus through what is now known as Böhm's theorem. This result established a separation theorem for normal forms, demonstrating that contextual equivalence could be determined through syntactic equality. Furthermore, his research into the isomorphism between polymorphic lambda-terms and algebraic data types, known as the Böhm–Berarducci encoding, furthered the study of functional programming semantics.
Career Recognition
Throughout his tenure in Rome and Turin, Böhm's contributions to constructivism and combinatorial logic earned him international recognition. He received an honorary doctorate from the University of Milan in 1994 and was awarded the EATCS Award in 2001 for his distinguished career. He was also a member of the Academia Europaea until his death in Rome in 2017.
Fast facts
- Born: 1923, Milan
- Died: 2017, Rome
- Education: ETH Zurich, Swiss Federal Institute of Technology in Lausanne
- Key Award: EATCS Award (2001)
- Academic Member: Academia Europaea
- Honorary Degree: University of Milan (1994)
Questions readers ask
What is the Böhm–Berarducci encoding?
It is an isomorphism between strictly-positive algebraic data types and polymorphic lambda-terms.
What did the 1966 paper with Giuseppe Jacopini demonstrate?
It introduced P'', the first imperative language without a GOTO statement proved to be Turing-complete.
Achievements
- Affiliated with Sapienza University of Rome and University of Turin
- Educated at ETH Zurich and Swiss Federal Institute of Technology in Lausanne
- Worked as mathematician, computer scientist and engineer
