a parametric cps to sprinkle cic with classical reasoning
play

A Parametric CPS to Sprinkle CIC with Classical Reasoning - PowerPoint PPT Presentation

Oct 28, 2022 •281 likes •1.1k views

. . . . . . . . . . . . . . A Parametric CPS to Sprinkle CIC with Classical Reasoning Pierre-Marie Pdrot University of Ljubljana LOLA 2017 19th June 2017 Pdrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . .

  1. . . . . . . . . . . . . . . A Parametric CPS to Sprinkle CIC with Classical Reasoning Pierre-Marie Pédrot University of Ljubljana LOLA 2017 19th June 2017 Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . 1 / 33

  2. . . . . . . . . . . . . CIC, I’m loving it . Dependent Type Theory is awesome! The pinacle of the Curry-Howard correspondence: You can program with it “A pure functional programming with crazily precise types.” You can prove with it “A incredibly rich constructive logic with built-in computation.” Everything at the same time! “Prove your programs! Program your proofs!” Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 / 33

  3. . . . . . . . . . . . . CIC, I’m loving it . Dependent Type Theory is awesome! The pinacle of the Curry-Howard correspondence: You can program with it “A pure functional programming with crazily precise types.” You can prove with it “A incredibly rich constructive logic with built-in computation.” Everything at the same time! “Prove your programs! Program your proofs!” Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 / 33

  4. . . . . . . . . . . . . CIC, I’m loving it . Dependent Type Theory is awesome! The pinacle of the Curry-Howard correspondence: You can program with it “A pure functional programming with crazily precise types.” You can prove with it “A incredibly rich constructive logic with built-in computation.” Everything at the same time! “Prove your programs! Program your proofs!” Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 / 33

  5. . . . . . . . . . . . . . . . An efgective object That’s just not theoretical ramble. Lots of actual, serious, big developments. CompCert, VST, RustBelt... Four Colour Theorem, Feit-Thompson... Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . 3 / 33

  6. . . . . . . . . . . . . . . . An efgective object That’s just not theoretical ramble. Lots of actual, serious, big developments. CompCert, VST, RustBelt... Four Colour Theorem, Feit-Thompson... Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . 3 / 33

  7. . . . . . . . . . . . . A Classical Problem . In practice, many people reason in the dreaded classical logic. Both a theoretical and practical limitation! CIC is deadcore intuitionistic Requires that you write your statements in the right way Most non-logicians don’t care about this fuss (both CS and math...) It would be nice to have a type theory... Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 / 33 em : Π( A : □ ) . A ∨ ¬ A

  8. . . . . . . . . . . . . A Classical Problem . In practice, many people reason in the dreaded classical logic. Both a theoretical and practical limitation! CIC is deadcore intuitionistic Requires that you write your statements in the right way Most non-logicians don’t care about this fuss (both CS and math...) It would be nice to have a type theory... Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 / 33 em : Π( A : □ ) . A ∨ ¬ A

  9. . . . . . . . . . . . . . . A Classical Problem In practice, many people reason in the dreaded classical logic. Both a theoretical and practical limitation! CIC is deadcore intuitionistic Requires that you write your statements in the right way Most non-logicians don’t care about this fuss (both CS and math...) Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . 4 / 33 em : Π( A : □ ) . A ∨ ¬ A It would be nice to have a classical type theory...

  10. Classical logic is incompatible with univalence! (Your mileage may vary.) . forall A . . . . . . . . Attempt 1: The Truth is Out There There is a very simple straightforward solution. Axiom classical Type . A A Pro: Simple, local, works in Coq, be my guest. Cons: Axioms are dangerous, you have to show consistency externally Classical logic holds in the well-known Set model, blah-blah... Non-trivial interactions: e.g. classical CIC implies proof-irrelevance. The logic does not compute anymore, axioms block reduction... Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 / 33

  11. Classical logic is incompatible with univalence! (Your mileage may vary.) . . . . . . . . . . . . Attempt 1: The Truth is Out There . There is a very simple straightforward solution. Pro: Simple, local, works in Coq, be my guest. Cons: Axioms are dangerous, you have to show consistency externally Classical logic holds in the well-known Set model, blah-blah... Non-trivial interactions: e.g. classical CIC implies proof-irrelevance. The logic does not compute anymore, axioms block reduction... Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 / 33 Axiom classical : forall ( A : Type ) , A ∨ ¬ A .

  12. . . . . . . . . . . . . Attempt 1: The Truth is Out There . There is a very simple straightforward solution. Pro: Simple, local, works in Coq, be my guest. Cons: Axioms are dangerous, you have to show consistency externally Classical logic holds in the well-known Set model, blah-blah... Non-trivial interactions: e.g. classical CIC implies proof-irrelevance. The logic does not compute anymore, axioms block reduction... Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 / 33 Axiom classical : forall ( A : Type ) , A ∨ ¬ A . Classical logic is incompatible with univalence! (Your mileage may vary.)

  13. . . . . . . . . . . . . . . Since Griffjn, it’s folklore that control operators implement classical logic. Essentially allows to reify context evaluation. E callcc M callcc k E M E k The type of callcc is Peirce’s law, the minimal logic equivalement of EM. Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . . . 6 / 33 Attempt 2: CIC and call / cc are in a boat callcc : (( A → B ) → A ) → A

  14. . . . . . . . . . . . . . . . . Since Griffjn, it’s folklore that control operators implement classical logic. Essentially allows to reify context evaluation. The type of callcc is Peirce’s law, the minimal logic equivalement of EM. Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . . . . . . . . . 6 / 33 Attempt 2: CIC and call / cc are in a boat callcc : (( A → B ) → A ) → A E [ callcc M ] ≡ β callcc ( λ k . E [ M ( E ◦ k )])

  15. . Pro: Computational by construction. . . . . . . . . . . Cons: . Needs a whole new proof assistant implementation. Reminder: Coq is a 33-year old project. Changes the global meaning of logical connectives. What does x A B means? ... and it changes it so much that it also proves False !!! Pro: At least my proofs are going to be easier. Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . . . 7 / 33 . . . . . . . . . . . . Attempt 2: CIC and call / cc are in a boat “Just” throw call / cc into CIC!

  16. . . . . . . . . . . . . . . Pro: Computational by construction. Cons: Needs a whole new proof assistant implementation. Reminder: Coq is a 33-year old project. Changes the global meaning of logical connectives. ... and it changes it so much that it also proves False !!! Pro: At least my proofs are going to be easier. Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . 7 / 33 . . . . . . . . . . . . Attempt 2: CIC and call / cc are in a boat “Just” throw call / cc into CIC! What does Σ x : A . B means?

  17. . . . . . . . . . . . . . . Pro: Computational by construction. Cons: Needs a whole new proof assistant implementation. Reminder: Coq is a 33-year old project. Changes the global meaning of logical connectives. ... and it changes it so much that it also proves False !!! Pro: At least my proofs are going to be easier. Pédrot (U. Ljubljana) A Parametric CPS 19/06/2017 . . . . . . . . . . . . . . 7 / 33 . . . . . . . . . . . . Attempt 2: CIC and call / cc are in a boat “Just” throw call / cc into CIC! What does Σ x : A . B means?

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Conclusions from classical parametric integer programming for stochastic optimization Matthias

