Monoidal indeterminates and categories of possible worlds

DOI10.1016/J.ENTCS.2009.07.083MaRDI QIDQ2805149zbMATH OpenOpenAlexFDO

Authors Claudio Hermida, Robert D. Tennent

Publication date 10 May 2016

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2009.07.083

zbMATH Keywords

universalitysymmetric monoidal categoriesindeterminatespossible-world semantics

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Theories (e.g., algebraic theories), structure, and semantics (18C10) Semantics in the theory of computing (68Q55)

Recommendations

• Monoidal indeterminates and categories of possible worlds
• A Linear Category of Polynomial Functors (extensional part)
• Languages for monoidal categories
• On Categories of Monoids, Comonoids, and Bimonoids
• Polynomial functors and polynomial monads

Cites work

• scientific article; zbMATH DE number 431769 (Why is no real title available?)
• scientific article; zbMATH DE number 3949678 (Why is no real title available?)
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 3748394 (Why is no real title available?)
• scientific article; zbMATH DE number 3783237 (Why is no real title available?)
• scientific article; zbMATH DE number 3522182 (Why is no real title available?)
• scientific article; zbMATH DE number 3522196 (Why is no real title available?)
• scientific article; zbMATH DE number 3999254 (Why is no real title available?)
• scientific article; zbMATH DE number 5273316 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• A fibrational framework for possible-world semantics of \textsc{Algol}-like languages
• A fully abstract model for the \(\pi\)-calculus.
• Braided tensor categories
• Categorical logic of names and abstraction in action calculi
• Coherence in substructural categories
• Fibrations with indeterminates: contextual and functional completeness for polymorphic lambda calculi
• Foundations of Software Science and Computational Structures
• From Algol to polymorphic linear lambda-calculus
• Full abstraction for the second order subset of an ALGOL-like language
• Global state considered helpful
• Parametricity and local variables
• Semantical analysis of specification logic
• Semantical analysis of specification logic. II
• Syntactic control of interference revisited
• The uniformity principle on traced monoidal categories
• Traced monoidal categories

Cited in

(3)

• Monoidal indeterminates and categories of possible worlds
• A fibrational framework for possible-world semantics of \textsc{Algol}-like languages
• Two cotensors in one: presentations of algebraic theories for local state and fresh names

This page was built for publication: Monoidal indeterminates and categories of possible worlds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805149)