The following pages link to (Q3912001):
Displayed 13 items.
- Interface theories for concurrency and data (Q549177) (← links)
- A constructive method for abstract algebraic software specification (Q796979) (← links)
- A systematic study of models of abstract data types (Q801667) (← links)
- A functorial framework for constraint normal logic programming (Q934677) (← links)
- Structured algebraic specifications: A kernel language (Q1080652) (← links)
- Crypt-equivalent algebraic specifications (Q1095646) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- Simplifying conditional term rewriting systems: Unification, termination and confluence (Q1100891) (← links)
- Specifications in an arbitrary institution (Q1108775) (← links)
- Partial abstract types (Q1169290) (← links)
- Complexity analysis of term-rewriting systems (Q1262761) (← links)
- Refutational theorem proving for hierarchic first-order theories (Q1328182) (← links)
- Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras (Q1838960) (← links)