Abstract
We recently introduced an extensional model of the pure λ-calculus living in a canonical cartesian closed category of sets and relations [6]. In the present paper, we study the non-deterministic features of this model. Unlike most traditional approaches, our way of interpreting non-determinism does not require any additional powerdomain construction. We show that our model provides a straightforward semantics of non-determinism (may convergence) by means of unions of interpretations, as well as of parallelism (must convergence) by means of a binary, non-idempotent operation available on the model, which is related to the mix rule of Linear Logic. More precisely, we introduce a λ-calculus extended with non-deterministic choice and parallel composition, and we define its operational semantics (based on the may and must intuitions underlying our two additional operations). We describe the interpretation of this calculus in our model and show that this interpretation is sensible with respect to our operational semantics: a term converges if, and only if, it has a non-empty interpretation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asperti, A., Longo, G.: Categories, types and structures. Category theory for the working computer scientist. MIT Press, Cambridge (1991)
Barendregt, H.P.: The lambda calculus: Its syntax and semantics. North-Holland Publishing Co., Amsterdam (1984)
Berline, C.: From computation to foundations via functions and application: The λ-calculus and its webbed models. Theor. Comp. Sci. 249, 81–161 (2000)
Boudol, G.: Lambda-calculi for (strict) parallel functions. Inf. Comput. 108(1), 51–127 (1994)
Boudol, G., Lavatelli, C.: Full abstraction for lambda calculus with resources and convergence testing. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol. 1059, pp. 302–316. Springer, Heidelberg (1996)
Bucciarelli, A., Ehrhard, T., Manzonetto, G.: Not enough points is enough. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 268–282. Springer, Heidelberg (2007)
Danos, V., Krivine, J.-L.: Disjunctive tautologies as synchronisation schemes. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 292–301. Springer, Heidelberg (2000)
Dezani Ciancaglini, M., de Liguoro, U., Piperno, A.: Filter models for conjunctive-disjunctive lambda-calculi. Theor. Comput. Sci. 170(1-2), 83–128 (1996)
Dezani Ciancaglini, M., de Liguoro, U., Piperno, A.: A filter model for concurrent λ-calculus. SIAM J. Comput. 27(5), 1376–1419 (1998)
Ehrhard, T.: Hypercoherences: a strongly stable model of linear logic. Math. Struct. Comp. Sci. 3(4), 365–385 (1993)
Faure, G., Miquel, A.: A categorical semantics for the parallel lambda-calculus (submitted), http://rho.loria.fr/data/lics07.pdf
Girard, J.-Y.: Linear Logic. Theor. Comp. Sci. 50 (1988)
Krivine, J.-L.: Lambda-calculus. Types and models. Ellis Horwood, Hemel Hempstead (1993)
Laird, J.: Bidomains and full abstraction for countable nondeterminism. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 352–366. Springer, Heidelberg (2006)
Manzonetto, G.: Models and theories of lambda calculus. Ph.D. Thesis, Univ. Ca’Foscari (Venezia), Univ. Paris 7, Paris (2008)
Ong, C.-H.L.: Non-determinism in a functional setting. In: Proc. of LICS 1993, pp. 275–286 (1993)
Paolini, L.: A stable programming language. Inf. Comput. 204(3), 339–375 (2006)
Plotkin, G.D.: A powerdomain construction. SIAM J. Comput. 5(3), 452–487 (1976)
Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci. 5(3), 225–255 (1977)
Selinger, P.: The λ-calculus is algebraic. J. Funct. Program. 12(6), 549–566 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bucciarelli, A., Ehrhard, T., Manzonetto, G. (2008). A Relational Model of a Parallel and Non-deterministic λ-Calculus. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-92687-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92686-3
Online ISBN: 978-3-540-92687-0
eBook Packages: Computer ScienceComputer Science (R0)