Free-algebra models for the π -calculus

Theoretical Computer Science

Volumn 390, Issue 2-3, 2008, Pages 248-270

  Stark, Ian ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Computational monads; Concurrency; Denotational semantics; Lawvere theories; Nominal sets

Indexed keywords

CONCURRENCY CONTROL; MATHEMATICAL MODELS; POWER CONTROL; SEMANTICS; THEOREM PROVING;

COMPUTATIONAL MONADS; DENOTATIONAL SEMANTICS; FREE ALGEBRA; LAWVERE THEORIES; NOMINAL SETS;

LINEAR ALGEBRA;

EID: 37749014300     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.09.024     Document Type: Article

References (47)

1. Abadi M., and Fournet C. Mobile values, new names, and secure communication. Conference Record of POPL '01: 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2001), ACM Press 104-115
2. Amadio R.M., Castellani I., and Sangiorgi D. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195 2 (1998)
3. Gérard Boudol, Asynchrony and the π-calculus, Rapport de recherche 1702, INRIA, Sophia Antipolis, 1992
4. Cattani G.L., and Sewell P. Models for name-passing processes: Interleaving and causal. Information and Computation 190 2 (2004) 136-178
5. Cattani G.L., Stark I., and Winskel G. Presheaf models for the π-calculus. Category Theory and Computer Science: Proceedings of the 7th International Conference. CTCS '97. Lecture Notes in Computer Science vol. 1290 (1997), Springer-Verlag 106-126
6. Day B.J. On closed categories of functors. Reports of the Midwest Category Seminar IV. Lecture Notes in Mathematics vol. 137 (1970), Springer-Verlag 1-38
7. Fiore M., Plotkin G., and Turi D. Abstract syntax and variable binding. Proceedings of the Fourteenth Annual IEEE Symposium on Logic in Computer Science (1999), IEEE Computer Society Press 193-202
8. Fiore M., and Staton S. Comparing operational models of name-passing process calculi. CMCS 2004: Proceedings of the 7th International Workshop on Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science vol. 106 (2004), Elsevier 91-104
9. Fiore M., and Turi D. Semantics of name and value passing. Proceedings of the Sixteenth Annual IEEE Symposium on Logic in Computer Science (2001), IEEE Computer Society Press 93-104
10. Fiore M.P., Moggi E., and Sangiorgi D. A fully-abstract model for the π-calculus. Information and Computation 179 1 (2002) 76-117
11. Gabbay M.J., and Pitts A.M. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 3-5 (2001) 341-363
12. Hennessy M. A fully abstract denotational semantics for the π-calculus. Theoretical Computer Science 278 1-2 (2002) 53-89
13. Honda K., and Tokoro M. An object calculus for asynchronous communication. ECOOP '91: Proceedings of the European Conference on Object-Oriented Programming. Lecture Notes in Computer Science vol. 512 (1991), Springer-Verlag 133-147
14. Hyland M., Plotkin G., and Power J. Combining computational effects: Commutativity and sum. Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science. TCS 2002 (2002), Kluwer 474-484
15. Hyland M., Plotkin G., and Power J. Combining effects: Sum and tensor. Theoretical Computer Science 357 1-3 (2006) 70-99 Journal version of [14]
16. Mark P. Jones, Luc Duponcheel, Composing monads, Research Report YALEU/DCS/RR-1004, Yale University Department of Computer Science, 1993
17. Kelly G.M., and John Power A. Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. Journal of Pure and Applied Algebra 89 (1993) 163-179
18. Liang S., Hudak P., and Jones M.P. Monad transformers and modular interpreters. Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1995), ACM Press 333-343
19. Mac Lane S., and Moerdijk I. Sheaves in Geometry and Logic: A First Introduction to Topos Theory (1992), Springer-Verlag
20. Milner R. Communicating and Mobile Systems: The Pi-Calculus (1999), Cambridge University Press
21. Eugenio Moggi, An abstract view of programming languages, Technical Report ECS-LFCS-90-113, Laboratory for Foundations of Computer Science, University of Edinburgh, 1990
22. Moggi E. Notions of computation and monads. Information and Computation 93 1 (1991) 55-92
23. Jeff Newburn, All about monads, v1.1.0. http://www.nomaware.com/monads
24. O'Hearn P.W., and Tennent R.D. Parametricity and local variables. Journal of the ACM 42 3 (1995) 658-709 Reprinted in [25]
25. In: O'Hearn P.W., and Tennent R.D. (Eds). Algol-Like Languages (1996), Birkhauser
26. Frank J. Oles, Functor categories and store shapes. Chapter 11 of [25]
27. Palamidessi C. Comparing the expressive power of the synchronous and the asynchronous π-calculus. Mathematical Structures in Computer Science 13 5 (2003) 685-719
28. Palamidessi C., Saraswat V., Valencia F.D., and Victor B. On the expressiveness of linearity vs persistence in the asynchronous π-calculus. Proceedings of the Twenty-First Annual IEEE Symposium on Logic in Computer Science (2006), IEEE Computer Society Press
29. Parrow J. An introduction to the π-calculus. Handbook of Process Algebra (2001), Elsevier 479-543
30. Pitts A.M. Nominal logic, a first order theory of names and binding. Information and Computation 186 (2003) 165-193 Errata, September 2004
31. Pitts A.M., and Stark I. Observable properties of higher order functions that dynamically create local names, or: What's new?. Mathematical Foundations of Computer Science: Proceedings of the 18th International Symposium. MFCS '93. Lecture Notes in Computer Science vol. 711 (1993), Springer-Verlag 122-141
32. Gordon Plotkin, A. John Power, Computational effects and operations: An overview, Laboratory for Foundations of Computer Science, University of Edinburgh. Edinburgh Research Archive: http://hdl.handle.net/1842/198, 2002
33. Plotkin G., and Power J. Notions of computation determine monads. Foundations of Software Science and Computation Structures: Proceedings of the 5th International Conference, FoSSaCS 2002. Lecture Notes in Computer Science vol. 2303 (2002), Springer-Verlag 342-356 Erratum, August 2002
34. Plotkin G., and Power J. Algebraic operations and generic effects. Applied Categorical Structures 11 1 (2003) 69-94
35. Gordon Plotkin, John Power, Logic for computational effects: Work in progress. Available online at: http://homepages.inf.ed.ac.uk/gdp/publications/, December 2003
36. John Power A. Enriched Lawvere theories. Theory and Applications of Categories 6 7 (1999) 83-93
37. Reynolds J.C. The essence of Algol. Proceedings of the 1981 International Symposium on Algorithmic Languages (1981), North-Holland 345-372 Reprinted in [25]
38. Robinson E. Variations on algebra: Monadicity and generalisations of equational theories. Formal Aspects of Computing 13 3-5 (2002) 308-326
39. Sangiorgi D. π-calculus, internal mobility and agent-passing calculi. Theoretical Computer Science 167 1-2 (1996) 235-274
40. Sangiorgi D., and Walker D. The π-Calculus: A Theory of Mobile Processes (2001), Cambridge University Press
41. Schöpp U., and Stark I. A dependent type theory with names and binding. Computer Science Logic: Proceedings of the 18th International Workshop. CSL 2004. Lecture Notes in Computer Science vol. 3210 (2004), Springer-Verlag 235-249
42. Shinwell M.R., and Pitts A.M. On a monadic semantics for freshness. Theoretical Computer Science 342 1 (2005) 28-55
43. Shinwell M.R., Pitts A.M., and Gabbay M.J. FreshML: Programming with binders made simple. ICFP 2003: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming (2003), ACM Press 263-274 Erratum, May 2004
44. Stark I. Categorical models for local names. LISP and Symbolic Computation 9 1 (1996) 77-107
45. Stark I. A fully abstract domain model for the π-calculus. Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science (1996), IEEE Computer Society Press 36-42
46. Stark I. Free-algebra models for the π-calculus. Foundations of Software Science and Computation Structures: Proceedings of the 8th International Conference, FOSSACS 2005. Lecture Notes in Computer Science vol. 3441 (2006), Springer-Verlag 155-169
47. Wadler P., and King D. Combining monads. Proceedings of the 1992 Glasgow Workshop on Functional Programming (1993), Springer-Verlag 134-143