Closed action calculi

Theoretical Computer Science

Volumn 228, Issue 1-2, 1999, Pages 77-103

  Gardner, Philippa ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Action calculi; Combinatoric account; Names

Indexed keywords

EID: 0002952465     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00355-7     Document Type: Article

References (25)

1. M. Abadi, L. Cardelli, A theory of objects, Springer, Berlin, 1996.
2. M. Abadi, A. Gordon, A calculus for cryptgraphic protocols, Proc. 4th ACM Conf. of Computer and Communications Security, 1997.
3. A. Barber, P. Gardner, M. Hasegawa, G. Plotkin, From action calculi to linear logic, Selected papers from the annual conference of the European Association for Computer Science Logic (CSL'97), Lecture Notes in Computer Science, vol. 1414, Springer, Berlin, 1998, pp. 78-97.
4. N. Benton, A mixed linear and non-linear logic; proofs, terms and models, Proc. Computer Science Logic, Lecture Notes in Computer Science, vol. 933, Springer, Berlin, 1995.
5. G. Boudol, Asynchrony and the π-calculus (note), Rapport de Recherche 1702, INRIA Sofia-Antipolis, 1992.
6. L. Cardelli, A. Gordon, Mobile ambients, Foundations of Software Science and Computational Structures, M. Nivat (Ed.), Lecture Notes in Computer Science, vol. 1378, Springer, Berlin, 1998, pp. 140-155.
7. A. Corradini, F. Gadducci, An algebraic presentation of term graphs via ps-monoidal categories, Applied Categorical Structures, to appear, 1999.
8. P.A. Gardner, A name-free account of action calculi, Full manuscript, 1994.
9. P.A. Gardner, A name-free account of action calculi, in: S. Brookes, M. Main, A. Melton, M. Mislove (Eds.), Mathematical foundations of Programming Semantics, ENTCS 1. Elsevier, Amsterdam, 1995.
10. P.A. Gardner, M. Hasegawa, Types and models for higher-order action calculi, Theoretical Aspects of Computer Software, Sendai, 1997.
11. P.A. Gardner, R. Milner, Action calculi VIII: Contextual Action Calculi, Manuscript, 1994.
12. M. Hasegawa, Models of sharing graphs (A categorial semantics of let and lectrec), Ph.D. Thesis, LFCS, University of Edinburgh, 1997.
13. J.R. Hindley, J. Seldin, Introduction to Combinators and Lambda-Calculus, Cambridge University Press, Cambridge, 1986.
14. K. Honda, M. Tokoro, On asynchronous communication semantics, Object-based Concurrent Computing, Lecture Notes in Computer Science, vol. 612, Springer, Berlin, 1992, 21-51.
15. A. Joyal, R. Street, D. Verity, Traced monoidal categories, Math. Proc. Cambridge Philos. Soc. 119(3) (1996) 447-468.
16. A. Mifsud, Control structures, Ph.D. Thesis, LFCS, University of Edinburgh, 1996.
17. R. Milner, Action calculi, or syntactic action structures, in: A.M. Borzyszkowski, S. Sokolowski (Eds.), Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 711, Springer, Berlin, 1993, 105-121.
18. R. Milner, Action calculi V: Reflexive Action Calculi, Manuscript, 1994.
19. R. Milner, Higher-order calculi, Proc. Computer Science Logic, Lecture Notes in Computer Science, vol. 832, Springer, Berlin, 1994.
20. R. Milner, Calculi for interaction, Acta Inform. 33(8) (1996) 707-737.
21. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, Inform, and Control 100 (1992) 1-77.
22. E. Moggi, Notions of computation and monads, Inform. and Comput. 93(1) (1991) 55-92.
23. D. Pavlovic, Categorical logic of names and abstraction in action calculi, Math. Struct. Comput. Sci. 7(6) (1997) 619-637.
24. A.J. Power, Elementary control structures, Proc. CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996.
25. P. Sewell, Global/local subtyping and capability inference for a distributed π-calculus, Proc. International Colloquium an Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 1443, Springer, Berlin, 1998, pp. 695-706.