Relational interpretations of recursive types in an operational setting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1281, Issue , 1997, Pages 458-490

  Birkedal, Lars ^a   Harper, Robert ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE;

CONTINUATION PASSING; DOMAIN THEORETIC MODELS; FUNCTIONAL LANGUAGES; ML-LIKE LANGUAGES; PROOF OF CORRECTNESS; RECURSIVE TYPES; RELATIONAL PROPERTIES; TYPE SYSTEMS;

RECURSIVE FUNCTIONS;

EID: 84957702908     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0014563     Document Type: Conference Paper

References (25)

1. Martín Abadi, Luca Cardelli, Benjamin Pierce, and Gordon Plotkin. Dynamic typing in a statically typed language. ACM Transactions on Programming Languages and Systems, 13(2):237-268, April 1991.
2. Lars Birkedal and Robert Harper. Relational interpretations of recursive types in an operational setting. Unpublished manuscript.
3. 4 report on the algorithmic language Scheme. LISP Pointers, IV(3):l-55, July-Sep. 1991.
4. Bruce Duba, Robert Harper, and David MacQueen. Typing first-class continuations in ML. In Eighteenth ACM Symposium on Principles of Programming Languages, January 1991.
5. Andrzej Pilinski. Controlling Effects. CMU-CS--96-119, School of Computer Science, Carnegie Mellon University, May 1996.
6. Michael J. Fischer. Lambda-calculus schemata. LISP and Symbolic Computation, 6(3/4):259-288, November 1993.
7. Peter Freyd. Algebraically complete categories. In A. Carboni, M. C. Pedicchio, and G. Rosolini, editors, Category Theory. Proceedings, Como 1990, volume 1488 of Lecture Notes in Mathematics, pages 95-104. Springer-Verlag, 1990.
8. Peter Freyd. Recursive types reduced to inductive types. In Proceedings of the fifth IEEE Conference on Logic in Computer Science., pages 498-507, 1990.
9. Peter 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 of the LMS Symposium, Durham 1991, volume 177 of London Mathematical Society Lecture Note Series, pages 95-106. Cambridge University Press, 1991.
10. Jean-Yves Girard. Interpretation Fonctionnelle et Elimination des Coupures dans I'Arithmétique d'Ordre Supérieure. PhD thesis, Université Paris VII, 1972.
11. Carl A. Gunter. Semantics of Programming Languages. Structures and Techniques. MIT Press, 1992.
12. Robert Harper, Bruce Duba, and David MacQueen. Typing first-class continuations in ML. Journal of Functional Programming, 3(4):465-484, October 1993.
13. D. J. Howe. Equality in lazy computation systems. In 4th Annual Symposium on Logic in Computer Science, pages 198-203. IEEE Computer Society Press, Washington, 1989.
14. Søren Lassen. Relational reasoning about contexts. Unpublished manuscript.
15. Ian A. Mason, Scott F. Smith, and Carolyn L. Talcott. From operational semantics to domain theory. Information and Computation, 1995. To Appear.
16. Albert R. Meyer and Mitchell Wand. Continuation semantics in typed lambda calculi (summary). In Rohit Parikh, editor, Logics of Programs, volume 193 of Lecture Notes in Computer Science, pages 219-224. Springer-Verlag, 1985.
17. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.
18. John C. Mitchell. Type systems for programming languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics, chapter 8, pages 366-458. Elsevier Science Publishers B.V., 1990.
19. John C. Mitchell. Foundations for Programming Languages. Foundations of Computing. MIT Press, 1996.
20. James H. Morris. Lambda Calculus Models of Programming Languages. PhD thesis, MIT, 1968.
21. Andrew M. Pitts. Operationally-based theories of program equivalence. In In Proc. of Summer School on Semantics and Logics of Computation. ESPRIT CLiCS- II. University of Cambridge. Isaac Newton Institute for Mathematical Sciences., September 1995.
22. Andrew M. Pitts. Relational properties of domains. Information and Computation, 127(2):66-90, June 1996.
23. Gordon Plotkin. Call-by-name, call-by-value, and the lambda calculus. Theoretical Computer Science, 1:125-159, 1975.
24. Gordon Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-257, 1977.
25. John C. Reynolds. On the relation between direct and continuation semantics. In J. Loeckx, editor, Proceedings of the Second Colloquium on Automata, Languages and Programming, Saarbrücken, volume 174 of Lecture Notes in Computer Science, pages 141-156. Springer-Verlag, 1974.