Conclusions from classical parametric integer programming for stochastic optimization Matthias

Conclusions from classical parametric integer programming for stochastic optimization Matthias Claus University of Duisburg-Essen January 4, 2016 M. Claus Conclusions from classical parametric integer programming January 4, 2016 1 / 17 From

1.03k views • 66 slides
Table of Contents I Probabilistic Reasoning Classical Probabilistic Models Basic Probabilistic

Table of Contents I Probabilistic Reasoning Classical Probabilistic Models Basic Probabilistic

Table of Contents I Probabilistic Reasoning Classical Probabilistic Models Basic Probabilistic Reasoning: The Jungle Story Multiple Random Selection Rules: Dice New Constructs Causal Probability Observations and Intentions Dynamic Range

1.08k views • 73 slides
Classical BI (A logic for reasoning about dualising resources) James Brotherston Cristiano

Classical BI (A logic for reasoning about dualising resources) James Brotherston Cristiano

Classical BI (A logic for reasoning about dualising resources) James Brotherston Cristiano Calcagno Imperial College London Me POPL, Savannah, Georgia 23 Jan 2009 Boolean BI (OHearn and Pym 99) A substructural logic with

688 views • 12 slides
Classical BI (A logic for reasoning about dualising resource) James Brotherston Cristiano

Classical BI (A logic for reasoning about dualising resource) James Brotherston Cristiano

