Abstract
We consider a language of typed λ-expressions with primitives including nondeterministic choice operators. Starting from the natural idea that a first order nondeterministic procedure should define a one-many function, we give a reduction system in which ground arguments are shared, in order to avoid some unnatural consequences due to unrestricted application of the copy-rule. This is achieved by extending the language and modifying the usual β-rule. Then we discuss how to define a correspon ding denotational semantics, establishing in particular the existence of a model which is fully abstract w.r.t. the operational semantics.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.Arnold, Schémas de programmes récursifs non déterministes avec appel syncrone, Proc. 3e Colloque International sur la Programmation, Paris 1978, Dunod, 126–140.
E.Astesiano, G.Costa, On algebraic semantics of polyadic recursive schemas, Proc. 2e Colloque sur les Arbres an Algèbre et en Programmation, Lille 1977, Université de Lille, 29–83.
= = = Nondeterminism and fully abstract models, 1978, submitted for publication.
= = = Fully abstract semantics for nondeterministic typed λ-s-calculi, 1989, to appear.
A.Arnold, M.Nivat,Non deterministic recursive program schemas, Proc. FCT 1977, Lecture Notes in C.S. 56, Springer, 12–21.
= = = Interpretations métriques des schémas de programme, Proc. 1er Colloque AFCET-SMF de Math. Appliquées, Ecole Polytechnique, 1978, Vol.1, 191–208.
G.Berry, Stable models of typed λ-calculi, Proc. 5th ICALP, Udine 1978, Lecture Notes in C.S. 62, Springer, 72–89.
M.Hennessy, E.A.Ashcroft, The semantics of nondeterminism, Proc. 3rd ICALP, Edinburg 1976, Edinburg University Press, 478–493.
= = = Parameter-passing mechanism and nondeterminism, Proc. 9th ACM Symp. on the Theory of Comput., 1977, 306–311.
J.J.Lévy, Le problème du partage dans l'évaluation des λ-expressions, Proc. 1er Colloque AFCET-SMF de Math. Appliquées, Ecole Polytechnique, 1978.
R.Milner, Processes, a mathematical model for computing agents, Logic Coll. 1973, Studies in Logic and the Foundations of Mathematics 80, North-Holland & American Elsevier, 1975, 157–174.
= = =Fully abstract models of typed λ-calculi, T.C.S. 4 (1977) 1–22.
G. Plotkin, A powerdomain construction, Siam J. Comput. 5 (1976) 452–487.
= = =LCF as a programming language, T.C.S. 5 (1977) 223–255.
G.Pacini, C.Montangero, F.Turini, Graph representation and computation rules for a typeless recursive language, Proc. 2nd ICALP, Saarbrücken, 1974, Lecture Notes in C.S. 14, Springer, 157–169.
M.B. Smyth, Power domains, JCSS 16 (1978) 23–36.
J. Vuillemin, Correct and optimal implementation of recursion in a simple programming language, JCSS 9 (1974) 332–354.
C.P.Wadsworth, Semantics and pragmatics of the λ-calculus, Ph.D. Thesis, University of Oxford, 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Astesiano, E., Costa, G. (1979). Sharing in nondeterminism. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_1
Download citation
DOI: https://doi.org/10.1007/3-540-09510-1_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09510-1
Online ISBN: 978-3-540-35168-9
eBook Packages: Springer Book Archive