Semantics of computation
From MaRDI portal
Publication:4062639
DOI10.1007/3-540-07142-3_75zbMath0306.68028OpenAlexW1588879467MaRDI QIDQ4062639
Publication date: 1975
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-07142-3_75
Formal languages and automata (68Q45) Minimal systems representations (93B20) Realizations from input-output data (93B15) General topics in the theory of software (68N01) Categories of machines, automata (18B20) Axiomatic systems theory (93A05)
Related Items
Specifications in an arbitrary institution ⋮ Modular algebraic specification of some basic geometrical constructions ⋮ Completeness of category-based equational deduction ⋮ Varieties of chain-complete algebras ⋮ Recursion-closed algebraic theories ⋮ Code selection by inversion of order-sorted derivors ⋮ Order-sorted completion: The many-sorted way ⋮ Equational axiomatizability for coalgebra ⋮ Equational type logic ⋮ A hidden agenda ⋮ Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
