The following pages link to (Q4178466):
Displaying 23 items.
- Algebraic and operational semantics of specifications allowing exceptions and errors (Q759478) (← links)
- Correctness of recursive parallel nondeterministic flow programs (Q789165) (← links)
- A constructive method for abstract algebraic software specification (Q796979) (← links)
- A systematic study of models of abstract data types (Q801667) (← links)
- Algebraic domain equations (Q1054464) (← links)
- Parameter passing in algebraic specification languages (Q1056226) (← 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)
- Abstract data types with exception handling: An initial approach based on a distinction between exceptions and errors (Q1082804) (← links)
- On the existence of free models in abstract algebraic institutions (Q1085969) (← links)
- On observational equivalence and algebraic specification (Q1089796) (← links)
- Quasi-varieties in abstract algebraic institutions (Q1091132) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- Correctness proofs for abstract implementations (Q1119388) (← links)
- Final algebra semantics and data type extensions (Q1131834) (← links)
- On the algebra of order (Q1143782) (← links)
- More on advice on structuring compilers and proving them correct (Q1156472) (← links)
- Complexity of algebraic implementations for abstract data types (Q1158952) (← links)
- Regular trees and the free iterative theory (Q1169813) (← links)
- The extended calculus of constructions (ECC) with inductive types (Q1193601) (← links)
- Final algebras, cosemicomputable algebras and degrees of unsolvability (Q1199822) (← links)
- Toward a system's environment for computer assisted programming (Q1226388) (← links)
- Data types, abstract data types and their specification problem (Q1252032) (← links)
