Abstract
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automated proving technique, called extensional rewriting, that can be instantiated and then used to prove equational properties in various particular extensional theories.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1066-1079 |
| Number of pages | 14 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 3142 |
| State | Published - 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science