Computation and Deduction Lecture 16: The Curry-Howard Isomorphism - PowerPoint PPT Presentation

Aug 20, 2023 •188 likes •295 views

Computation and Deduction Lecture 16: The Curry-Howard Isomorphism March 6, 1997 1. Natural Deduction 2. A Simply-Typed -Calculus 3. The Curry-Howard Isomorphism 16.1 Natural Deduction I nd : o -> type. % deductions %name nd D E andi

Computation and Deduction Lecture 16: The Curry-Howard Isomorphism March 6, 1997 1. Natural Deduction 2. A Simply-Typed λ -Calculus 3. The Curry-Howard Isomorphism 16.1
Natural Deduction I nd : o -> type. % deductions %name nd D E andi : nd A -> nd B -> nd (A and B). andel : nd (A and B) -> nd A. ander : nd (A and B) -> nd B. impi : (nd A -> nd B) -> nd (A imp B). impe : nd (A imp B) -> nd A -> nd B. oril : nd A -> nd (A or B). orir : nd B -> nd (A or B). ore : nd (A or B) -> (nd A -> nd C) -> (nd B -> nd C) -> nd C. noti : ({p:o} nd A -> nd p) -> nd (not A). note : nd (not A) -> {C:o} nd A -> nd C. 16.2
Natural Deduction II truei : nd (true). falsee : nd (false) -> nd C. foralli : ({a:i} nd (A a)) -> nd (forall A). foralle : nd (forall A) -> {T:i} nd (A T). existsi : {T:i} nd (A T) -> nd (exists A). existse : nd (exists A) -> ({a:i} nd (A a) -> nd C) -> nd C. 16.3
Simply-Typed λ -Calculus tm : type. %name tm M N pair : tm -> tm -> tm. fst : tm -> tm. snd : tm -> tm. lam : o -> (tm -> tm) -> tm. app : tm -> tm -> tm. inl : o -> tm -> tm. inr : o -> tm -> tm. case : tm -> (tm -> tm) -> (tm -> tm) -> tm. mu : o -> (o -> tm -> tm) -> tm. mapp : o -> tm -> tm -> tm. triv : tm. abort : o -> tm -> tm. 16.4
Typing Rules I # : tm -> o -> type. %name # P Q %infix none 9 # #pair : M # A -> N # B -> (pair M N) # (A and B). #fst : M # (A and B) -> fst M # A. #snd : M # (A and B) -> snd M # B. #lam : ({u:tm} u # A -> (M u) # B) -> (lam A M) # (A imp B). 16.5
Typing Rules II #app : M # (A imp B) -> N # A -> (app M N) # B. #inl : M # A -> (inl B M) # (A or B). #inr : N # B -> (inr A N) # (A or B). #case : M # (A or B) -> ({u1:tm} u1 # A -> (N1 u1) # C) -> ({u2:tm} u2 # B -> (N2 u2) # C) -> (case M N1 N2) # C. 16.6
Typing Rules III #mu : ({p:o}{u:tm} u # A -> (M p u) # p) -> (mu A M) # (not A). #mapp : M # (not A) -> N # A -> (mapp C M N) # C. #triv : triv # true. #abort : M # false -> (abort C M) # C. 16.7
Curry-Howard Isomorphism I ch : nd A -> {M:tm} M # A -> type. ch_andi : ch (andi D E) (pair M N) (#pair P Q) <- ch D M P <- ch E N Q. ch_andel : ch (andel D) (fst M) (#fst P) <- ch D M P. ch_ander : ch (ander D) (snd M) (#snd P) <- ch D M P. 16.8
Curry-Howard Isomorphism II ch_impi : ch (impi D) (lam A M) (#lam P) <- ({u : nd A} {x : tm} {u’ : x # A} ch u x u’ -> ch (D u) (M x) (P x u’)). ch_impe : ch (impe D E) (app M N) (#app P Q) <- ch D M P <- ch E N Q. ch_oril : ch (oril D) (inl B M) (#inl P) <- ch D M P. ch_orir : ch (orir E) (inr A N) (#inr Q) <- ch E N Q. 16.9
Curry-Howard Isomorphism III ch_ore : ch (ore D E1 E2) (case M N1 N2) (#case P Q1 Q2) <- ch D M P <- ({u1:nd A} {x1:tm} {u1’ : x1 # A} ch u1 x1 u1’ -> ch (E1 u1) (N1 x1) (Q1 x1 u1’)) <- ({u2:nd B} {x2:tm} {u2’ : x2 # B} ch u2 x2 u2’ -> ch (E2 u2) (N2 x2) (Q2 x2 u2’)). ch_truei : ch (truei) (triv) (#triv). ch_falsee : ch (falsee D) (abort C M) (#abort P) <- ch D M P. 16.10

Recommend

Toward a Curry-Howard Correspondence for Linear, Reversible Computation Reversible Computation

Toward a Curry-Howard Correspondence for Linear, Reversible Computation Reversible Computation 2020 Kostia Chardonnet 1 , 2 Alexis Saurin 2 Benot Valiron 1 1 Universit Paris Saclay 2 Universit de Paris Classical vs Quantum Control Known :

638 views • 48 slides

Computation and Deduction Lecture 15: Natural Deduction March 4, 1997 1. Natural Deduction 2.

Computation and Deduction Lecture 15: Natural Deduction March 4, 1997 1. Natural Deduction 2. Local Reduction 3. Congruences 15.1 Predicate Logic i : type. % individuals o : type. % formulas %name i T S %name o A B C and : o -> o

214 views • 9 slides

Curry-Howard isomorphism for sequent calculus at last Jos e Carlos Esp rito Santo Centro

Introduction Sequent calculus Natural deduction Results Curry-Howard isomorphism for sequent calculus at last Jos e Carlos Esp rito Santo Centro de Matem atica Universidade do Minho Portugal jes@math.uminho.pt Estonian-Finnish

1.36k views • 103 slides

CSE 505: Programming Languages Lecture 12 The Curry-Howard Isomorphism Zach Tatlock Fall

CSE 505: Programming Languages Lecture 12 The Curry-Howard Isomorphism Zach Tatlock Fall 2013 We are Language Designers! What have we done? Define a programming language we were fairly formal still pretty close to OCaml if you

446 views • 31 slides

Propositional Logic: Formal Deduction Alice Gao Lecture 7 CS 245 Logic and Computation Fall

Propositional Logic: Formal Deduction Alice Gao Lecture 7 CS 245 Logic and Computation Fall 2019 1 / 15 Outline Learning goals Motivation for formal deduction Rules of formal deduction Revisiting the Learning Goals CS 245 Logic and

470 views • 15 slides

Logic and Computation Lecture 2 Zena M. Ariola University of Oregon 24th Estonian Winter School

Logic and Computation Lecture 2 Zena M. Ariola University of Oregon 24th Estonian Winter School in Computer Science, EWSCS 19 Curry-Howard isomorphism A correspondence between minimal propositional logic and simply typed lambda-calculus

1.29k views • 89 slides

An Institutional View on the Curry-Howard-Tait-Isomorphism Till Mossakowski and Joseph Goguen

An Institutional View on the Curry-Howard-Tait-Isomorphism Till Mossakowski and Joseph Goguen 4th FLIRTS, October 2005 2 The Curry-Howard-Tait isomorphism . . . establishes a correspondence between propositions and types proofs and

550 views • 22 slides

Computer Assisted Proofs Colin R IBA LIP ENS Lyon Course 05 10th Oct. 2014 1 / 18

Computer Assisted Proofs Colin R IBA LIP ENS Lyon Course 05 10th Oct. 2014 1 / 18 Curry-Howard Correspondence Curry-Howard Correspondence Intuitionistic Predicate Logic 2 / 18 Curry-Howard Correspondence Proof Terms and Translation of

773 views • 44 slides

Propositional Logic: Soundness of Formal Deduction Alice Gao Lecture 9 CS 245 Logic and

Propositional Logic: Soundness of Formal Deduction Alice Gao Lecture 9 CS 245 Logic and Computation Fall 2019 1 / 16 Learning Goals By the end of this lecture, you should be able to deduction and the soundness of formal deduction.

302 views • 16 slides

Harmony, the Curry-Howard(-Lambek) Correspondence, and Higher Proof Theory Yoshihiro Maruyama

Proof-Theoretic Harmony The Curry-Howard(-Lambek) Corrspondence Higher Proof Theory Harmony, the Curry-Howard(-Lambek) Correspondence, and Higher Proof Theory Yoshihiro Maruyama The Hakubi Centre for Advanced Research, Kyoto University Sojin,

325 views • 15 slides

Lecture 3: Typed Lambda Calculus and Curry-Howard H. Geuvers Radboud University Nijmegen, NL

Lecture 3: Typed Lambda Calculus and Curry-Howard H. Geuvers Radboud University Nijmegen, NL 21st Estonian Winter School in Computer Science Winter 2016 H. Geuvers - Radboud Univ. EWSCS 2016 Typed -calculus 1 / 65 Outline H. Geuvers -

566 views • 42 slides

Path-Based Query Computation by Automated Deduction Peter Baumgartner AG 2

Path-Based Query Computation by Automated Deduction Peter Baumgartner AG 2 www.mpi-sb.mpg.de/~baumgart/ P. Baumgartner Path-Based Query Computation by Automated Deduction Page 1 Background Deduction Systems First-Order Classical and

256 views • 10 slides

Propositional Logic: Completeness of Formal Deduction Alice Gao Lecture 10 CS 245 Logic and

Propositional Logic: Completeness of Formal Deduction Alice Gao Lecture 10 CS 245 Logic and Computation Fall 2019 1 / 37 Learning Goals By the end of this lecture, you should be able to their defjnitions. theorem. CS 245 Logic and

600 views • 37 slides

Computation and Deduction Lecture 19: Cut Elimination Tuesday March 18, 1997 1. Soundness of

Computation and Deduction Lecture 19: Cut Elimination Tuesday March 18, 1997 1. Soundness of Sequent Calculus 2. Completeness of Sequent Calculus 3. Cut Elimination 19.1 Soundness of Sequent Calculus I ssdc : conc A -> nd A -> type.

583 views • 9 slides

The Limits of the Curry-Howard Isomorphism Reinhard Kahle 1 and Anton Setzer 2 1 DM and CENTRIA,

The Limits of the Curry-Howard Isomorphism Reinhard Kahle 1 and Anton Setzer 2 1 DM and CENTRIA, FCT Universidade Nova de Lisboa, Portugal 2 Dept. of Computer Science, Swansea University, Swansea, UK T ubingen, FRC workshop, 21 February 2014

555 views • 51 slides

Predicate Logic: Soundness and Completeness of Formal Deduction Alice Gao Lecture 17 CS 245

Predicate Logic: Soundness and Completeness of Formal Deduction Alice Gao Lecture 17 CS 245 Logic and Computation Fall 2019 1 / 9 Outline The Learning Goals The Soundness of Formal Deduction Revisiting the Learning Goals CS 245 Logic and

243 views • 9 slides

Logic and Computation Zena M. Ariola University Of Oregon Outline of Lectures Lecture 1:

Logic and Computation Zena M. Ariola University Of Oregon Outline of Lectures Lecture 1: - calculus Minimal Propositional Logic and simply typed - calculus as deduction system and as a computation engine

522 views • 40 slides

Systems for Integrated Computation and Deduction The C ALCULEMUS IHP Training Network

Systems for Integrated Computation and Deduction The C ALCULEMUS IHP Training Network HPRN-CT-2000-00102 Christoph Benzmller and Jrg Siekmann Saarland University and German Research Centre for AI (DFKI) c Benzmller, C ALCULEMUS

247 views • 6 slides

Failure is Not an Option The Curry-Howard-Shadok correspondence Pierre-Marie Pdrot joint work

Failure is Not an Option The Curry-Howard-Shadok correspondence Pierre-Marie Pdrot joint work with Nicolas Tabareau Max Planck Institute for Software Systems Sminaire PPS P.-M. Pdrot (MPI-SWS) Failure is Not an Option 22/02/2018 1 / 44

1.35k views • 119 slides

Exercises -> (map ((curry +) 3) (1 2 3 4 5)) ??? -> (exists? ((curry =) 3) (1 2 3 4

Exercises -> (map ((curry +) 3) (1 2 3 4 5)) ??? -> (exists? ((curry =) 3) (1 2 3 4 5)) ??? -> (filter ((curry >) 3) (1 2 3 4 5)) ??? ; tricky Answers -> (map ((curry +) 3) (1 2 3 4 5)) (4 5 6 7 8) ->

276 views • 23 slides

More on the Curry Howard Isomorphism Curtis Millar CSE, UNSW (and Data61) 29 July 2020 1

Intuitionistic Logic Correction Administrivia Software System Design and Implementation More on the Curry Howard Isomorphism Curtis Millar CSE, UNSW (and Data61) 29 July 2020 1 Intuitionistic Logic Correction Administrivia What is

668 views • 29 slides

Computation-as-deduction in Abella: work in progress Kaustuv Chaudhuri, Ulysse G erard and Dale

Computation-as-deduction in Abella: work in progress Kaustuv Chaudhuri, Ulysse G erard and Dale Miller LFMTP, July 7, 2018 Inria Saclay Palaiseau France Introduction Abella is an interactive theorem prover in which relations, and not

569 views • 23 slides

Semantic Entailment and Natural Deduction Alice Gao Lecture 6, September 26, 2017 Entailment

Semantic Entailment and Natural Deduction Alice Gao Lecture 6, September 26, 2017 Entailment 1/55 Learning goals Semantic entailment valuation trees, and/or logical identities. Natural deduction in propositional logic inference rules.

735 views • 55 slides

Type Theory and Coq Herman Geuvers Lecture: Simple Type Theory ` a la Curry: assigning types to

Type Theory and Coq Herman Geuvers Lecture: Simple Type Theory ` a la Curry: assigning types to untyped terms, principal type algorithm 1 Overview of todays lecture Simple Type Theory ( ) ` a la Curry (versus ` a la Church)

449 views • 29 slides