Semantics of computation

DOI10.1007/3-540-07142-3_75MaRDI QIDQ4062639zbMATH OpenOpenAlexFDO

Authors Joseph Goguen

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

Mathematics Subject Classification ID

Categories of machines, automata (18B20) General topics in the theory of software (68N01) Formal languages and automata (68Q45) Axiomatic systems theory (93A05) Realizations from input-output data (93B15) Minimal systems representations (93B20)

Cited in

(11)

• Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
• Specifications in an arbitrary institution
• Modular algebraic specification of some basic geometrical constructions
• Varieties of chain-complete algebras
• Recursion-closed algebraic theories
• Order-sorted completion: The many-sorted way
• A hidden agenda
• Completeness of category-based equational deduction
• Equational axiomatizability for coalgebra
• Equational type logic
• Code selection by inversion of order-sorted derivors

This page was built for publication: Semantics of computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4062639)