Abstract
We define a new type system for lambda calculi with resources which characterizes the flat operational semantics that distinguishes deadlock from divergence. The system follows the intersection style but with a special management of structural rules. The novel feature in comparison with previous works is the introduction of a controlled form of weakening that allows to deal with deadlock. To show the adequacy result we apply the realizability technique on a decorated calculus where the resources to be consumed are explicitly indicated.
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
Abramsky, S., Ong, L.: Full Abstraction in the lazy lambda calculus. Information and Computation 105(2) (1993)
Boudol, G.: The lambda calculus with multiplicities. Rapport de Recherche 2025, INRIA Sophia-Antipolis (1993)
Boudol, G.: Typing the use of resources in a Concurrent Calculus. In: Shyamasundar, R.K. (ed.) ASIAN 1997. LNCS, vol. 1345, Springer, Heidelberg (1997)
Boudol, G., Laneve, C.: The discriminating power of multiplicities in the λ-calculus. Information and Computation 126(1) (1996)
Boudol, G., Laneve, C.: Termination, deadlock and divergence in the λ-calculus with multiplicities. In: Proc. 11th Mathematical Foundations of Programming Semantics Conference. Electronic Notes in Computer Science (1995)
Boudol, G., Laneve, C.: λ-Calculus, Multiplicities and the π-Calculus. Rapport de Recherche 2581, INRIA Sophia-Antipolis (1995)
Boudol, G., Lavatelli, C.: Full Abstraction for lambda-calculus with resources and convergence testing. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol. 1059. Springer, Heidelberg (1996)
Kobayashi, N.: A partially deadlock-free types process calculus. In: Proceedings of LICS 1997 (1997)
Lavatelli, C.: Sémantique du Lambda Calcul avec Ressources. Thèse de Doctorat. Université Paris VII, France (1996)
Lavatelli, C.: Algebraic Interpretation of the Lambda Calculus with Resources. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119. Springer, Heidelberg (1996)
Lévy, J.-J.: An algebraic interpretation of the λβK-calculus; and an application of a labeled λ-calculus. Theoretical Computer Science 2(1) (1976)
Longo, G.: Set Theoretical Models of Lambda Calculus: Theories, expansions and isomorphisms. Annals of Pure and Applied Logic 24 (1983)
Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Parts I and II. Information and Computation 100(1) (1992)
Milner, R.: Functions as Processes. Mathematical Structures in Computer Science 2 (1992)
Luke Ong, C.-H.: Fully Abstract Models of the Lazy Lambda Calculus. In: Proceedings of the 29th Conference on Foundations of Computer Science. The Computer Science Press, Rockville (1988)
Sangiorgi, D.: The Lazy Lambda Calculus in a Concurrency Scenario. Information and Computation 120(1) (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lavatelli, C. (1998). Deadlock Sensitive Types for Lambda Calculus with Resources. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-49382-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65384-4
Online ISBN: 978-3-540-49382-2
eBook Packages: Springer Book Archive