<--- Back to Details
First PageDocument Content
Logic in computer science / Logic programming / Automated theorem proving / Formal languages / Type theory / Substitution / Unification / Admissible rule / Futures and promises / Rewrite order / Rewriting / Symbol
Date: 2012-09-07 15:06:52
Logic 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 List

Source URL: sunsite.informatik.rwth-aachen.de

Download Document from Source Website

File Size: 659,46 KB

Share Document on Facebook

Similar Documents

Lecture Notes on Virtual Substitution & Real Arithmetic

Lecture Notes on Virtual Substitution & Real Arithmetic

DocID: 1xUTv - View Document

Towards Conflict-Driven Learning for Virtual Substitution SMT Workshop ˇ Marek Kosta (joint work K. Korovin and T. Sturm)

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 EXPRESSWAY

LIVELIHOOD SUBSTITUTION: THE CASE OF THE LYARI EXPRESSWAY

DocID: 1vjHF - View Document

Hereditary Substitution for the λ∆-Calculus Harley Eades and Aaron Stump Computer Science CL&C 2012  Overview

Hereditary Substitution for the λ∆-Calculus Harley Eades and Aaron Stump Computer Science CL&C 2012 Overview

DocID: 1vi0p - View Document

Matthieu Fontaine - L’échec de la généralisation existentielle et de la substitution des identiques chez Hintikka

Matthieu Fontaine - L’échec de la généralisation existentielle et de la substitution des identiques chez Hintikka

DocID: 1vfiN - View Document