Corrado Böhm

发表

Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper)

Corrado Böhm, 1997, TAPSOFT.

Can Syntax Be Ignored during Translation?

Mariangiola Dezani-Ciancaglini, Corrado Böhm, 1972, ICALP.

Fixed Point Equations Inside the Algebra of Normal Forms

Corrado Böhm, C. Böhm, 1999, Fundam. Informaticae.

Lambda-Calculus and Computer Science Theory, Proceedings of the Symposium Held in Rome, Italy, March 25-27, 1975

Corrado Böhm, Istituto per le applicazioni del calcolo, 1975, Lambda-Calculus and Computer Science Theory.

Minimal Forms in lambda-Calculus Computations

Silvio Micali, Corrado Böhm, 1980, J. Symb. Log..

Characterizing X-separability and one-side invertibility in lambda - beta - Omega -calculus

Corrado Böhm, Adolfo Piperno, 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

A Self-Interpreter of Lambda Calculus Having a Normal Form

Corrado Böhm, Alessandro Berarducci, A. Berarducci, 1992, CSL.

The Ant-Lion Paradigm for Strong Normalization

Benedetto Intrigila, Corrado Böhm, 1994, Inf. Comput..

Theoretical Computer Science: Proceedings of the Third Italian Conference, Mantova, 2-4 November 1989

Alberto Bertoni, Pierangelo Miglioli, Corrado Böhm, 1989 .

Automatic Synthesis of Typed Lambda-Programs on Term Algebras

Corrado Böhm, Alessandro Berarducci, A. Berarducci, 1985, Theor. Comput. Sci..

A Discrimination Algorithm Inside lambda-beta-Calculus

Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca, Corrado Böhm, 1979, Theor. Comput. Sci..

Subduing Self-Application

Corrado Böhm, C. Böhm, 1989, ICALP.

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory

Corrado Böhm, 1975 .

Proceedings of the Fifth Colloquium on Automata, Languages and Programming

Giorgio Ausiello, Corrado Böhm, 1978 .

Reducing Recursion to Iteration by Means of Pairs and N-tuples

Corrado Böhm, 1986, Foundations of Logic and Functional Programming.

X-Separability and Left-Invertibility in lambda-calculus

Enrico Tronci, Corrado Böhm, 1987, LICS.

Logic and Computers

Corrado Böhm, 1981 .

Functional Programming and Combinatory Algebras

Corrado Böhm, C. Böhm, 1988, International Symposium on Mathematical Foundations of Computer Science.

Notes on “A CUCH-machine: The automatic treatment of bound variables”

Mariangiola Dezani-Ciancaglini, Corrado Böhm, 2004, International Journal of Computer & Information Sciences.

Listing of information structures defined by fixed-point operators

Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca, Corrado Böhm, 1974, Symposium on Programming.

Combinatorial Problems, Combinator Equations and Normal Forms

Mariangiola Dezani-Ciancaglini, Corrado Böhm, M. Dezani-Ciancaglini, 1974, ICALP.

Lambda-Definition of Function(al)s by Normal Forms

Corrado Böhm, Adolfo Piperno, Stefano Guerrini, 1994, ESOP.

Flow diagrams, turing machines and languages with only two formation rules

Corrado Böhm, Giuseppe Jacopini, C. Böhm, 1966, CACM.

Surjectivity for Finite Sets of Combinators by Weak Reduction

Corrado Böhm, Adolfo Piperno, 1987, CSL.

Reducing Recursion to Iteration by Algebraic Extension

Corrado Böhm, 1986, ESOP.

A CUCH-machine: The automatic treatment of bound variables

Mariangiola Dezani-Ciancaglini, Corrado Böhm, M. Dezani-Ciancaglini, 1972, International Journal of Computer & Information Sciences.

Complexity Bounds for Equivalence and Isomorphism of Latin Squares

Corrado Böhm, Giovanna Sontacchi, Antonio Machi, 1980, Inf. Process. Lett..

General Recursion on Second Order Term Algebras

Corrado Böhm, Alessandro Berarducci, 2001, RTA.

Lambda-terms as total or partial functions on normal forms

Mariangiola Dezani-Ciancaglini, Corrado Böhm, M. Dezani-Ciancaglini, 1975, Lambda-Calculus and Computer Science Theory.

Termination Tests inside lambda-Calculus

Mariangiola Dezani-Ciancaglini, Corrado Böhm, Mario Coppo, 1977, ICALP.

About Systems of Equations, X-Separability, and Left-Invertibility in the lambda-Calculus

Enrico Tronci, Corrado Böhm, E. Tronci, 1991, Inf. Comput..

CHARACTERIZING X-SEPARABILITY AND ONE-SIDE INVERTIBILITY IN A-p-n-CALCULUS'

Corrado Böhm, Adolfo Piperno, A. Piperno, 1988 .

A data structure formalization through generating functions

Corrado Böhm, M. Dezani-Ciancaglini, 1974 .