CurryHoward correspondence

Results: 45



#Item
1Contractibility + transport ⇔ J Carlo Angiuli December 1, 2014 In MLTT, we usually define the identity type as a reflexive relation satisfying J: Γ`M :A Γ`N :A

Contractibility + transport ⇔ J Carlo Angiuli December 1, 2014 In MLTT, we usually define the identity type as a reflexive relation satisfying J: Γ`M :A Γ`N :A

Add to Reading List

Source URL: www.carloangiuli.com

Language: English - Date: 2015-05-08 13:33:44
2PML : A new proof assistant and deduction system Christophe Raffalli LAMA

PML : A new proof assistant and deduction system Christophe Raffalli LAMA

Add to Reading List

Source URL: www.lama.univ-savoie.fr

Language: English - Date: 2007-07-02 08:10:34
3Type Theory and Constructive Mathematics  Type Theory and Constructive Mathematics Thierry Coquand University of Gothenburg

Type Theory and Constructive Mathematics Type Theory and Constructive Mathematics Thierry Coquand University of Gothenburg

Add to Reading List

Source URL: events.cs.bham.ac.uk

Language: English - Date: 2012-04-26 12:08:31
4Herbrand-Confluence for Cut Elimination in Classical First Order Logic Stefan Hetzl1 and Lutz Straßburger2 1  2

Herbrand-Confluence for Cut Elimination in Classical First Order Logic Stefan Hetzl1 and Lutz Straßburger2 1 2

Add to Reading List

Source URL: www.lix.polytechnique.fr

Language: English - Date: 2012-11-30 05:38:20
5Type-Based Reasoning and Imprecise Errors Janis Voigtl¨ ander Technische Universit¨ at Dresden

Type-Based Reasoning and Imprecise Errors Janis Voigtl¨ ander Technische Universit¨ at Dresden

Add to Reading List

Source URL: www.janis-voigtlaender.eu

Language: English - Date: 2016-08-01 05:50:10
6Fuzzing the Rust Typechecker Using CLP Kyle Dewey Jared Roesch  Ben Hardekopf

Fuzzing the Rust Typechecker Using CLP Kyle Dewey Jared Roesch Ben Hardekopf

Add to Reading List

Source URL: jroesch.github.io

Language: English - Date: 2016-04-16 20:16:50
7Logical Methods in Computer Science Vol. 11(3:7)2015, pp. 1–33 www.lmcs-online.org Submitted May 17, 2014 Published Sep. 3, 2015

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

Language: English - Date: 2016-02-19 10:54:23
8An Introduction to Logical Relations Proving Program Properties Using Logical Relations Lau Skorstengaard   Contents

An Introduction to Logical Relations Proving Program Properties Using Logical Relations Lau Skorstengaard Contents

Add to Reading List

Source URL: www.cs.uoregon.edu

Language: English - Date: 2016-06-30 02:06:10
9Final test: Type Theory and Coqjanuary 2011, 10:30–12:30, HG00.308 The mark for this test is the total number of points divided by ten, where the first 10 points are free. 1. Give a term of the simply typed la

Final test: Type Theory and Coqjanuary 2011, 10:30–12:30, HG00.308 The mark for this test is the total number of points divided by ten, where the first 10 points are free. 1. Give a term of the simply typed la

Add to Reading List

Source URL: www.cs.ru.nl

Language: English - Date: 2011-01-18 05:58:42
10Type Theory and Constructive Mathematics  Type Theory and Constructive Mathematics Thierry Coquand University of Gothenburg

Type Theory and Constructive Mathematics Type Theory and Constructive Mathematics Thierry Coquand University of Gothenburg

Add to Reading List

Source URL: events.cs.bham.ac.uk

Language: English - Date: 2012-04-24 12:00:17