Abstract
A finite set {F1, ...,Fn} of terms of λ-calculus is said to be:
-
separable iff, given n arbitrary terms X1, ..., Xn, there exists a context C [ ] such that C[Fi]=Xi for 1≤i≤n
-
semi-separable iff, given n−1 arbitrary terms X1, ..., Xn−1 there exists a context C [ ] such that C [Fi]=Xi for 1≤i ≤n−1 and C [Fn] is unsolvable.
In the present paper the constructive characterization of (semi)-se parability of finite sets of terms is given inside Scott's D∞-models of the λ-calculus.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. BARENDREGT, A Characterization of Terms of the λ-I-calculus having a Normal Form, Journal of Symbolic Logic, 38, 3, (1973), 441–445.
H. BARENDREGT, The Type Free Lambda Calculus, in: the Handbook of Mathematical Logic, J. Barwise, ed., Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, (1977), 1092–1132.
H.BARENDREGT, J.BERGSTRA, J.W.KLOP, M.VOLKEN, Degrees, Reductions and Representability in the Lambda Calculus, preprint, Utrecht University, Department of Mathematics, (1976).
H.BARENDREGT, The Separability of β-η-normal Forms, preprint, Utrecht University, Department of Mathematics, (1976).
G.BERRY, Sequentialité de l'Evaluation Formelle des λ-expressions, to appear in: Programmation, B. Robinet, ed..
C. BÖHM, The CUCH as a Formal and Description Language, in: Formal Language Description Languages, T.B. Steel, ed., North-Holland, Amsterdam (1966), 179–197.
C.BÖHM, Alcune proprietà delle forme β-η-normali del λ-k-calcolo, I.A.C., 696, Roma, (1968).
C.BÖHM, M.DEZANI-CIANCAGLINI, P.PERETTI, S.RONCHI DELLA ROCCA, A Discrimination Algorithm inside λ-η-calculus, to appear in Journal of Theoretical Computer Science.
H. HYLAND, A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus, J.London Math.Soc., 2, 12, (1976), 361–370.
J.J.LEVY, Réductions Corrects et Optimales dans le λ-calcul, Thèse de doctorat d'état, Université Paris VII, (1977).
G.D.PLOTKIN, LCF Considered as a Programming Language, to appear in Journal of Theoretical Computer Science.
D. SCOTT, The Lattice of Flow Diagrams, in: Semantics of Algorithmic Languages, E. Engeler, ed., Lecture Notes in Mathematics, 188, Springer-Verlag, New York, (1971), 311–366.
D. SCOTT, Continuous Lattices, In: Toposes, Algebraic Geometry and Logic, F.W. Lawvere, ed., Lecture Notes in Math. 274, Springer, Berlin, (1973), 97–136.
C.P. WADSWORTH, The Relation between Computational and Denotational Properties for Scott's D∞-models of the Lambda-Calculus, SIAM Journal Comput., 5, 3, (1976), 488–521.
C.P. WADSWORTH, Approximate Reductions and Lambda Calculus Models, to appear in SIAM Journal on Computing.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coppo, M., Dezani-Ciancaglini, M., Ronchi della Rocca, S. (1978). (Semi)-separability of finite sets of terms in Scott's D∞-models of the λ-calculus. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-08860-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08860-8
Online ISBN: 978-3-540-35807-7
eBook Packages: Springer Book Archive