Corrado Böhm

Alessandro Berarducci, Corrado Böhm: General Recursion on Second Order Term Algebras. RTA 2001: 15-30

Corrado Böhm: Fixed Point Equations Inside the Algebra of Normal Forms. Fundam. Inform. 37(4): 329-342 (1999)

Corrado Böhm: Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper). TAPSOFT 1997: 3-5

Corrado Böhm, Benedetto Intrigila: The Ant-Lion Paradigm for Strong Normalization. Inf. Comput. 114(1): 30-49 (1994)

Corrado Böhm, Adolfo Piperno, Stefano Guerrini: Lambda-Definition of Function(al)s by Normal Forms. ESOP 1994: 135-149

Alessandro Berarducci, Corrado Böhm: A Self-Interpreter of Lambda Calculus Having a Normal Form. CSL 1992: 85-99

Corrado Böhm, Enrico Tronci: About Systems of Equations, X-Separability, and Left-Invertibility in the lambda-Calculus. Inf. Comput. 90(1): 1-32 (1991)

Corrado Böhm: Subduing Self-Application. ICALP 1989: 108-122

Corrado Böhm, Adolfo Piperno: Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus. LICS 1988: 91-101

Corrado Böhm: Functional Programming and Combinatory Algebras. MFCS 1988: 14-26

Corrado Böhm, Adolfo Piperno: Surjectivity for Finite Sets of Combinators by Weak Reduction. CSL 1987: 27-43

Corrado Böhm, Enrico Tronci: X-Separability and Left-Invertibility in lambda-calculus. LICS 1987: 320-328

Corrado Böhm: Reducing Recursion to Iteration by Algebraic Extension. ESOP 1986: 111-118

Corrado Böhm: Reducing Recursion to Iteration by Means of Pairs and N-tuples. Foundations of Logic and Functional Programming 1986: 58-66

Corrado Böhm, Alessandro Berarducci: Automatic Synthesis of Typed Lambda-Programs on Term Algebras. Theor. Comput. Sci. 39: 135-154 (1985)

Corrado Böhm: Combinatory Foundation of Functional Programming. Symposium on LISP and Functional Programming 1982: 29-36

Egidio Astesiano, Corrado Böhm (Eds.): CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings. Lecture Notes in Computer Science 112, Springer 1981, isbn 3-540-10828-9

Corrado Böhm, Antonio Machi, Giovanna Sontacchi: Complexity Bounds for Equivalence and Isomorphism of Latin Squares. Inf. Process. Lett. 10(4/5): 231-233 (1980)

Corrado Böhm, Silvio Micali: Minimal Forms in lambda-Calculus Computations. J. Symb. Log. 45(1): 165-171 (1980)

Corrado Böhm, Mariangiola Dezani-Ciancaglini, P. Peretti, Simona Ronchi Della Rocca: A Discrimination Algorithm Inside lambda-beta-Calculus. Theor. Comput. Sci. 8: 265-292 (1979)

Giorgio Ausiello, Corrado Böhm (Eds.): Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings. Lecture Notes in Computer Science 62, Springer 1978, isbn 3-540-08860-1

Corrado Böhm, Mario Coppo, Mariangiola Dezani-Ciancaglini: Termination Tests inside lambda-Calculus. ICALP 1977: 95-110

Corrado Böhm, Mariangiola Dezani-Ciancaglini: Lambda-terms as total or partial functions on normal forms. Lambda-Calculus and Computer Science Theory 1975: 96-121

Corrado Böhm (Ed.): Lambda-Calculus and Computer Science Theory, Proceedings of the Symposium Held in Rome, March 25-27, 1975. Lecture Notes in Computer Science 37, Springer 1975, isbn 3-540-07416-3

Corrado Böhm, Mariangiola Dezani-Ciancaglini: Combinatorial Problems, Combinator Equations and Normal Forms. ICALP 1974: 185-199

Corrado Böhm, Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca: Listing of information structures defined by fixed-point operators. Symposium on Programming 1974: 266-279

Corrado Böhm, Mariangiola Dezani: Notes on "A CUCH-machine: The automatic treatment of bound variables". International Journal of Parallel Programming 2(2): 157-160 (1973)

Corrado Böhm, Mariangiola Dezani-Ciancaglini: A CUCH-machine: The automatic treatment of bound variables. International Journal of Parallel Programming 1(2): 171-191 (1972)

Corrado Böhm, Mariangiola Dezani-Ciancaglini: Can Syntax Be Ignored during Translation? ICALP 1972: 197-207

Corrado Böhm, Giuseppe Jacopini: Flow diagrams, turing machines and languages with only two formation rules. Commun. ACM 9(5): 366-371 (1966)