Matricial theories
From MaRDI portal
Publication:1239362
DOI10.1016/0021-8693(76)90106-XzbMath0361.18004MaRDI QIDQ1239362
Publication date: 1976
Published in: Journal of Algebra (Search for Journal in Brave)
Theories (e.g., algebraic theories), structure, and semantics (18C10) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Categories of machines, automata (18B20)
Related Items
Feedback, trace and fixed-point semantics ⋮ Matrix and matricial iteration theories. I ⋮ Matrix and matricial iteration theories. II ⋮ On flowchart theories. II: The nondeterministic case ⋮ Iterative and recursive matrix theories ⋮ Unnamed Item ⋮ Parameter passing in nondeterministic recursive programs ⋮ Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata ⋮ Dynamic matrices and the cost analysis of concurrent programs ⋮ The equational logic of fixed points ⋮ Partially additive categories and flow-diagram semantics ⋮ The Triple-Pair Construction for Weighted ω-Pushdown Automata ⋮ Program correctness and matricial iteration theories ⋮ In memoriam Calvin C. Elgot ⋮ \( \ell r\)-multisemigroups, modal quantales and the origin of locality ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Semantic models for total correctness and fairness ⋮ A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization ⋮ Semantic models for total correctness and fairness ⋮ Fuzzy regular languages over finite and infinite words ⋮ On the algebraic structure of rooted trees ⋮ Dagger extension theorem ⋮ Partial Conway and Iteration Semiring-Semimodule Pairs ⋮ Kleene Theorem in Partial Conway Theories with Applications ⋮ Unique, guarded fixed points in an additive setting ⋮ Calvin C. Elgot (1922-1980) ⋮ All solutions of a system of recursion equations in infinite trees and other contraction theories ⋮ Deterministic and nondeterministic flowchart interpretations ⋮ Classes of finite relations as initial abstract data types. II
Cites Work
