First Page | Document Content | |
---|---|---|
Date: 2014-04-01 05:47:01Theoretical computer science Mathematics Programming language theory Logic in computer science Mathematical logic Asymptotic analysis Logic programming Type theory Unification Rewriting Rewrite order Term | On Rewriting Terms with Strict Functions and Error Propagation Olaf Owe Department of Informatics University of Oslo September 1990Add to Reading ListSource URL: folk.uio.noDownload Document from Source WebsiteFile Size: 245,17 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 |