First Page | Document Content | |
---|---|---|
Date: 2012-09-07 15:06:52Logic in computer science Logic programming Automated theorem proving Formal languages Type theory Substitution Unification Admissible rule Futures and promises Rewrite order Rewriting Symbol | Aachen Department of Computer Science Technical Report Symbolic Evaluation Graphs and Term Rewriting —Add to Reading ListSource URL: sunsite.informatik.rwth-aachen.deDownload Document from Source WebsiteFile Size: 659,46 KBShare Document on Facebook |
ISRFORT Property arbitrary first-order formula over rewrite relations as predicatesDocID: 1tN0S - View Document | |
On Rewriting Terms with Strict Functions and Error Propagation Olaf Owe Department of Informatics University of Oslo September 1990DocID: 1rjs4 - View Document | |
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Proving Termination by Dependency Pairs and Inductive Theorem Proving Carsten Fuhs · J¨DocID: 1reYE - View Document | |
Aachen Department of Computer Science Technical Report Symbolic Evaluation Graphs and Term Rewriting —DocID: 1oO7l - View Document |