Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Theoretical Aspects of Computer Software

TACS 1997: Theoretical Aspects of Computer Software pp 583–603Cite as

Types and models for higher-order action calculi

  • Session 8
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1281))

Abstract

Milner introduced action calculi as a framework for representing models of interactive behaviour. He also introduced the higher-order action calculi, which add higher-order features to the basic setting. We present type theories for action calculi and higher-order action calculi, and give the categorical models of the higher-order calculi. As applications, we give a semantic proof of the conservativity of higher-order action calculi over action calculi, and a precise connection with Moggi's computational lambda calculus and notions of computation.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Aczel, Frege structures and the notions of proposition, truth and set. In The Kleene Symposium, North-Holland, 1980.

    Google Scholar 

  2. Z. M. Ariola and Arvind, Properties of a first-order functional language with sharing. Theoretical Computer Science 146, pages 69–108, 1995.

    Google Scholar 

  3. A. Barber, P. Gardner, M. Hasegawa and G. Plotkin, Action calculi, the computational λ-calculus and linear logic. Draft, 1996.

    Google Scholar 

  4. A. Barber, P. Gardner, M. Hasegawa and G. Plotkin, From action calculi to linear logic. Submitted, 1997.

    Google Scholar 

  5. A. Barber, Dual intuitionistic linear logic. Technical report ECS-LFCS-96-347, LFCS, University of Edinburgh, 1996.

    Google Scholar 

  6. N. Benton and P. Wadler, Linear logic, monads, and the lambda calculus. In Proc. 11th Symposium on Logic in Computer Science (LICS'96), 1996.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. A. Compagnoni, O. Jensen, J. Leifer and P. Sewell, Action calculus semantics for a functional programming language with mutable store. Draft, 1997.

    Google Scholar 

  9. B. J. Day, On closed categories of functors. Midwest Category Seminar Reports IV, Springer LNM 137, pages 1–38, 1970.

    Google Scholar 

  10. M. P. Fiore, E. Moggi and D. Sangiorgi, A fully-abstract model for the π-calculus. In Proc. 11th Symposium on Logic in Computer Science (LICS'96), 1996.

    Google Scholar 

  11. 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.

    Google Scholar 

  12. P. Gardner, Closed action calculi. 1996. To appear in Theoretical Computer Science.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. M. Hasegawa, Models of Sharing Graphs (A Categorical Semantics of Let and Letrec). PhD thesis, LFCS, University of Edinburgh, 1997.

    Google Scholar 

  15. S. Hayashi, Adjunction of semi-functors: categorical structures in non-extensional lambda-calculus. Theoretical Computer Science 41, pages 95–104, 1985.

    Google Scholar 

  16. 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.

    Google Scholar 

  17. O. Jensen, Talk at a Newton Institute Workshop on Games, Processes and Logic. Cambridge, November 1995.

    Google Scholar 

  18. A. Joyal, R. Street and D. Verity, Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society 119(3), pages 447–468, 1996.

    Google Scholar 

  19. A. Kock, Strong functors and monoidal monads. Various Publications Series 11, Aarhus Universitet, 1970.

    Google Scholar 

  20. S. Mac Lane, Categories for the Working Mathematician. Graduate Texts in Mathematics 5, Springer-Verlag, 1971.

    Google Scholar 

  21. 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.

    Google Scholar 

  22. A. Mifsud, R. Milner and A. J. Power, Control structures. In Proc. 10th Symposium on Logic in Computer Science (LICS'95), 1995.

    Google Scholar 

  23. A. Mifsud, Control Structures. PhD thesis, LFCS, University of Edinburgh, 1996.

    Google Scholar 

  24. R. Milner, Higher-order action calculi. In Proc. Computer Science Logic 1992 (CSL'92), Springer LNCS 832, pages 238–260, 1994.

    Google Scholar 

  25. R. Milner, Action calculi V: reflexive molecular forms (with Appendix by O. Jensen). Third draft, July 1994.

    Google Scholar 

  26. R. Milner, Calculi for interaction. Acta Informatica 33(8), pages 707–737, 1996.

    Google Scholar 

  27. E. Moggi, Computational lambda-calculus and monads. Technical report ECS-LFCS-88-66, LFCS, University of Edinburgh, 1988.

    Google Scholar 

  28. E. Moggi, Notions of computation and monads. Information and Computation 93, pages 55–92, 1991.

    Google Scholar 

  29. D. Pavlovic, Categorical logic of names and abstraction in action calculi. 1996. To appear in Mathematical Structures in Computer Science.

    Google Scholar 

  30. A. J. Power and E. P. Robinson, Premonoidal categories and notions of computation. 1996. To appear in Mathematical Structures in Computer Science.

    Google Scholar 

  31. A. J. Power, Elementary control structures. In Proc. 6th Int. Conf. Concurrency Theory (CONCUR'96), Springer LNCS 1119, pages 115–130, 1996.

    Google Scholar 

  32. I. Stark, A fully abstract domain model for the π-calculus. In Proc. 11th Symposium on Logic in Computer Science (LICS'96), pages 36–42, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, University of Cambridge, New Museums Site, CB2 3QG, Cambridge, UK

    Philippa Gardner

  2. Department of Computer Science, University of Edinburgh, The King's Buildings, EH9 3JZ, Edinburgh, Scotland

    Masahito Hasegawa

Authors
  1. Philippa Gardner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masahito Hasegawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Martín Abadi Takayasu Ito

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gardner, P., Hasegawa, M. (1997). Types and models for higher-order action calculi. In: Abadi, M., Ito, T. (eds) Theoretical Aspects of Computer Software. TACS 1997. Lecture Notes in Computer Science, vol 1281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014569

Download citation

  • DOI: https://doi.org/10.1007/BFb0014569

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63388-4

  • Online ISBN: 978-3-540-69530-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation