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

Can Syntax Be Ignored during Translation? - Corrado Böhm; Mariangiola Dezani-Ciancaglini (ICALP, 1972)

A CUCH-machine: The automatic treatment of bound variables. - Corrado Böhm; Mariangiola Dezani-Ciancaglini (Int. J. Parallel Program., 1972)

Notes on "A CUCH-machine: The automatic treatment of bound variables". - Corrado Böhm; Mariangiola Dezani (Int. J. Parallel Program., 1973)

Combinatorial Problems, Combinator Equations and Normal Forms. - Corrado Böhm; Mariangiola Dezani-Ciancaglini (ICALP, 1974)

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

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

Termination Tests inside lambda-Calculus. - Corrado Böhm; Mario Coppo; Mariangiola Dezani-Ciancaglini (ICALP, 1977)

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

Complexity Bounds for Equivalence and Isomorphism of Latin Squares. - Corrado Böhm; Antonio Machi; Giovanna Sontacchi (Inf. Process. Lett., 1980)

Minimal Forms in lambda-Calculus Computations. - Corrado Böhm; Silvio Micali (J. Symb. Log., 1980)

Combinatory Foundation of Functional Programming. - Corrado Böhm (Symposium on LISP and Functional Programming, 1982)

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

Reducing Recursion to Iteration by Algebraic Extension. - Corrado Böhm (ESOP, 1986)

Reducing Recursion to Iteration by Means of Pairs and N-tuples. - Corrado Böhm (Foundations of Logic and Functional Programming, 1986)

Surjectivity for Finite Sets of Combinators by Weak Reduction. - Corrado Böhm; Adolfo Piperno (CSL, 1987)

X-Separability and Left-Invertibility in lambda-calculus - Corrado Böhm; Enrico Tronci (LICS, 1987)

Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus - Corrado Böhm; Adolfo Piperno (LICS, 1988)

Functional Programming and Combinatory Algebras. - Corrado Böhm (MFCS, 1988)

Subduing Self-Application. - Corrado Böhm (ICALP, 1989)

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

A Self-Interpreter of Lambda Calculus Having a Normal Form. - Alessandro Berarducci; Corrado Böhm (CSL, 1992)

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

The Ant-Lion Paradigm for Strong Normalization - Corrado Böhm; Benedetto Intrigila (Inf. Comput., 1994)

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

Fixed Point Equations Inside the Algebra of Normal Forms. - Corrado Böhm (Fundam. Informaticae, 1999)

General Recursion on Second Order Term Algebras. - Alessandro Berarducci; Corrado Böhm (RTA, 2001)

Some properties of β-η-normal forms in λ-K-calculus (Alcune proprietá delle forme β-η-normali nel λ-K-calcolo). - Corrado Böhm; Chun Tian 001 (CoRR, 2025)