From Wikipedia, the free encyclopedia
Corrado Böhm (born 1923 in Milan, Italy), Professor Emeritus at the University of Rome "La Sapienza", is a computer scientist known especially for his contributions to the theory of structured programming, constructive mathematics, combinatory logic, lambda-calculus, and the semantics and implementation of functional programming languages. A special issue of Theoretical Computer Science was dedicated to him on the occasion of his 70th birthday.
[edit] Selected publications
- C. Böhm, "Calculatrices digitales. Du déchiffrage des formules mathématiques par la machine même dans la conception du programme", Annali di Mat. pura e applicata, serie IV, tomo XXXVII, 1-51, 1954.
- C. Böhm, "On a family of Turing machines and the related programming language", ICC Bull., 3, 185-194, July 1964.
- Introduced P′′, the first imperative language without GOTO to be proved Turing-complete.
- C. Böhm, G. Jacopini, "Flow diagrams, Turing Machines and Languages with only Two Formation Rules", Comm. of the ACM, 9(5): 366-371,1966.
- C. Böhm, "Alcune proprietà delle forme normali nel K calcolo", Pubbl. INAC, n. 696, Roma, 1968.
- C. Böhm, A. Berarducci, "Automatic Synthesis of typed Lambda-programs on Term Algebras", Theoretical Computer Science, 39: 135-154, 1985.
- C. Böhm, "Functional Programming and Combinatory algebras", MFCS, Carlsbad, Czecoslovakia, eds M.P. Chytil, L. Janiga and V. Koubek, LNCS 324, 14-26, 1988.
[edit] References
[edit] External links
