Skip to main content
SpringerLink
Log in

Algebraic interpretation of lambda calculus with resources

  • Conference paper
  • First Online:
CONCUR '96: Concurrency Theory (CONCUR 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1119))

Included in the following conference series:

Abstract

Lambda calculus with resources λ r is a non-deterministic refinement of lazy lambda calculus which allows to control argument availability and introduces the possibility of raising deadlocks during evaluation. We apply Lévy's program [18] to λ r : we give an algebraic interpretation of this calculus in terms of approximants which is adequate w.r.t. the observational semantics of λ r .

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy. Explicit Substitutions. Journal of Functional Programming, 1. 1991.

    Google Scholar 

  2. S. Abramsky. The Lazy Lambda Calculus. In D. Turner, editor, Research Topics in Functional Programming. Addison Wesley. 1989.

    Google Scholar 

  3. S. Abramsky, L. Ong. Full Abstraction in the lazy lambda calculus. Information and Computation, 105(2). 1993.

    Google Scholar 

  4. H.P. Barendregt. The Lambda Calculus. North-Holland. 1985.

    Google Scholar 

  5. G. Boudol. A Lambda-Calculus for Parallel Functions. Technical Report 1231, INRIA Sophia-Antipolis. 1990.

    Google Scholar 

  6. G. Boudol. The lambda calculus with multiplicities. Technical Report 2025, INRIA Sophia-Antipolis. 1993.

    Google Scholar 

  7. G. Boudol. Lambda-calculi for (strict) parallel functions. Information and Computation, 108(1). 1994.

    Google Scholar 

  8. G. Boudol, C. Laneve. The discriminating power of multiplicities in the λ-calculus. Information and Computation 126 (1). 1996.

    Google Scholar 

  9. G. Boudol, C. Laneve. Termination, deadlock and divergence in the λ-calculus with multiplicities. Proceedings of the 11th Conference on the Mathematical Foundations of Programming Semantics, Electronic Notes in Computer Science 1. 1995.

    Google Scholar 

  10. G. Boudol, C. Laneve. λ-calculus, Multiplicities and the π-calculus. Technical Report 2581, INRIA Sophia-Antipolis. 1995.

    Google Scholar 

  11. G. Boudol, C. Lavatelli. Full Abstraction for Lambda Calculus with Resources and Convergence Testing. CAAP'96. LNCS 1059, Springer-Verlag, Berlin. 1996.

    Google Scholar 

  12. P.-L. Curien, T.Hardin, J.-J. Lévy. Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. Journal of ACM 43(2). 1996.

    Google Scholar 

  13. M. Dezani-Ciancaglini, U. de Liguoro, A. Piperno. Fully Abstract Semantics for Concurrent λ-calculus. TACS'94. LNCS 789, Springer-Verlag, Berlin. 1994.

    Google Scholar 

  14. M. Dezani-Ciancaglini, U. de Liguoro, A. Piperno. Filter Models for Conjunctive-Disjunctive λ-calculi. To appear in TCS.

    Google Scholar 

  15. J.M.E. Hyland. A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus. Journal of the London Mathematical Society 12. 1976.

    Google Scholar 

  16. C. Lavatelli. Non-deterministic lazy λ-calculus vs. π-calculus. Technical Report LIENS 93-1. 1993.

    Google Scholar 

  17. C. Lavatelli. Sémantique du lambda-calcul avec ressources. PhD. Thesis. Université Paris 7. France. Janvier 1996.

    Google Scholar 

  18. J.-J. Lévy. An algebraic interpretation of the λΒK-calculus; and an application of a labelled λ-calculus. Theoretical Computer Science, 2(1). 1976.

    Google Scholar 

  19. G. Longo. Set Theoretical Models of Lambda Calculus: Theories, expansions and isomorphisms. Annals of Pure and Applied Logic, 24. 1983.

    Google Scholar 

  20. R. Milner, J. Parrow, D. Walker. A Calculus of Mobile Processes, Parts I and II. Information and Computation, 100(1). 1992.

    Google Scholar 

  21. R. Milner. Functions as Processes. Mathematical Structures in Computer Science, 2. 1992.

    Google Scholar 

  22. C.-H. Luke Ong. The Lazy Lambda Calculus/ An Investigation into the Foundations of Functional Programming. PhD Thesis, Imperial College. 1988.

    Google Scholar 

  23. G. Plotkin. LCF Considered as a Programming Language. Theoretical Computer Science, 5. 1975.

    Google Scholar 

  24. C. Wadsworth. The relation between computational and denotational properties for Scott D∞-model of the lambda-calculus. SIAM Journal on Computing, 5. 1976.

    Google Scholar 

  25. C. Wadsworth. Approximate Reduction and Lambda-Calculus Models. SIAM Journal on Computing, 7. 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. école Normale Supérieure, LIENS, 45, rue d'Ulm, 75005, Paris, France

    Carolina Lavatelli

Authors
  1. Carolina Lavatelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ugo Montanari Vladimiro Sassone

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lavatelli, C. (1996). Algebraic interpretation of lambda calculus with resources. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-61604-7_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61604-7

  • Online ISBN: 978-3-540-70625-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation