Abstract
This paper studies the interplay between functional application and nondeterministic choice in the context of untyped λ-calculus. We introduce an operational semantics which is based on the idea of must preorder, coming from the theory of process algebras. To characterize this relation, we build a model using the classical inverse limit construction, and we prove it fully abstract using a generalization of Böhm trees.
This work has been partially supported by grants from ESPRIT-BRA 3230.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky, C.H.L. Ong, Full Abstraction in the Lazy Lambda Calculus, Research Rep., Dept. of Comp., Imperial College 1989.
E.A. Ashcroft, M.C.B. Hennessy, “A mathematical Semantics for a Nondeterministic Typed Lambda Calculus”, TCS 11, 1980.
E. Astesiano, G. Costa “Distributive Semantics for Nondeterministic Typed λcalculi”, TCS 32, 1984.
H.P. Barendregt, The Lambda-Calculus: Its Syntax and Semantics, North-Holland, 1984.
C. Böhm, “Alcune proprieta' delle forme β-gh-normali nel λ-K-calcolo”, Pubblicazioni dell' I.A.C. n. 696, Roma 1968.
G. Boudol, “A Lambda Calculus for Parallel Functions”, INRIA Preprint, 1990.
M. Coppo, M. Dezani-Ciancaglini, S. Ronchi della Rocca, “(Semi)-separability of finite sets of terms in Scott's D ∞-models of the λ-calculus”, LNCS 62, 1978.
U. de'Liguoro, “Non deterministic untyped λ-calculus”, Ph.D. Thesis, 1991.
R. De Nicola, M.C.B. Hennessy, “Testing Equivalences for Processes”, TCS 34, 1983.
M.C.B. Hennessy, “The Semantics of Call-by-value and Call-by-name in a nondeterministic Environment”, SIAM J. Comput. 9, 1980.
M.C.B. Hennessy, G.D. Plotkin, “Full Abstraction for a Simple Parallel Programming Language”, LNCS 74, 1979.
J.R. Hindley, G. Longo, “Lambda Calculus Models and Extensionality”, Z. Math. Logik Grundlag. Math. 26, 1980.
M. Hyland, “A Syntactic Characterization of the Equality in some Models for the Lambda Calculus”, J. of the London Math. Soc. 12, 1976.
R. Jagadeesan, P. Panangaden, “A Domain-theoretic Model for a Higher-order Process Calculus”, LNCS 443, 1990.
R. Milner “Functions as Processes”, LNCS 443, 1990.
E. Moggi, “Notions of Computation and Monads”, Inf. Comp. 93, 1991.
J.H. Morris, Lambda Calculus Models of Programming Languages, Dissertation, M.I.T. 1968.
G.D. Plotkin, “Call-by-name, Call-by-value and the λ-calculus”, TCS 1, 1975.
G.D. Plotkin, “A Powerdomain Construction”, SIAM J. of Comp. 5, 1976.
K. Sharma, Syntactic Aspects of the Non-deterministic Lambda Calculus, Master's thesis, Washington State University, September 1984. Available as internal report CS-84-127 of the Comp. Sci Dept.
M.B. Smyth, “Power Domains”, J. Comp. Sys. Sci. 16, 1978.
B. Thomsen, “A Calculus of Higher-Order Communicating Systems”, ACM 143, 1989.
C.P. Wadsworth, “The relation between computational and denotational properties for Scott's D ∞-models of the lambda-calculus”, SIAM J. of Comp. 5, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De'Liguoro, U., Piperno, A. (1992). Must preorder in non-deterministic untyped λ-calculus. In: Raoult, J.C. (eds) CAAP '92. CAAP 1992. Lecture Notes in Computer Science, vol 581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55251-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-55251-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55251-2
Online ISBN: 978-3-540-46799-1
eBook Packages: Springer Book Archive