Classical BI (A logic for reasoning about dualising resource) James Brotherston Cristiano Calcagno Imperial College, London Me British Logic Colloquium Nottingham, 4 Sept 2008 The logic of bunched implications (OHearn and Pym

686 views • 14 slides
Inconsistency-Tolerant Reasoning with Classical Logic and Large Databases Jui-Yi Kao Stanford

Inconsistency-Tolerant Reasoning with Classical Logic and Large Databases Jui-Yi Kao Stanford

Inconsistency-Tolerant Reasoning with Classical Logic and Large Databases Jui-Yi Kao Stanford University Presenting on joint work with: Timothy L. Hinrichs University of Chicago Michael Genesereth Stanford University Jui-Yi Kao Stanford

671 views • 30 slides
MLSE Channel Estimation MLSE Channel Estimation MLSE Channel Estimation Parametric or Non-

MLSE Channel Estimation MLSE Channel Estimation MLSE Channel Estimation Parametric or Non-

MLSE Channel Estimation MLSE Channel Estimation MLSE Channel Estimation Parametric or Non- -Parametric? Parametric? Parametric or Non Parametric or Non-Parametric? Optical Fiber Communication Conference 2008 Parametric versus Non-Parametric

475 views • 12 slides
Classical BI (A logic for reasoning about dualising resources) James Brotherston Cristiano

Classical BI (A logic for reasoning about dualising resources) James Brotherston Cristiano

Classical BI (A logic for reasoning about dualising resources) James Brotherston Cristiano Calcagno Imperial College London Me Logic seminar Imperial College London, 13 Nov 2008 BI : the logic of bunched implications (OHearn and Pym

492 views • 26 slides
Semi-parametric and response setup non-parametric approaches to Parametric models

Semi-parametric and response setup non-parametric approaches to Parametric models

Christian Ritz Concentration- Semi-parametric and response setup non-parametric approaches to Parametric models concentration-response modelling Non- parametric approach Semi- parametric Christian Ritz models Results University of

492 views • 23 slides
M odels for Inexact Reasoning Fuzzy Logic Lesson 6 Inference from Conditional Fuzzy

M odels for Inexact Reasoning Fuzzy Logic Lesson 6 Inference from Conditional Fuzzy

M odels for Inexact Reasoning Fuzzy Logic Lesson 6 Inference from Conditional Fuzzy Propositions M aster in Computational Logic Department of Artificial Intelligence Inference in Classical Logic Inference rules in classical logic are

639 views • 14 slides
Optical Parametric Generation and Amplification 1 Optical Parametric Generation Sum frequency

Optical Parametric Generation and Amplification 1 Optical Parametric Generation Sum frequency

Optical Parametric Generation and Amplification 1 Optical Parametric Generation Sum frequency generation: Parametric generation: Phase matching condition for collinear beams: By J S Lundeen at English Wikipedia - Own work by the original

198 views • 6 slides
From Reasoning with Constraints to Mining Constraints: Multi-Objective Parameter Fitting in

From Reasoning with Constraints to Mining Constraints: Multi-Objective Parameter Fitting in

From Reasoning with Constraints to Mining Constraints: Multi-Objective Parameter Fitting in Parametric Probabilistic Hybrid Automata Martin Frnzle 1 joint work (in progress) with Alessandro Abate (Oxford University, UK), Sebastian Gerwinn

709 views • 55 slides
CHAPTER-4 1 LOGIC AND REASONING ! Knowledge and ! Reasoning in Knowledge- Reasoning Based

CHAPTER-4 1 LOGIC AND REASONING ! Knowledge and ! Reasoning in Knowledge- Reasoning Based

CHAPTER-4 1 LOGIC AND REASONING ! Knowledge and ! Reasoning in Knowledge- Reasoning Based Systems ! syntax and semantics ! shallow and deep reasoning ! validity and satisfiability ! forward and backward ! logic languages chaining ! alternative

616 views • 23 slides
CMSC427 Notes on piecewise parametric curves: Hermite, Catmull-Rom, and Bezier I. Parametric

CMSC427 Notes on piecewise parametric curves: Hermite, Catmull-Rom, and Bezier I. Parametric

CMSC427 Notes on piecewise parametric curves: Hermite, Catmull-Rom, and Bezier I. Parametric curves and surfaces Model shapes and behavior with parametric curves Have done lines, circles, cylinders, superellipses, and others But limitations

390 views • 7 slides
OPA in our lab: TOPAS C 1 Optical Parametric Generation Sum frequency generation: Parametric

OPA in our lab: TOPAS C 1 Optical Parametric Generation Sum frequency generation: Parametric

OPA in our lab: TOPAS C 1 Optical Parametric Generation Sum frequency generation: Parametric generation: Phase matching condition for collinear beams: By J S Lundeen at English Wikipedia - Own work by the original uploader, CC BY-SA 3.0,

538 views • 8 slides
Non parametric prediction and mapping of standing Non-parametric prediction and mapping of

Non parametric prediction and mapping of standing Non-parametric prediction and mapping of

Non parametric prediction and mapping of standing Non-parametric prediction and mapping of standing timber volume and biomass in a temperate forest Workshop IBS-Dre AGs Bayes Methodik, Rumliche Statistik, kologie und Umwelt Lbeck, Dez.

348 views • 23 slides
Imputing missing values in satellite data: From parametric to non-parametric approaches

Imputing missing values in satellite data: From parametric to non-parametric approaches

Imputing missing values in satellite data: From parametric to non-parametric approaches @ReinhardFurrer, I-Math/ICS, UZH NZZ.ch GI-Forum, ifgi, WWU M unster, 2018/11/13 Joint work Florian Gerber Emilio Porcu Francois Bachoc and

557 views • 44 slides
On Diophantine Complexity and Statistical Zero-Knowledge Arguments Helger Lipmaa Helsinki

On Diophantine Complexity and Statistical Zero-Knowledge Arguments Helger Lipmaa Helsinki

On Diophantine Complexity and Statistical Zero-Knowledge Arguments Helger Lipmaa Helsinki University of Technology http://www.tcs.hut.fi/helger Pedase Theory Day, 04.10.2003 On Diophantine Complexity and SZK Arguments, Helger Lipmaa 1

501 views • 24 slides
An allocator What are objects? What are values? [311] An Allocator is a handle to a

An allocator What are objects? What are values? [311] An Allocator is a handle to a

Outline An allocator What are objects? What are values? [311] An Allocator is a handle to a MemoryResource [1219] is a handle to a heap An Allocator is a copy-only type [2023] An Allocator belongs to a

260 views • 11 slides
Challenges to Cartesian materialism: Understanding consciousness, naturalism and the mind-world

Challenges to Cartesian materialism: Understanding consciousness, naturalism and the mind-world

1 Challenges to Cartesian materialism: Understanding consciousness, naturalism and the mind-world relation Jonathan Knowles http://www.academia.edu/2651043/Challenging_Cartesian_Materialism_Under

399 views • 25 slides
Experimental results on quark-gluon correlations Anselm Vossen Thanks for helpful discussions

Experimental results on quark-gluon correlations Anselm Vossen Thanks for helpful discussions

GHP Meeting, Denver 2019 Experimental results on quark-gluon correlations Anselm Vossen Thanks for helpful discussions and slides to Research supported by the Daniel Pitonyak Andreas Metz Chris Dilks Outline Motivation:

720 views • 57 slides
End-to-End Previously on CS5229 , Not everyone uses TCP Congestion Control TCP Congestion

End-to-End Previously on CS5229 , Not everyone uses TCP Congestion Control TCP Congestion

End-to-End Previously on CS5229 , Not everyone uses TCP Congestion Control TCP Congestion Control UDP: Why not congestion controlled? Media streaming 1. UDP has low delay, no Gaming need full reliability VoIP

280 views • 12 slides
Critical look at Estonian E-voting protocol Helger Lipmaa and Sven Heiberg Tallinn University and

Critical look at Estonian E-voting protocol Helger Lipmaa and Sven Heiberg Tallinn University and

Critical look at Estonian E-voting protocol Helger Lipmaa and Sven Heiberg Tallinn University and Cybernetica AS Estonia Outline Personal perspective (highly opinionated) Cultural background Birth pains of Estonian e-voting from our

560 views • 29 slides
A middleware for parallel processing of large graphs Tiago Alves Macambira and Dorgival Olavo

A middleware for parallel processing of large graphs Tiago Alves Macambira and Dorgival Olavo

Outline Introduction The API Implementation Evaluation Conclusions A middleware for parallel processing of large graphs Tiago Alves Macambira and Dorgival Olavo Guedes Neto {tmacam,dorgival}@dcc.ufmg.br National Institute for Web Research

735 views • 34 slides
Transactions in India Nandkumar Saravade Friday, March 1, 13 1 Views expressed are personal

Transactions in India Nandkumar Saravade Friday, March 1, 13 1 Views expressed are personal

The People Problem in Security of Financial Transactions in India Nandkumar Saravade Friday, March 1, 13 1 Views expressed are personal and not necessarily of the employer organisation. Friday, March 1, 13 2 Changing Face of Banking

420 views • 23 slides

More recommend