Cited in
(9)- An upper bound on the derivational complexity of Knuth-Bendix orderings.
- Generic induction proofs
- Test sets for the universal and existential closure of regular tree languages.
- CoCasl
- UNICOM
- Deduction and Declarative Programming
- Swinging types=functions+relations+transition systems
- Expander2: program verification between interaction and automation
- A general framework to build contextual cover set induction provers
This page was built for software: EXPANDER
