Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names

Electronic Notes in Theoretical Computer Science

Volumn 249, Issue , 2009, Pages 471-490

  Staton, Sam ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

cartesian closed category; enriched algebraic theories; monoidal closed category

Indexed keywords

ALGEBRAIC THEORIES; CARTESIAN CLOSED CATEGORY; CARTESIANS; CLOSED STRUCTURES; DISJOINTNESS; ENRICHED ALGEBRAIC THEORIES; FRESH NAMES; LOCAL STATE; MONOIDAL CLOSED CATEGORY; MONOIDAL CLOSED STRUCTURES; SINGLE STRUCTURE;

ALGEBRA;

EID: 68549097936     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.07.103     Document Type: Article

References (32)

1. R.A. Clouston. Nominal Lawvere theories. Unpublished manuscript, 2009
2. Clouston R.A., and Pitts A.M. Nominal equational logic. Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin. Electron. Notes Theor. Comput. Sci. 172 (2007) 223-257
3. B. Day. Construction of Biclosed Categories. PhD thesis, University of New South Wales, 1970
4. Day B. On closed categories of functors. Reports of the Midwest Category Seminar, IV. Lecture Notes in Math. volume 137 (1970) 1-38
5. Fiore M.P., and Hur C.-K. Equational systems and free constructions. Proc. of ICALP'07. Lecture Notes in Comput. Sci. volume 4596 (2007) 607-618
6. Fiore M.P., and Hur C.-K. Term equational systems and logics. Proc. of MFPS XXIV. Electron. Notes Theor. Comput. Sci. 218 (2008) 171-192
7. Fiore M.P., Moggi E., and Sangiorgi D. A fully abstract model for the π-calculus. Inform. and Comput. 179 1 (2002) 76-117
8. Gabbay M.J., and Mathijssen A. A formal calculus for informal equality with binding. Proc. of WoLLIC'07. Lecture Notes in Comput. Sci. volume 4576 (2007) 162-176
9. Gabbay M.J., and Pitts A.M. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 (2001) 341-363
10. Ghani N., Yemane K., and Victor B. Relationally staged computations in calculi of mobile processes. Proc. of CMCS'04. Electron. Notes Theor. Comput. Sci. 106 (2004) 105-120
11. C. Hermida and R.D. Tennent. Monoidal indeterminates and categories of possible worlds. In Proc. of MFPS XXV, 2009
12. Kelly G.M. Basic concepts of enriched category theory. Lecture Notes in Math. volume 64 (1982), Cambridge University Press
13. Kelly G.M. Structures defined by finite limits in the enriched context, I. Cah. Topol. Géom. Différ. Catég. 23 1 (1982) 3-42
14. Kelly G.M., and Power A.J. Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. J. Pure Appl. Algebra 89 1-2 (1993) 163-179
15. M. Miculan and K. Yemane. A unifying model of variables and names. In Proc. of FoSSaCS'05, pages 170-186, 2005
16. Milner R., Parrow J., and Walker D. A calculus of mobile processes, II. Inform. and Comput. 100 1 (1992) 41-77
17. Moggi E. Notions of computation and monads. Inform. and Comput. 93 1 (1991) 55-92
18. O'Hearn P.W. On bunched typing. J. Funct. Programming 13 4 (2003) 747-796
19. O'Hearn P.W., Power J., Takeyama M., and Tennent R.D. Syntactic control of interference revisited. Theoret. Comput. Sci. 228 1-2 (1999) 211-252
20. Plotkin G., and Power J. Computational effects and operations: An overview. Proc. of Domains VI. Electron. Notes Theor. Comput. Sci. 73 (2004) 149-163
21. Plotkin G.D., and Power J. Notions of computation determine monads. Proc. of FoSSaCS'02. Lecture Notes in Comput. Sci. volume 2303 (2002) 342-356. http://homepages.inf.ed.ac.uk/gdp/publications/ Erratum at
22. Power A.J. Enriched Lawvere theories. Theory Appl. of Categ. 6 7 (1999) 83-93
23. J. Power. Semantics for computational effects: from global to local. Draft, 2006
24. Power J. Semantics for local computational effects. Proc. of MFPS XXII. Electron. Notes Theor. Comput. Sci. 158 (2006) 355-371
25. Pym D.J. The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series volume 26 (2002), Kluwer
26. Robinson E. Variations on algebra: Monadicity and generalisations of equational theories. Formal Aspects of Computing 13 3-5 (2002) 308-326
27. Sangiorgi D. A theory of bisimulation for the pi-calculus. Acta Inform. 33 1 (1996) 69-97
28. I. Stark. A fully abstract domain model for the π-calculus. In Proc. of LICS'96, pages 36-42, 1996
29. Stark I. Free-algebra models for the π-calculus. Theoret. Comput. Sci. 390 2-3 (2008) 248-270
30. S. Staton. Name-Passing Process Calculi: Operational Models and Structural Operational Semantics. PhD thesis, Cambridge, 2007. Technical Report UCAM-CL-TR-688
31. S. Staton. General structural operational semantics through categorical logic. In Proc. of LICS'08, pages 166-177, 2008
32. Ziegler A., Miller D., and Palamidessi C. A congruence format for name-passing calculi. Proc. of SOS'05. Electron. Notes Theor. Comput. Sci. 156 (2006) 169-189