Iteration 2-theories

DOI10.1023/A:1008708924144zbMath0981.18005OpenAlexW2157488580MaRDI QIDQ5930757

Stephen L. Bloom, Anna Labella, Ernest G. Manes, Zoltán Ésik

Publication date: 13 March 2002

Published in: Applied Categorical Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008708924144

zbMATH Keywords

2-categories2-theoryalgebraic theoriesalgebraically complete categoriesCartesian structuredagger operationdata type specificationsiteration theoriesrecursive data typesrecursive functorial equationsregular treestree transformations

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Equational logic, Mal'tsev conditions (08B05) Grammars and rewriting systems (68Q42) Theories (e.g., algebraic theories), structure, and semantics (18C10) Categorical semantics of formal languages (18C50) Free algebras (08B20)

Related Items (10)

μ-Bicomplete Categories and Parity Games ⋮ Equational properties of iteration in algebraically complete categories ⋮ Simulation relations for pattern matching in directed graphs ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Relative full completeness for bicategorical Cartesian closed structure ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Bisimulation relations for weighted automata ⋮ Graph automata ⋮ Categories with sums and right distributive tensor product

This page was built for publication: Iteration 2-theories