Final algebra semantics and data type extensions
From MaRDI portal
Publication:1131834
DOI10.1016/0022-0000(79)90011-4zbMath0418.68020OpenAlexW1966748830MaRDI QIDQ1131834
Publication date: 1979
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(79)90011-4
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)
Related Items
Structured algebraic specifications: A kernel language, Generalization of final algebra semantics by relativization, On the existence of free models in abstract algebraic institutions, Behavioural approaches to algebraic specifications. A comparative study, On observational equivalence and algebraic specification, A second order theory of data types, Proof by consistency, Crypt-equivalent algebraic specifications, Algebraic specifications of computable and semicomputable data types, Specification and verification challenges for sequential object-oriented programs, Specifications in an arbitrary institution, Modular algebraic specification of some basic geometrical constructions, Functional un\(|\)unparsing, The behavior-realization adjunction and generalized homomorphic relations, On the algebra of order, A reification calculus for model-oriented software specification, Floyd's principle, correctness theories and program equivalence, Complexity of algebraic implementations for abstract data types, Specifications, models, and implementations of data abstractions, Algebraic implementation of abstract data types, Partial abstract types, Context induction: A proof principle for behavioural abstractions and algebraic implementations, Some fundamental algebraic tools for the semantics of computation. III: Indexed categories, Topological methods for algebraic specification, From Grammars and Automata to Algebras and Coalgebras, Modal logic and algebraic specifications, Final algebras, cosemicomputable algebras and degrees of unsolvability, Abstract implementation of algebraic specifications in a temporal logic language, Compatibility of parameter passing and implementation of parameterized data types, Semantics of algorithmic languages, Swinging types=functions+relations+transition systems, A hidden agenda, Approximation properties of abstract data types, The Foundational Legacy of ASL, A constructive method for abstract algebraic software specification, Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories, A systematic study of models of abstract data types, On the data type extension problem for algebraic specifications, Observational proofs by rewriting.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel realization of systems, using factorizations and quotients in categories
- On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
- Proof of correctness of data representations
- Continuation-Based Program Transformation Strategies
- A Transformation System for Developing Recursive Programs
- Proof techniques for hierarchically structured programs
- Initial Algebra Semantics and Continuous Algebras
- Abstract data types and software validation
- Heterogeneous algebras
- Semantics of context-free languages: Correction
- Realization is universal
- Tree-Manipulating Systems and Church-Rosser Theorems
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
