Corrado Böhm

Affiliations:
  • University of Rome La Sapienza, Italy


According to our database1, Corrado Böhm authored at least 27 papers between 1966 and 2001.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2001
General Recursion on Second Order Term Algebras.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

1999
Fixed Point Equations Inside the Algebra of Normal Forms.
Fundam. Informaticae, 1999

1997
Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper).
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1994
The Ant-Lion Paradigm for Strong Normalization
Inf. Comput., October, 1994

Lambda-Definition of Function(al)s by Normal Forms.
Proceedings of the Programming Languages and Systems, 1994

1992
A Self-Interpreter of Lambda Calculus Having a Normal Form.
Proceedings of the Computer Science Logic, 6th Workshop, 1992

1991
About Systems of Equations, X-Separability, and Left-Invertibility in the lambda-Calculus
Inf. Comput., January, 1991

1989
Subduing Self-Application.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988
Functional Programming and Combinatory Algebras.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987
X-Separability and Left-Invertibility in lambda-calculus
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

Surjectivity for Finite Sets of Combinators by Weak Reduction.
Proceedings of the CSL '87, 1987

1986
Reducing Recursion to Iteration by Means of Pairs and N-tuples.
Proceedings of the Foundations of Logic and Functional Programming, 1986

Reducing Recursion to Iteration by Algebraic Extension.
Proceedings of the ESOP 86, 1986

1985
Automatic Synthesis of Typed Lambda-Programs on Term Algebras.
Theor. Comput. Sci., 1985

1982
Combinatory Foundation of Functional Programming.
Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, 1982

1980
Minimal Forms in lambda-Calculus Computations.
J. Symb. Log., 1980

Complexity Bounds for Equivalence and Isomorphism of Latin Squares.
Inf. Process. Lett., 1980

1979
A Discrimination Algorithm Inside lambda-beta-Calculus.
Theor. Comput. Sci., 1979

1977
Termination Tests inside lambda-Calculus.
Proceedings of the Automata, 1977

1975
Lambda-terms as total or partial functions on normal forms.
Proceedings of the Lambda-Calculus and Computer Science Theory, 1975

1974
Listing of information structures defined by fixed-point operators.
Proceedings of the Programming Symposium, 1974

Combinatorial Problems, Combinator Equations and Normal Forms.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973
Notes on "A CUCH-machine: The automatic treatment of bound variables".
Int. J. Parallel Program., 1973

1972
A CUCH-machine: The automatic treatment of bound variables.
Int. J. Parallel Program., 1972

Can Syntax Be Ignored during Translation?
Proceedings of the Automata, 1972

1966
Flow diagrams, turing machines and languages with only two formation rules.
Commun. ACM, 1966


  Loading...