| 2001 |
|---|
| 28 | EE | Alessandro Berarducci,
Corrado Böhm:
General Recursion on Second Order Term Algebras.
RTA 2001: 15-30 |
| 1999 |
|---|
| 27 | | Corrado Böhm:
Fixed Point Equations Inside the Algebra of Normal Forms.
Fundam. Inform. 37(4): 329-342 (1999) |
| 1997 |
|---|
| 26 | | Corrado Böhm:
Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper).
TAPSOFT 1997: 3-5 |
| 1994 |
|---|
| 25 | | Corrado Böhm,
Adolfo Piperno,
Stefano Guerrini:
Lambda-Definition of Function(al)s by Normal Forms.
ESOP 1994: 135-149 |
| 24 | | Corrado Böhm,
Benedetto Intrigila:
The Ant-Lion Paradigm for Strong Normalization
Inf. Comput. 114(1): 30-49 (1994) |
| 1992 |
|---|
| 23 | | Alessandro Berarducci,
Corrado Böhm:
A Self-Interpreter of Lambda Calculus Having a Normal Form.
CSL 1992: 85-99 |
| 1991 |
|---|
| 22 | | 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) |
| 1989 |
|---|
| 21 | | Corrado Böhm:
Subduing Self-Application.
ICALP 1989: 108-122 |
| 1988 |
|---|
| 20 | | Corrado Böhm,
Adolfo Piperno:
Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus
LICS 1988: 91-101 |
| 19 | | Corrado Böhm:
Functional Programming and Combinatory Algebras.
MFCS 1988: 14-26 |
| 1987 |
|---|
| 18 | | Corrado Böhm,
Adolfo Piperno:
Surjectivity for Finite Sets of Combinators by Weak Reduction.
CSL 1987: 27-43 |
| 17 | | Corrado Böhm,
Enrico Tronci:
X-Separability and Left-Invertibility in lambda-calculus
LICS 1987: 320-328 |
| 1986 |
|---|
| 16 | | Corrado Böhm:
Reducing Recursion to Iteration by Algebraic Extension.
ESOP 1986: 111-118 |
| 15 | | Corrado Böhm:
Reducing Recursion to Iteration by Means of Pairs and N-tuples.
Foundations of Logic and Functional Programming 1986: 58-66 |
| 1985 |
|---|
| 14 | | Corrado Böhm,
Alessandro Berarducci:
Automatic Synthesis of Typed Lambda-Programs on Term Algebras.
Theor. Comput. Sci. 39: 135-154 (1985) |
| 1982 |
|---|
| 13 | | Corrado Böhm:
Combinatory Foundation of Functional Programming.
Symposium on LISP and Functional Programming 1982: 29-36 |
| 1981 |
|---|
| 12 | | Egidio Astesiano,
Corrado Böhm:
CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings
Springer 1981 |
| 1980 |
|---|
| 11 | | 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) |
| 10 | | Corrado Böhm,
Silvio Micali:
Minimal Forms in lambda-Calculus Computations.
J. Symb. Log. 45(1): 165-171 (1980) |
| 1979 |
|---|
| 9 | | 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) |
| 1978 |
|---|
| 8 | | Giorgio Ausiello,
Corrado Böhm:
Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings
Springer 1978 |
| 1977 |
|---|
| 7 | | Corrado Böhm,
Mario Coppo,
Mariangiola Dezani-Ciancaglini:
Termination Tests inside lambda-Calculus.
ICALP 1977: 95-110 |
| 1975 |
|---|
| 6 | | Corrado Böhm:
Lambda-Calculus and Computer Science Theory, Proceedings of the Symposium Held in Rome, March 25-27, 1975
Springer 1975 |
| 5 | | 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 |
| 1974 |
|---|
| 4 | | Corrado Böhm,
Mariangiola Dezani-Ciancaglini:
Combinatorial Problems, Combinator Equations and Normal Forms.
ICALP 1974: 185-199 |
| 3 | | 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 |
| 1972 |
|---|
| 2 | | Corrado Böhm:
Can Syntax Be Ignored during Translation?
ICALP 1972: 197-207 |
| 1966 |
|---|
| 1 | EE | Corrado Böhm,
Giuseppe Jacopini:
Flow diagrams, turing machines and languages with only two formation rules.
Commun. ACM 9(5): 366-371 (1966) |
