Pages that link to "Item:Q3868738"
From MaRDI portal
The following pages link to Abstract Data Type Specification in the Affirm System (Q3868738):
Displaying 10 items.
- A constructive method for abstract algebraic software specification (Q796979) (← links)
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure (Q1106657) (← links)
- Hoare's logic and Peano's arithmetic (Q1170877) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- Partial completion of equational theories (Q1592635) (← links)
- Unification modulo lists with reverse relation with certain word equations (Q2305403) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
- (Q3667939) (← links)