Operational properties of lily, a polymorphic linear lambda calculus with recursion

Electronic Notes in Theoretical Computer Science

Volumn 41, Issue 3, 2001, Pages 70-88

  Bierman, G M ^a   Pitts, A M ^b   Russo, C V ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; FUNCTIONS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SEMANTICS;

DOMAIN THEORY; LINEAR LAMBDA CALCULUS; METALANGUAGES; POLYMORPHISM;

LINEAR ALGEBRA;

EID: 18944405475     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80874-0     Document Type: Conference Paper

References (28)

1. Abramsky S. The lazy π-Calculus. Turner D.A. Research Topics in Functional Programming, chapter 4. 1990;65-117 Addison Wesley
2. Abramsky S. Computational interpretations of linear logic. Theoretical computer Science. 111:1993;3-57
3. A. Barber. Linear Type Theories, Semantics and Action Calculi. PhD thesis, Department of Computer Science, University of Edinburgh, 1997.
4. Bierman G.M. Program equivalence in a linear functional language. J. Functional Programming. 10:2000;167-190
5. Crole R.L. How linear is Howe? McCusker G., Edalat A., Jourdan S. Advances in Theory and Formal Methods. 1996;60-72 Imperial College Press
6. M. Fiore and G. D. Plotkin. An axiomatization of computationally adequate domain theoretic models of FPC. In 9th Annual Symposium on Logic in Computer Science, pages 92-102. IEEE Computer Society Press, Washington, 1994.
7. P. J. Freyd. Remarks on algebraically compact categories. In M. P. Fourman, P. T. Johnstone, and A. M. Pitts, editors, Applications of Categories in Computer Science, Proceedings LMS Symposium, Durham, UK, 1991, volume 177 of LMS Lecture Note Series, pages 95-106. Cambridge University Press, 1992.
8. Gunter C.A., Scott D.S. Semantic domains. van Leeuwen J. Handbook of Theoretical Computer Science. volume B:1990;633-674 North-Holland
9. Howe D.J. Proving congruence of bisimulation in functional programming languages. Information and Computation. 124:(2):1996;103-112
10. Lassen S.B. Relational reasoning about contexts. Gordon A.D., Pitts A.M. Higher Order Operational Techniques in Semantics. 1998;91-135 Publications of the Newton Institute, Cambridge University Press
11. Launchbury J. A natural semantics for lazy evaluation. 20th Symp. on Principles of Programming Languages. 1993;144-154 ACM, Charleston, South Carolina
12. Mason I.A., Talcott C.L. Equivalence in functional languages with effects. Journal of Functional Programming. 1:1991;287-327
13. Moggi E. Notions of computation and monads. Information and Computation. 93:(1):1991;55-92
14. Moggi E. Metalanguages and applications. Pitts A.M., Dybjer P. Semantics and Logics of Computation. Publications of the Newton Institute :1997;185-239 Cambridge University Press
15. A. K. Moran and D. Sands. Improvement in a lazy context: An operational theory for call-by-need. In Proc. 26th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 43-56. ACM Press, 1999.
16. Mosses P.D. Denotational semantics. van Leeuwen J. Handbook of Theoretical Computer Science. volume B:1990;577-632 North-Holland
17. O'Hearn P.W., Reynolds J.C. From Algol to polymorphic linear lambdacalculus. Journal of the ACM. 47:(1):2000;167-223
18. Jones S.L.Peyton, Launchbury J. State in Haskell. Lisp and Symbolic Computation. 8:1995;293-341
19. A. M. Pitts. Some notes on inductive and co-inductive techniques in the semantics of functional programs. Notes Series BRICS-NS-94-5, BRICS, Department of Computer Science, University of Aarhus, 1994.
20. A. M. Pitts. Existential types: Logical relations and operational equivalence. In K. G. Larsen, S. Skyum, and G. Winskel, editors, Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 1998, Proceedings, volume 1443 of Lecture Notes in Computer Science, pages 309-326. Springer-Verlag, Berlin, 1998.
21. Pitts A.M. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science. 10:2000;321-359
22. Plotkin G.D. LCF considered as a programming language. Theoretical Computer Science. 5:1977;223-255
23. G. D. Plotkin. Second order type theory and recursion. Notes for a talk at the Scott Fest, February 1993.
24. Reynolds J.C. Types, abstraction and parametric polymorphism. Mason R.E.A. Information Processing 83. 1983;513-523 North-Holland, Amsterdam
25. Seaman J., Purushothaman Iyer S. An operational semantics of sharing in lazy evaluation. Science of Computer Programming. 27:(3):1996;289-322
26. Sestoft P. Deriving a lazy abstract machine. Journal of Functional Programming. 7:1997;231-264
27. Turner D.N., Wadler P. Operational interpretations of linear logic. Theoretical Computer Science. 227:1999;231-248
28. P. Wadler. Theorems for free! In Fourth International Conference on Functional Programming Languages and Computer Architecture, London, UK, 1989.