Pages that link to "Item:Q1131834"
From MaRDI portal
The following pages link to Final algebra semantics and data type extensions (Q1131834):
Displaying 39 items.
- Topological methods for algebraic specification (Q671657) (← links)
- Modal logic and algebraic specifications (Q685423) (← links)
- Compatibility of parameter passing and implementation of parameterized data types (Q759479) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- A constructive method for abstract algebraic software specification (Q796979) (← links)
- A systematic study of models of abstract data types (Q801667) (← links)
- On the data type extension problem for algebraic specifications (Q801668) (← links)
- A reification calculus for model-oriented software specification (Q911753) (← links)
- Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories (Q1059404) (← links)
- Structured algebraic specifications: A kernel language (Q1080652) (← links)
- On the existence of free models in abstract algebraic institutions (Q1085969) (← links)
- On observational equivalence and algebraic specification (Q1089796) (← links)
- A second order theory of data types (Q1092657) (← links)
- Proof by consistency (Q1094888) (← links)
- Crypt-equivalent algebraic specifications (Q1095646) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- Specifications in an arbitrary institution (Q1108775) (← links)
- Modular algebraic specification of some basic geometrical constructions (Q1115574) (← links)
- On the algebra of order (Q1143782) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- Complexity of algebraic implementations for abstract data types (Q1158952) (← links)
- Specifications, models, and implementations of data abstractions (Q1161277) (← links)
- Algebraic implementation of abstract data types (Q1163361) (← links)
- Partial abstract types (Q1169290) (← links)
- Context induction: A proof principle for behavioural abstractions and algebraic implementations (Q1179807) (← links)
- Some fundamental algebraic tools for the semantics of computation. III: Indexed categories (Q1183597) (← links)
- Final algebras, cosemicomputable algebras and degrees of unsolvability (Q1199822) (← links)
- Behavioural approaches to algebraic specifications. A comparative study (Q1338907) (← links)
- The behavior-realization adjunction and generalized homomorphic relations (Q1391868) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- A hidden agenda (Q1575735) (← links)
- Observational proofs by rewriting. (Q1607227) (← links)
- Approximation properties of abstract data types (Q1838281) (← links)
- Functional un\(|\)unparsing (Q1929354) (← links)
- Abstract implementation of algebraic specifications in a temporal logic language (Q2277861) (← links)
- Specification and verification challenges for sequential object-oriented programs (Q2643131) (← links)
- From Grammars and Automata to Algebras and Coalgebras (Q3014929) (← links)
- The Foundational Legacy of ASL (Q5256352) (← links)
- Generalization of final algebra semantics by relativization (Q5887520) (← links)
