Corrado Böhm

31 papers A* 7A 2B 3Journal 11Unranked 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
Some properties of β-η-normal forms in λ-K-calculus (Alcune proprietá delle forme β-η-normali nel λ-K-calcolo).
CoRR
Corrado Böhm, Chun Tian
2001 — conf
General Recursion on Second Order Term Algebras.
RTA
Alessandro Berarducci, Corrado Böhm
1999 J jnl
Fixed Point Equations Inside the Algebra of Normal Forms.
Fundam. Informaticae
Corrado Böhm
1997 — conf
Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper).
TAPSOFT
Corrado Böhm
1994 A conf
Lambda-Definition of Function(al)s by Normal Forms.
ESOP
Corrado Böhm, Adolfo Piperno, Stefano Guerrini
1994 J jnl
The Ant-Lion Paradigm for Strong Normalization
Inf. Comput.
Corrado Böhm, Benedetto Intrigila
1992 B conf
A Self-Interpreter of Lambda Calculus Having a Normal Form.
CSL
Alessandro Berarducci, Corrado Böhm
1991 J jnl
About Systems of Equations, X-Separability, and Left-Invertibility in the lambda-Calculus
Inf. Comput.
Corrado Böhm, Enrico Tronci
1989 A* conf
Subduing Self-Application.
ICALP
Corrado Böhm
1988 A* conf
Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus
LICS
Corrado Böhm, Adolfo Piperno
1988 B conf
Functional Programming and Combinatory Algebras.
MFCS
Corrado Böhm
1987 B conf
Surjectivity for Finite Sets of Combinators by Weak Reduction.
CSL
Corrado Böhm, Adolfo Piperno
1987 A* conf
X-Separability and Left-Invertibility in lambda-calculus
LICS
Corrado Böhm, Enrico Tronci
1986 A conf
Reducing Recursion to Iteration by Algebraic Extension.
ESOP
Corrado Böhm
1986 — conf
Reducing Recursion to Iteration by Means of Pairs and N-tuples.
Foundations of Logic and Functional Programming
Corrado Böhm
1985 J jnl
Automatic Synthesis of Typed Lambda-Programs on Term Algebras.
Theor. Comput. Sci.
Corrado Böhm, Alessandro Berarducci
1982 — conf
Combinatory Foundation of Functional Programming.
Symposium on LISP and Functional Programming
Corrado Böhm
1981 — ed.
CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings
CAAP
Egidio Astesiano, Corrado Böhm
1980 J jnl
Complexity Bounds for Equivalence and Isomorphism of Latin Squares.
Inf. Process. Lett.
Corrado Böhm, Antonio Machi, Giovanna Sontacchi
1980 J jnl
Minimal Forms in lambda-Calculus Computations.
J. Symb. Log.
Corrado Böhm, Silvio Micali
1979 J jnl
A Discrimination Algorithm Inside lambda-beta-Calculus.
Theor. Comput. Sci.
Corrado Böhm, Mariangiola Dezani-Ciancaglini, P. Peretti, Simona Ronchi Della Rocca
1978 A* ed.
Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings
ICALP
Giorgio Ausiello, Corrado Böhm
1977 A* conf
Termination Tests inside lambda-Calculus.
ICALP
Corrado Böhm, Mario Coppo, Mariangiola Dezani-Ciancaglini
1975 — ed.
Lambda-Calculus and Computer Science Theory, Proceedings of the Symposium Held in Rome, Italy, March 25-27, 1975
Lambda-Calculus and Computer Science Theory
Corrado Böhm
1975 — conf
Lambda-terms as total or partial functions on normal forms.
Lambda-Calculus and Computer Science Theory
Corrado Böhm, Mariangiola Dezani-Ciancaglini
1974 A* conf
Combinatorial Problems, Combinator Equations and Normal Forms.
ICALP
Corrado Böhm, Mariangiola Dezani-Ciancaglini
1974 — conf
Listing of information structures defined by fixed-point operators.
Symposium on Programming
Corrado Böhm, Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca
1973 J jnl
Notes on "A CUCH-machine: The automatic treatment of bound variables".
Int. J. Parallel Program.
Corrado Böhm, Mariangiola Dezani
1972 J jnl
A CUCH-machine: The automatic treatment of bound variables.
Int. J. Parallel Program.
Corrado Böhm, Mariangiola Dezani-Ciancaglini
1972 A* conf
Can Syntax Be Ignored during Translation?
ICALP
Corrado Böhm, Mariangiola Dezani-Ciancaglini
1966 J jnl
Flow diagrams, turing machines and languages with only two formation rules.
Commun. ACM
Corrado Böhm, Giuseppe Jacopini