<--- Back to Details
First PageDocument Content
Logic / Mathematical logic / Proof theory / Abstraction / Non-classical logic / Logic in computer science / Philosophical logic / Model theory / Sequent / CurryHoward correspondence / Intuitionistic logic / Cut-elimination theorem
Date: 2016-02-19 10:54:23
Logic
Mathematical logic
Proof theory
Abstraction
Non-classical logic
Logic in computer science
Philosophical logic
Model theory
Sequent
CurryHoward correspondence
Intuitionistic logic
Cut-elimination theorem

Logical Methods in Computer Science Vol. 11(3:7)2015, pp. 1–33 www.lmcs-online.org Submitted May 17, 2014 Published Sep. 3, 2015

Add to Reading List

Source URL: www.lix.polytechnique.fr

Download Document from Source Website

File Size: 473,68 KB

Share Document on Facebook

Similar Documents

Overview  Abstraction The Rest

Overview Abstraction The Rest

DocID: 1xW1V - View Document

LMS-Verify Abstraction Without Regret for Verified Systems Programming Nada Amin & Tiark Rompf EPFL & Purdue University

LMS-Verify Abstraction Without Regret for Verified Systems Programming Nada Amin & Tiark Rompf EPFL & Purdue University

DocID: 1xVQq - View Document

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1

DocID: 1xVJt - View Document

Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch

Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch

DocID: 1xVFk - View Document