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

Description Logics  ILCS 2007 Introduction to Logic in Computer Science: Autumn 2007

Description Logics ILCS 2007 Introduction to Logic in Computer Science: Autumn 2007

DocID: 1xVOl - View Document

Deontic Logic in Computer Science Leon van der Torre & Jörg Hansen ESSLIAugust 2008

Deontic Logic in Computer Science Leon van der Torre & Jörg Hansen ESSLIAugust 2008

DocID: 1uHka - View Document

αKanren A Fresh Name in Nominal Logic Programming William E. Byrd and Daniel P. Friedman Department of Computer Science, Indiana University, Bloomington, IN 47408 {webyrd,dfried}@cs.indiana.edu

αKanren A Fresh Name in Nominal Logic Programming William E. Byrd and Daniel P. Friedman Department of Computer Science, Indiana University, Bloomington, IN 47408 {webyrd,dfried}@cs.indiana.edu

DocID: 1ux8H - View Document

23rd Annual IEEE Symposium on Logic in Computer Science  Winning regions of higher-order pushdown games∗ A. Carayol†  M. Hague‡

23rd Annual IEEE Symposium on Logic in Computer Science Winning regions of higher-order pushdown games∗ A. Carayol† M. Hague‡

DocID: 1uwn4 - View Document

Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK

Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK

DocID: 1ud4n - View Document