scientific article; zbMATH DE number 233974
From MaRDI portal
Publication:5287508
zbMath0773.03033MaRDI QIDQ5287508
Publication date: 8 July 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
iteration theoriessynchronization treesiteration algebrasFloyd-Hoare logic2- categoriesflowchart programsfixed points of endofunctorsparallelism semanticspartial correctness logiccategorical logic of programming structurescontinuous theoriesequational logic of fixed point semanticsflowchart behaviors
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Abstract and axiomatic computability and recursion theory (03D75)
Related Items (99)
Feedback, trace and fixed-point semantics ⋮ μ-Bicomplete Categories and Parity Games ⋮ A Semantical Approach to Equilibria and Rationality ⋮ Some quasi-varieties of iteration theories ⋮ Inductive \(^{*}\)-semirings ⋮ Parametrized fixed points and their applications to session types ⋮ Unnamed Item ⋮ *-Continuous Kleene $$\omega $$-Algebras ⋮ Processes with multiple entries and exits ⋮ Axiomatizing the equational theory of regular tree languages ⋮ Weighted automata and weighted logics on infinite words ⋮ Tropical Time Series, Iterated-Sums Signatures, and Quasisymmetric Functions ⋮ Bialgebras in Rel ⋮ Conway's work on iteration ⋮ From Coalgebraic to Monoidal Traces ⋮ Inductive semimodules and the vector modules over them. ⋮ The category-theoretic solution of recursive program schemes ⋮ Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs ⋮ Rational and Recognisable Power Series ⋮ An analysis of the equational properties of the well-founded fixed point ⋮ Axiomatizing omega and omega-op powers of words ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ Solving polynomial fixed point equations ⋮ Typing Weak MSOL Properties ⋮ The intricacies of three-valued extensional semantics for higher-order logic programs ⋮ Categorical semantics of a simple differential programming language ⋮ Retracing some paths in process algebra ⋮ Free iterative and iteration \(K\)-semialgebras ⋮ The Triple-Pair Construction for Weighted ω-Pushdown Automata ⋮ Calculating Colimits Compositionally ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ An algebraic glimpse at bunched implications and separation logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Attribute Grammars and Categorical Semantics ⋮ Two-way representations and weighted automata ⋮ Equational axioms associated with finite automata for fixed point operations in cartesian categories ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unguarded recursion on coinductive resumptions ⋮ Iteration Semirings ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Bisimulations for weighted automata over an additively idempotent semiring ⋮ Unifying Guarded and Unguarded Iteration ⋮ Unnamed Item ⋮ A Hoare logic for linear systems ⋮ Schützenberger's theorem on formal power series follows from Kleene's theorem ⋮ Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot ⋮ A string diagrammatic axiomatisation of finite-state automata ⋮ A Unifying Kleene Theorem for Weighted Finite Automata ⋮ Elgot theories: a new perspective on the equational properties of iteration ⋮ Complete Elgot monads and coalgebraic resumptions ⋮ A complete proof system for Nested Term Graphs ⋮ The monoidal structure of Turing machines ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Proof-Relevant Logical Relations for Name Generation ⋮ Unfixing the Fixpoint: The Theories of the λY-Calculus ⋮ Categorical rewriting of term-like structures ⋮ Ambiguous classes in \(\mu\)-calculi hierarchies ⋮ Finite quasivarieties and self-referential conditions ⋮ Fuzzy regular languages over finite and infinite words ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? ⋮ Algebras for iteration and infinite computations ⋮ Unnamed Item ⋮ Terminal coalgebras and free iterative theories ⋮ A metalanguage for guarded iteration ⋮ Modal Fixed-Point Logic and Changing Models ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ A Kleene Theorem for Forest Languages ⋮ Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract) ⋮ Simulations of Weighted Tree Automata ⋮ Undirected Graphs of Entanglement 2 ⋮ Unnamed Item ⋮ A New Foundation for Finitary Corecursion ⋮ Unnamed Item ⋮ A new foundation for finitary corecursion and iterative algebras ⋮ Traced Premonoidal Categories ⋮ Partial Conway and Iteration Semiring-Semimodule Pairs ⋮ Kleene Theorem in Partial Conway Theories with Applications ⋮ Algebraic Systems and Pushdown Automata ⋮ Ternary Equational Languages ⋮ Extensional Semantics for Higher-Order Logic Programs with Negation ⋮ Equational theories for automata ⋮ Comparing cospan-spans and tiles via a Hoare-style process calculus ⋮ On Rational Monads and Free Iterative Theories ⋮ Unique, guarded fixed points in an additive setting ⋮ The Uniformity Principle on Traced Monoidal Categories ⋮ Matrices, machines and behaviors ⋮ The logic of recursive equations ⋮ The finite basis problem for endomorphism semirings of finite semilattices with zero. ⋮ \(*\)-\(\mu\)-semirings and \(*\)-\(\lambda\)-semirings ⋮ On equations for union-free regular languages ⋮ Pushdown tree automata, algebraic tree systems, and algebraic tree series ⋮ Labelled Markov Processes as Generalised Stochastic Relations ⋮ A Fully Equational Proof of Parikh's Theorem
This page was built for publication:
