Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview
From MaRDI portal
Publication:2946322
DOI10.1007/978-3-662-48057-1_2zbMath1423.68270OpenAlexW2103765734MaRDI QIDQ2946322
Publication date: 16 September 2015
Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48057-1_2
Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55) Theories (e.g., algebraic theories), structure, and semantics (18C10) Categories of machines, automata (18B20)
Related Items (2)
An analysis of the equational properties of the well-founded fixed point ⋮ Inversion, Iteration, and the Art of Dual Wielding
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A connection between concurrency and language theory
- Free inductive \(K\)-semialgebras
- Free iterative and iteration \(K\)-semialgebras
- Axiomatizing the equational theory of regular tree languages
- Independence of the equational axioms for iteration theories
- Equational properties of iteration in algebraically complete categories
- Metric interpretations of infinite trees and semantics of non deterministic recursive programs
- Complete systems of \(\mathcal B\)-rational identities
- Iteration theories of synchronization trees
- Group axioms for iteration
- A completeness theorem for Kleene algebras and the algebra of regular events
- The equational logic of fixed points
- Completeness of Park induction
- On the equational definition of the least prefixed point.
- A proof of the Krohn--Rhodes Decomposition Theorem
- Equational logic of circular data type specification
- Inductive \(^{*}\)-semirings
- A fixed point theorem for non-monotonic functions
- Axiomatizing rational power series over natural numbers
- Axiomatizing weighted synchronization trees and weighted bisimilarity
- The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
- Equational Properties of Stratified Least Fixed Points (Extended Abstract)
- Equational axioms associated with finite automata for fixed point operations in cartesian categories
- Equational Axioms for Probabilistic Bisimilarity
- Residuated Park theories
- Une remarque sur les systèmes complets d'identités rationnelles
- Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
- Algebraic specification of data types: A synthetic approach
- Initial Algebra Semantics and Continuous Algebras
- Floyd-Hoare logic in iteration theories
- Une condition impliquant toutes les identités rationnelles
- Solving Fixed Point Equations over Complete Semirings
- THE POWER OF THE GROUP-IDENTITIES FOR ITERATION
- Traced monoidal categories
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Multi-Linear Iterative K-Σ-Semialgebras
- Some quasi-varieties of iteration theories
- Rudiments of \(\mu\)-calculus
- Iteration 2-theories
This page was built for publication: Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview
