A semantics for lambda calculi with resources

Mathematical Structures in Computer Science

Volumn 9, Issue 4, 1999, Pages 437-482

  Boudol, Gerard ^a   Curien, Pierre Louis ^b   Lavatelli, Carolina ^b  

^a INRIA   (France)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84999459897     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129599002893     Document Type: Article

References (42)

1. Abadi, M., Cardelli, L., Curien, P.-L. and Levy, J.-J. (1991) Explicit Substitutions. Journal of Functional Programming.
2. Abramsky, S. (1989) The Lazy Lambda Calculus. In: Turner, D. (ed.) Research Topics in Functional Programming, Addison Wesley.
3. Abramsky, S. and Ong, L. (1993) Full Abstraction in the Lazy Lambda Calculus. Information and Computation 105 (2).
4. Amadio, R. and Curien, P.-L. (1998) Domains and Lambda-Calculi, Cambridge University Press.
5. Barendregt, H. P. (1984) The Lambda Calculus, North-Holland.
6. Barendregt, H. P., Coppo, M. and Dezani-Ciancaglini, M. (1983) A Filter Lambda Model and the Completeness of Type Assignment. Journal of Symbolic Logic 48.
7. Boudol, G. (1990) A Lambda-Calculus for Parallel Functions. Rapport de Recherche 1231, INRIA Sophia-Antipolis.
8. Boudol, G. (1991) Lambda-Calculi for (Strict) Parallel Functions. Information and Computation 108 (1).
9. Boudol, G. (1993) The Lambda Calculus with Multiplicities. Rapport de Recherche 2025, INRIA Sophia-Antipolis.
10. Boudol, G. and Laneve, C. (1994) The Discriminating Power of Multiplicities in the 2-Calculus. Information and Computation 126 (1).
11. Boudol, G. and Laneve, C. (1995a) Termination, Deadlock and Divergence in the 2-Calculus with Multiplicities. Proc. 11th Mathematical Foundations of Programming Semantics Conference. Electronic Notes in Computer Science.
12. Boudol, G. and Laneve, C. (1995b) 2-Calculus, Multiplicities and the π-Calculus. Rapport de Recherche 2581, INRIA Sophia-Antipolis.
13. Boudol, G. and Lavatelli, C. (1996) Full Abstraction for Lambda-Calculus with Resources and Convergence Testing. CAAP’96. Springer-Verlag Lecture Notes in Computer Science 1059.
14. Coppo, M. and Dezani-Ciancaglini, M. (1980) An Extension of the Basic Functionality Theory for the 2-Calculus. Notre Dame Journal of Formal Logic 21.
15. Coppo, M., Dezani-Ciancaglini, M., Honsell, F. and Longo, G. (1984) Extended Type Structures and Filter Lambda Models. In: Lolli, G., Longo, G. and Marcja, A. (eds.) Logic Colloquium 82, Elsevier Science Publishers B.V. (North-Holland).
16. Coppo, M., Dezani-Ciancaglini, M. and Venneri B. (1980) Principal Type Schemes and 2-Calculus Semantics. In: Hindley, J.R. and Seldin, J.P. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press.
17. Coppo, M., Dezani-Ciancaglini, M. and Yenneri, B. (1981) Functional Characters of Solvable Terms. Zeit. Math. Logik Grund 27.
18. Curien, P.-L. (1998) Abstract Bohm trees. Mathematical Structures in Computer Science 9.
19. Curien, P.-L. and Herbelin, H. (1998) Computing with abstract Bohm trees. Proceedings of the Third Fuji International Symposium on Functional and Logic Programmming, Kyoto.
20. Dezani-Ciancaglini, M., Intriglia, B. and VenturniZilli, M. (1998) Bohm’s theorem for Bohm trees. Proceedings of the Sixth Italian Conference on Theoretical Computer Science, World Scientific.
21. Dezani-Ciancaglini, M., de Liguoro, U. and Piperno, A. (1994) Fully Abstract Semantics for Concurrent 2-Calculus. TACS’94. Springer-Verlag Lecture Notes in Computer Science 789.
22. Dezani-Ciancaglini, M., de Liguoro, U. and Piperno, A. (1999a) A Filter Model for Concurrent 2-Calculus. Siam Journal on Computing 27 (5) 1376–1419.
23. Dezani-Ciancaglini, M., de Liguoro, U. and Piperno, A. (1999b) Filter Models for Conjunctive-Disjunctive 2-Calculi. Theoretical Computer Science 170 (1–2) 83–128.
24. Dezani-Ciancaglini, M. and Margaria, I. (1986) A Characterization of F-complete Type Assignments. Theoretical Computer Science 45.
25. Hindley, J. R. (1982) The Simple Semantics for Coppo-Dezani-Salle Types. International Symposium on Programming. Springer-Verlag Lecture Notes in Computer Science 137.
26. Hindley, J. R. (1983) The Completeness Theorem for Typing 2-Terms. Theoretical Computer Science 22.
27. Krivine, J.-L. (1991) Lambda-calcul, Types et Modeles, Masson.
28. Lavatelli, C. (1996) Semantique du Lambda Calcul avec Ressources, These de Doctorat. Universite Paris 7. France.
29. Levy, J.-J. (1976) An Algebraic Interpretation of the λβk-Calculus; and an Application of a Labelled 2-Calculus. Theoretical Computer Science 2 (1).
30. Milner, R., Parrow, J. and Walker, D. (1989) A Calculus of Mobile Processes, Parts I and II. Information and Computation 100 (1).
31. Milner, R. (1990) Functions as Processes. Mathematical Structures in Computer Science 2.
32. Morris, J. H. (1968) Lambda Calculus Models of Programming Languages, Ph. D. Thesis M.I.T.
33. Nielsen, M., Plotkin, G. and Winskel, G. (1981) Petri Nets, Event Structures and Domains. Theo-retical Computer Science 13.
34. Ong, C.-H.L. (1988) The Lazy Lambda Calculus/ An Investigation into the Foundations of Functional Programming, Ph. D. Thesis, Imperial College.
35. Piperno, A. (1995) Normalization and extensionality. Proceeding of Logic in Computer Science (LICS 95), IEEE Computer Society Press.
36. Pitts, A. (1996) Relational Properties of Domains. Information and Computation 127.
37. Plotkin, G. (1981) Post-Graduate Lecture Notes on Advanced Domain Theory, Department of Computer Science, University of Edinburgh.
38. Ronchi della Rocca, S. (1993) Basic Lambda-calculus, International Summer School in Logic for Computer Science, Universite de Savoie.
39. Salle, P. (1978) Une Extension de la Theorie des Types en 2-Calcul. Springer-Verlag Lecture Notes in Computer Science 62.
40. Sangiorgi, D. (1993) Expressing Mobility in Process Algebras: First Order and Higher Order Paradigms, Ph. D. Thesis, Department of Computer Science, Edinburgh University.
41. Sangiorgi, D. (1994) The Lazy Lambda Calculus in a Concurrency Scenario. Information and Computation 120 (1).
42. Scott, D. (1982) Domains for Denotational Semantics. Springer-Verlag Lecture Notes in Computer Science 140.