Types and models for higher-order action calculi

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

Volumn 1281, Issue , 1997, Pages 583-603

  Gardner, Philippa ^a   Hasegawa, Masahito ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; COMPUTATION THEORY; COMPUTER SOFTWARE; DIFFERENTIATION (CALCULUS); SEMANTICS;

ACTION CALCULUS; CATEGORICAL MODEL; COMPUTATIONAL LAMBDA CALCULUS; CONSERVATIVITY; HIGHER-ORDER; TYPE THEORY;

PATHOLOGY;

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

References (32)

1. [Acz80] P. Aczel, Frege structures and the notions of proposition, truth and set. In The Kleene Symposium, North-Holland, 1980.
2. [AA95] Z. M. Ariola and Arvind, Properties of a first-order functional language with sharing. Theoretical Computer Science 146, pages 69-108, 1995.
3. [BGHP96] A. Barber, P. Gardner, M. Hasegawa and G. Plotkin, Action calculi, the computational λ-calculus and linear logic. Draft, 1996.
4. [BGHP97] A. Barber, P. Gardner, M. Hasegawa and G. Plotkin, From action calculi to linear logic. Submitted, 1997.
5. [Bar96] A. Baxber, Dual intuitionistic linear logic. Technical report ECS-LFCS-96-347, LFGS, University of Edinburgh, 1996.
6. (BW96) N. Benton and P. Wadler, Linear logic, monads, and the lambda calculus. In Proc. 11th Symposium on Logic in Computer Science (LIGS'96), 1996.
7. [Ben95] N. Benton, A mixed linear non-linear logic: proofs, terms and models. In Proc. Computer Science Logic 1994 (CSL'94), Springer LNCS 933, pages 121-135, 1995.
8. [CJLS97] A. Compagnoni, O. Jensen, J. Leifer and P. Sewell, Action calculus semantics for a functional programming language with mutable store. Draft, 1997.
9. [Day70] B. J. Day, On closed categories of functors. Midwest Category Seminar Reports IV, Springer LNM 137, pages 1-38, 1970.
10. [FMS96] M. P. Fiore, E. Moggi and D. Sangiorgi, A fully-abstract model for the TT-calculus. In Proc. 11th Symposium on Logic in Computer Science (LICS'96), 1996.
11. [Gar95] P. Gardner, A name-free account of action calculi. In Proc. 11th Int. Conf. Mathematical Foundations of Programming Semantics (MFPS'95), Electronic Notes in Computer Science 1, Elsevier, 1995.
12. [Gar96] P. Gardner, Closed action calculi. 1996. To appear in Theoretical Computer Science.
13. [Has97a] M. Hasegawa, Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In Proc. Third Int. Conf. Typed Lambda Calculi and Applications (TLCA'97), Springer LNCS 1210, pages 196-213, 1997.
14. [Has97b] M. Hasegawa, Models of Sharing Graphs (A Categorical Semantics of Let and Letrec). PhD thesis, LFCS, University of Edinburgh, 1997.
15. [Hay85] S. Hayashi, Adjunction of semi-functors: categorical structures in non-extensional lambda-calculus. Theoretical Computer Science 41, pages 95-104, 1985.
16. [IK86] G. B. Im and G. M. Kelly, A universal property of the convolution monoidal structure. Journal of Pure and Applied Algebra 43, pages 75-88, 1986.
17. [Jen95] O. Jensen, Talk at a Newton Institute Workshop on Games, Processes and Logic. Cambridge, November 1995.
18. [JSV96] A. Joyal, R. Street and D. Verity, Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society 119(3), pages 447-468, 1996.
19. [Koc70] A. Kock, Strong functors and monoidal monads. Various Publications Series 11, Aarhus Universitet, 1970.
20. [ML71] S. Mac Lane, Categories for the Working Mathematician. Graduate Texts in Mathematics 5, Springer-Verlag, 1971.
21. [MOTW95] J. Maraist, M. Odersky, D, Turner and P. Wadler, Call-by-name, call-by-value, call-by-need, and the linear lambda calculus. In Proc. 11th Int. Conf. Mathematical Foundations of Programming Semantics (MFPS'95), Electronic Notes in Computer Science 1, Elsevier, 1995.
22. [MMP95] A. Mifsud, R. Milner and A. J. Power, Control structures. In Proc. 10th Symposium on Logic in Computer Science (LICS'95), 1995.
23. [Mif96] A. Mifsud, Control Structures. PhD thesis, LFCS, University of Edinburgh, 1996.
24. [Mil94a] R. Milner, Higher-order action calculi. In Proc. Computer Science Logic 1992 (CSL '92), Springer LNCS 832, pages 238-260, 1994.
25. [Mil94b] R. Milner, Action calculi V: reflexive molecular forms (with Appendix by [Mil94b] 0 Jensen). Third draft, July 1994.
26. [Mil96] R. Milner, Calculi for interaction. Acta Informatica 33(8), pages 707-737, 1996.
27. [Mog88] E. Moggi, Computational lambda-calculus and monads. Technical report ECS-LFCS-88-66, LFCS, University of Edinburgh, 1988.
28. [Mog91] E. Moggi, Notions of computation and monads. Information and Computation 93, pages 55-92, 1991.
29. [Pav96] D. Pavlovic, Categorical logic of names and abstraction in action calculi. 1996. To appear in Mathematical Structures in Computer Science.
30. [PR96] A. J. Power and E. P. Robinson, Premonoidal categories and notions of computation. 1996. To appear in Mathematical Structures in Computer Science.
31. [Pow96] A. J. Power, Elementary control structures. In Proc. 6th Int. Conf. Concurrency Theory (CONCUR'96), Springer LNCS 1119, pages 115-130, 1996.
32. [Sta96] I. Stark, A fully abstract domain model for the îr-calculus. In Proc. 11th Symposium on Logic in Computer Science (LICS'96), pages 36-42, 1996.