Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories

DOI10.1016/0304-3975(84)90134-8zbMath0566.68065OpenAlexW1554884006MaRDI QIDQ1059404

Rod M. Burstall, Joseph A. Goguen

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90134-8

zbMATH Keywords

algebraic theoriescategory theorycomma categoriescolimitscalculus of operationsCLEARfree theoriesprogram specificationssorted theoriestwo- dimensional categories

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items (12)

Structured theory presentations and logic representations ⋮ On the existence of free models in abstract algebraic institutions ⋮ Categorical approach to the construction of fuzzy graph grammars ⋮ Toward formal development of programs from algebraic specifications: Implementations revisited ⋮ Quasi-varieties in abstract algebraic institutions ⋮ Specifications in an arbitrary institution ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ Some fundamental algebraic tools for the semantics of computation. III: Indexed categories ⋮ Birkhoff-Frink representations as functors ⋮ A 2-categorial generalization of the concept of institution ⋮ A categorical manifesto ⋮ Pushout-complements and basic concepts of grammars in toposes

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
• Correctness of recursive parallel nondeterministic flow programs
• Proofs by induction in equational theories with constructors
• Final algebra semantics and data type extensions
• Topoi. The categorial analysis of logic
• Parallel realization of systems, using factorizations and quotients in categories
• Varieties of ordered algebras
• Extended directed graphs, a formalism for structured data and data structures
• Some Remarks Concerning Categories and Subspaces
• Data Type Specification: Parameterization and the Power of Specification Techniques
• Semantics of computation
• Proving Theorems about LISP Functions
• Primitive recursive algebraic theories and program schemes
• Semantics of the Domain of Flow Diagrams
• Initial Algebra Semantics and Continuous Algebras
• Abstract data types and software validation
• Automata in general algebras
• Heterogeneous algebras
• Algebras with a Scheme of Operators
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• A Perspective View of Discrete Automata and Their Design

This page was built for publication: Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories