Categorical models for local names

Higher-Order and Symbolic Computation

Volumn 9, Issue 1, 1996, Pages 77-107

  Stark, Ian ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Category theory; Dynamic allocation; Functional programming; Lambda calculus; Monads

Indexed keywords

EID: 0003072080     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01806033     Document Type: Article

References (34)

1. Abramsky, S. The lazy lambda calculus. In Turner, D., editor, Research Topics in Functional Programming, Addison Wesley (1990) 65-117.
2. Boehm, H.-J. A Logic for the Russell Programming Language. PhD thesis, Cornell University, Ithaca, New York (February 1984). Also published as Technical Report 84-593.
3. Felleisen, M., and Friedman, D. P. A syntactic theory of sequential state. Theoretical Computer Science, 69 (1989) 243-287.
4. Felleisen, M., and Hieb, R. The revised report on the syntactic theories of seqential control and state. Theoretical Computer Science, 103 (1992) 235-271.
5. Gordon, A. D. Functional Programming and Input/Output. PhD thesis, University of Cambridge (August 1992). Also published as Technical Report 285, University of Cambridge Computer Laboratory.
6. Honsell, F., Mason, I. A., Smith, S., and Talcott, C. A variable typed logic of effects. Submitted to Information and Computation (1993).
7. Kock, A. Monads on symmetric monoidal closed categories. Archiv der Mathematik, XXI (1970) 1-10.
8. Kock, A. BilineariIy and cartesian closed monads. Mathematica Scandinavica, 29 (1971) 161-174.
9. Lambek, J., and Scott, P. J. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics 7, Cambridge University Press (1986).
10. Lent, A. F. The category of functors from state shapes to bottomless CPOs is adequate for block structure. In SIPL '93 [34], 101-119.
11. Mason, I. A. The Semantics of Destructive Lisp. PhD thesis, Stanford University (1986). Also published as CSLI Lecture Notes Number 5, Center for the Study of Language and Information, Stanford University.
12. Mason, I. A., and Talcott, C. Equivalence in functional languages with effects. Journal of Functional Programming, 1, 3 (July 1991) 297-327.
13. Mason, I. A., and Talcott, C. Inferring the equivalence of functional programs that mutate data. Theoretical Computer Science, 105 (1992) 167-215.
14. Meyer, A. R., and Sieber, K. Towards fully abstract semantics for local variables: preliminary report. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, ACM Press (1988) 191-203.
15. Milner, R. Fully abstract models of typed λ-calculi. Theoretical Computer Science, 4 (1977) 1-22.
16. Milner, R., Tofte, M., and Harper, R. The Definition of Standard ML. MIT press (1990).
17. Moggi, E. Computational lambda-calculus and monads. In Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (1989) 14-23.
18. Moggi, E. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Laboratory for Foundations of Computer Science, University of Edinburgh (April 1990).
19. Moggi, E. Notions of computation and monads. Information and Computation, 93, 1 (July 1991) 55-92.
20. Odersky, M. A syntactic theory of local names. Research Report YALEU/DCS/RR-965, Yale University (May 1993).
21. O'Hearn, P. W., and Riecke, J. G. Fully abstract translations and parametric polymorphism. In Programming Languages and Systems - ESOP '94, Lecture Notes in Computer Science 788, Springer-Verlag (1994) 454-468.
22. O'Hearn, P. W., and Riecke, J. G. Kripke logical relations and PCF. Submitted to Information and Computation (June 1994).
23. O'Hearn, P. W., and Tennent, R. D. Semantics of local variables. In Applications of Categories in Computer Science, London Mathematical Society Lecture Note Series 177, Cambridge University Press (1992) 217-238.
24. O'Hearn, P. W., and Tennent, R. D. Relational parametricity and local variables (preliminary report). In Conjerence Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, ACM Press (1993) 171-184.
25. Oles, F. J. Type algebras, functor categories and block structure. In Nivat, M., and Reynolds, J., editors, Algebraic Methods in Semantics, Cambridge University Press (1985) 543-573.
26. Pitts, A. M. Evaluation logic. In IVth Higher Order Workshop, Banff 1990, Workshops in Computing, Springer-Verlag (1991) 162-189. Also published as Technical Report 198, University of Cambridge Computer Laboratory.
27. Pitts, A. M., and Stark, I. Observable properties of higher order functions that dynamically create local names, or: What's new? In Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 711, Springer-Verlag (1993) 122-141.
28. Pitts, A. M., and Stark, I. On the observable properties of higher order functions that dynamically create local names (preliminary report). In SIPL '93 [34], 31-45.
29. Plotkin, G. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1 (1975) 125-159.
30. Plotkin, G., and Abadi, M. A logic for parametric polymorphism. In Typed Lambda Calculi and Applications, Lecture Notes in Computer Science 664, Springer-Verlag (1993) 361-375.
31. Reynolds, J. C. The essence of Algol. In Algorithmic Languages, Nol~h Holland, Amsterdam (1981) 345-372.
32. Sieber, K. New steps towards full abstraction for local variables. In SIPL '93 [34], 88-100.
33. Sieber, K. Full abstraction for the second order subset of an Algol-like language (preliminary report). Technical Report A 01/94, Universität des Saarlandes, Saarbrücken (January 1994).
34. Proceedings of the ACM SIGPLAN Workshop on State in Programming Languages, Copenhagen, Denmark, June 12, 1993. Research Report YALEU/DCS/RR-968, Yale University Department of Computer Science (1993).