<--- 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

From Events to Futures and Promises and back Martin Sulzmann Faculty of Computer Science and Business Information Systems Karlsruhe University of Applied Sciences Moltkestrasse 30, 76133 Karlsruhe, Germany martin.sulzman

From Events to Futures and Promises and back Martin Sulzmann Faculty of Computer Science and Business Information Systems Karlsruhe University of Applied Sciences Moltkestrasse 30, 76133 Karlsruhe, Germany martin.sulzman

DocID: 1tJZO - View Document

Administrivia  Design of Parallel and High-Performance Computing

Administrivia  Design of Parallel and High-Performance Computing

DocID: 1rqkH - View Document

A Formal Model for Direct-style Asynchronous Observables Philipp Haller! KTH Royal Institute of Technology, Sweden! !

A Formal Model for Direct-style Asynchronous Observables Philipp Haller! KTH Royal Institute of Technology, Sweden! !

DocID: 1r0Je - View Document

HabaneroUPC++: a Compiler-free PGAS Library  ∗ Vivek Kumar† , Yili Zheng‡ , Vincent Cavé† , Zoran Budimli´c† , and Vivek Sarkar† † Rice

HabaneroUPC++: a Compiler-free PGAS Library ∗ Vivek Kumar† , Yili Zheng‡ , Vincent Cavé† , Zoran Budimli´c† , and Vivek Sarkar† † Rice

DocID: 1qYcy - View Document