Abstract
In this paper the set of λ -terras is split into 2ω+1 disjoint classes P h (−ω≤h≤ω). This classification takes into account the meaning of a λ-term F as function on normal forms, and more precisely:
-
1
iff when auccessively applied to any number of normal forms it gives a λ-term without normal form
-
2
(0<h<ω) iff when successively applied to h-1 arbitrary normal forms it gives a λ-term without normal form, but there exist h normal forms X1,...,Xh such that FX1...Xh possesses normal form
-
3
(0≤h>ω) iff when successively applied to h arbitrary normal forms it gives a λ-term which possesses normal form, but there exist h+1 normal forms X1,...,Xh+1 such that FX1...Xh+1 possesses no normal form
-
4
iff when successively applied to any number of normal forms it gives a λ-term which possesses normal form.
This classification can be effectively determined only for λ-terms in normal form.
Preview
Unable to display preview. Download preview PDF.
References
Böhm,C., The CUCH as a Formal and Description Language, Formal Language Description Languages for Computer Programming, ed.T.B. Steel, North-Holland, Amsterdam, (1966), 179–197.
Böhm,C., M.Dezani-Ciancaglini, Combinatorial Problems Combinator Equations and Normal Forms, Automata Languages and Programming, ed. J. Loeckx, Lecture Notes in Computer Science, 14, Springer-Verlag, (1974), 185–199.
Church,A., J.Barkley Rosser, Some properties of λ-conversion, Trans.Amer. Math Soc., 39, (1936), 472–482.
Curry, H.B., J.R. Hindley, J.P. Seldin, Combinatory Logic, 2, North-Holland, Amsterdam, (1972).
Knuth, D.E., Examples of Formal Semantics, Symposium on Semantics of Algorithmic Languages, 188, ed. E. Engeler, Springer-Verlag, Berlin, (1970), 212–235.
Simone, C., Un modello di λ-calcolo fortemente equivalente agli schemi ricorsivi, Calcolo, 1, (1974), 111–125.
Wadsworth, C.P., Semantics and Pragmatics of λ-calculus, Ph.D. Thesis, Oxford, (1971).
Welch, P.H., Continuous Semantics and Inside-Outside Reductions, these Proceedings.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böhm, C., Dezani-Ciancaglini, M. (1975). λ-Terms as total or partial functions on normal forms. In: Böhm, C. (eds) λ-Calculus and Computer Science Theory. LCCST 1975. Lecture Notes in Computer Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029521
Download citation
DOI: https://doi.org/10.1007/BFb0029521
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07416-8
Online ISBN: 978-3-540-37944-7
eBook Packages: Springer Book Archive