Introduction to higher order categorical logic
Introduction to higher order categorical logic
Functor—category semantics of programming languages and logics
Proceedings of a tutorial and workshop on Category theory and computer programming
Type algebras, functor categories and block structure
Algebraic methods in semantics
Semantical analysis of specification logic
Information and Computation
Semantics of noninterference: a natural approach
Semantics of noninterference: a natural approach
Semantical analysis of specification logic, 2
Information and Computation
Parametricity and local variables
Journal of the ACM (JACM)
Syntactic control of interference revisited
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Syntactic control of interference
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Craft of Programming
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Full Abstraction for the Second Order Subset of an Algol-Like Language
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
A fully abstract model for the π-calculus
Information and Computation
A category-theoretic approach to the semantics of programming languages
A category-theoretic approach to the semantics of programming languages
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
A fibrational framework for possible-world semantics of Algol-like languages
Theoretical Computer Science
Global State Considered Helpful
Electronic Notes in Theoretical Computer Science (ENTCS)
Mathematical models of computational and combinatorial structures
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
Given any symmetric monoidal category C, a small symmetric monoidal category @S and a strong monoidal functor j:@S-C, it is shown how to construct C[x:j@S], a polynomial such category, the result of freely adjoining to C a system x of monoidal indeterminates for every object j(w) with w@?@S satisfying a naturality constraint with the arrows of @S. As a special case, we show how to construct the free co-affine category (symmetric monoidal category with initial unit) on a given small symmetric monoidal category. It is then shown that all the known categories of ''possible worlds'' used to treat languages that allow for dynamic creation of ''new'' variables, locations, or names are in fact instances of this construction and hence have appropriate universality properties.