Notions of computation and monads
Information and Computation
A calculus of mobile processes, II
Information and Computation
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Syntactic control of interference revisited
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A fully abstract model for the π-calculus
Information and Computation
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Journal of Functional Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Free-algebra models for the π -calculus
Theoretical Computer Science
General Structural Operational Semantics through Categorical Logic
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Term Equational Systems and Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects and Operations: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantics for Local Computational Effects
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
A formal calculus for informal equality with binding
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
A unifying model of variables and names
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Equational systems and free constructions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Algebraic foundations for effect-dependent optimisations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Completeness for algebraic theories of local state
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
Various situations in computer science call for categories that support both cartesian closed and monoidal closed structure. Such situations include (i) models of local state, where the monoidal product describes disjointness of memory, and (ii) treatment of fresh names, as required in models of the @p-calculus. I propose a technique to embed the two closed structures into one single structure. To demonstrate the technique, I show how previously studied theories of local state and fresh names can be understood formally as presentations of (enriched) algebraic theories.