On the construction of free algebras for equational systems

DOI10.1016/J.TCS.2008.12.052zbMath1170.18006OpenAlexW2102036964MaRDI QIDQ1014644

Chung-Kil Hur, Marcelo P. Fiore

Publication date: 29 April 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.052

zbMATH Keywords

algebramonadfree constructionequational system

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Equational categories (18C05) Free algebras (08B20)

Related Items (14)

Equational Theories of Scattered and Countable Series-Parallel Posets ⋮ A categorical framework for congruence of applicative bisimilarity in higher-order languages ⋮ Monad transformers as monoid transformers ⋮ Variable binding and substitution for (nameless) dummies ⋮ Structured handling of scoped effects ⋮ Variable binding and substitution for (nameless) dummies ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Term Equational Systems and Logics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ List Objects with Algebraic Structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
• A new approach to abstract syntax with variable binding
• Variations on algebra: Monadicity and generalisations of equational theories
• Concrete domains
• A fully abstract model for the \(\pi\)-calculus.
• Algebraic operations and generic effects
• The semantics and proof theory of the logic of bunched implications
• Strong functors and monoidal monads
• Nominal Equational Logic
• A Formal Calculus for Informal Equality with Binding
• Dualising initial algebras
• Datatype laws without signatures
• Equational Systems and Free Constructions (Extended Abstract)
• Programming Languages and Systems
• On closed categories of functors
• Foundations of Software Science and Computational Structures

This page was built for publication: On the construction of free algebras for equational systems