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 |
Lecture Notes on Virtual Substitution & Real ArithmeticDocID: 1xUTv - View Document | |
Towards Conflict-Driven Learning for Virtual Substitution SMT Workshop ˇ Marek Kosta (joint work K. Korovin and T. Sturm)DocID: 1xUsN - View Document | |
LIVELIHOOD SUBSTITUTION: THE CASE OF THE LYARI EXPRESSWAYDocID: 1vjHF - View Document | |
Hereditary Substitution for the λ∆-Calculus Harley Eades and Aaron Stump Computer Science CL&C 2012 OverviewDocID: 1vi0p - View Document | |
Matthieu Fontaine - L’échec de la généralisation existentielle et de la substitution des identiques chez HintikkaDocID: 1vfiN - View Document |