Type Theory in Rosario Thorsten Altenkirch July 25, 2011 Thorsten - PowerPoint PPT Presentation

Mar 08, 2024 •397 likes •482 views

Type Theory in Rosario Thorsten Altenkirch July 25, 2011 Thorsten Altenkirch () Rosario July 25, 2011 1 / 7 Zermelo-Fraenkel Set Theory Zermelo (1871-1953) Fraenkel (1891-1965) Axiomatic Set Theory 1925 ZFC = Zermelo-Fraenkel with

Type Theory in Rosario Thorsten Altenkirch July 25, 2011 Thorsten Altenkirch () Rosario July 25, 2011 1 / 7
Zermelo-Fraenkel Set Theory Zermelo (1871-1953) Fraenkel (1891-1965) Axiomatic Set Theory ≈ 1925 ZFC = Zermelo-Fraenkel with Axiom of Choice Foundations of modern Mathematics Additional axioms, e.g. the continuum hypothesis Thorsten Altenkirch () Rosario July 25, 2011 2 / 7
Set Theory for Computer Science? Set Theory is untyped (everything is a set), while programming languages are typed (either statically or dynamically). Basic concepts from computer science (records, functions) are not primitive in Set Theory. Basic operations in set theory (e.g. ∩ , ∪ ) are not directly available on types. Set Theory is not constructive, i.e. there is a set theoretic function solving the Halting Problem. Question: Is there an alternative to Set Theory? Thorsten Altenkirch () Rosario July 25, 2011 3 / 7
Martin-Löf Type Theory Per Martin-Löf (1942-) Martin-Löf introduced Type Theory as a constructive foundation of Mathematics since 1972. Type Theory doesn’t rely on predicate logic but uses types to represent propositions. Basic operations on types are Π -types (dependent function types) and Σ -types (dependent records). Type Theory is a programming language. Thorsten Altenkirch () Rosario July 25, 2011 4 / 7
Propositions as types (The Curry-Howard Isomorphism) A proposition corresponds to the types of it proofs. A proposition is true if the corresponding type is non-empty. Conjunction A ∧ B is repesented by cartesian product ( A × B ). Implication A → B is represented by function types A → B (looks the same). ∀ and ∃ correspond to Π (depednent function) and Σ (dependent records). Thorsten Altenkirch () Rosario July 25, 2011 5 / 7
Agda Ulf Norell Ulf Norell has implemented Agda, a functional programming language based on Type Theory in his PhD in 2007. Agda is inspired by earlier systems such as Epigram, Cayenne and Coq. Agda can be used to program and to reason. Thorsten Altenkirch () Rosario July 25, 2011 6 / 7
Course contents Monday Agda intro, Programming with dependent types Tuesday Propositions as types Wednesday Mixing programming and reasoning Thursday Inductive relations, proof trees Friday Safe evaluation and typed assembly language Material, links, exercises: http://www.cs.nott.ac.uk/~txa/rosario/ Thorsten Altenkirch () Rosario July 25, 2011 7 / 7

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

An Invitation to Homotopy Type Theory Tingxiang Zou Type Theory Formal Systems: Churchs

An Invitation to Homotopy Type Theory Tingxiang Zou Type Theory Formal Systems: Churchs simply typed lambda calculus (1940); Martin L ofs dependent type theory (1971-1984) Origin: Russells theory of types The world is

848 views • 12 slides

Cubical Type Theory Goal: provide a computational justification for Homotopy Type Theory and

Cubical Type Theory: a constructive interpretation of the univalence axiom Anders M ortberg Inria Sophia-Antipolis TTT: Type Theory Based Tools January 15, 2017 - 1 / 39 Cubical Type Theory Goal: provide a computational justification for

743 views • 39 slides

Formalizing type theory in type theory using nominal techniques Ulrik Buchholtz TU Darmstadt

Formalizing type theory in type theory using nominal techniques Ulrik Buchholtz TU Darmstadt HoTT/UF Workshop, Oxford, September 9, 2017 Motivation 1 Preliminaries 2 Nominal sets and types 3 Formalizing type theory 4 Conclusion 5

831 views • 40 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

Formalising semantics of dependent type theory in dependent type theory (work in progress)

Formalising semantics of dependent type theory in dependent type theory (work in progress) Peter LeFanu Lumsdaine joint work with H akon Gylterud, Erik Palmgren DMV Hamburg, 25 September 2015 1 / 19 Modelling DTT Early models of

389 views • 19 slides

Introduction to AdS/CFT D-branes Type IIA string theory: Dp-branes p even (0,2,4,6,8) Type IIB

Introduction to AdS/CFT D-branes Type IIA string theory: Dp-branes p even (0,2,4,6,8) Type IIB string theory: Dp-branes p odd (1,3,5,7,9) 10D Type IIB two parallel D3-branes low-energy effective description: Higgsed N = 4 SUSY gauge theory Two

971 views • 51 slides

Lecture 3: Homotopical models of type theory Nicola Gambino School of Mathematics University of

Lecture 3: Homotopical models of type theory Nicola Gambino School of Mathematics University of Leeds Young Set Theory Copenhagen June 14th, 2016 1 What happened yesterday? Type theory the type theory T Extensional vs intensional

639 views • 28 slides

Homotopy and Directed Type Theory: a Sample Dan Doel October 24, 2011 Type Theory Overview

Homotopy and Directed Type Theory: a Sample Dan Doel October 24, 2011 Type Theory Overview Judgments ctx A type M : A Families , x : A B ( x ) type Inference 1 J 1 2 J 2 Type Theory Overview

415 views • 27 slides

Algebraic simple type theory A polynomial approach Nathanael Arkor & Marcelo Fiore

Algebraic simple type theory A polynomial approach Nathanael Arkor & Marcelo Fiore Department of Computer Science and Technology University of Cambridge Category Theory 2019 What is a type theory? What is a type theory? system of

1.29k views • 65 slides

Constructive Proofs and Program Extraction Christoph Kreitz 1. Type Theory vs. Set Theory 2.

Constructive Proofs and Program Extraction Christoph Kreitz 1. Type Theory vs. Set Theory 2. Overview of the Nuprl System 3. Proofs of the Integer Square Root Problem What distinguishes Type Theory from Set Theory? n r r 2 n

800 views • 42 slides

Universes and the limits of Martin-Lf type theory Michael Rathjen School of Mathematics

Universes and the limits of Martin-Lf type theory Michael Rathjen School of Mathematics University of Leeds Russell08 Proof Theory meets Type Theory Swansea, March 15, 2008 U NIVERSES AND THE LIMITS OF M ARTIN -L F TYPE THEORY U NIVERSES

837 views • 39 slides

CS 671 Automated Reasoning Extending Nuprls Type Theory 1. Design Decisions for Nuprls Type

CS 671 Automated Reasoning Extending Nuprls Type Theory 1. Design Decisions for Nuprls Type Theory 2. Product, Union, and List Types 3. The Curry-Howard Isomorphism, formally 4. Empty and Unit Types Design Decisions for Nuprls Type Theory

556 views • 8 slides

Set Theory in Type Theory Gert Smolka Saarland University Types 2015, Tallinn, May 19, 2015 1 /

Set Theory in Type Theory Gert Smolka Saarland University Types 2015, Tallinn, May 19, 2015 1 / 15 How would you teach set theory to students who are familiar with type theory and proof assistants? Classical set theory with

277 views • 15 slides

Programming in Homotopy Type Theory Dan Licata Institute for Advanced Study Joint work with

Programming in Homotopy Type Theory Dan Licata Institute for Advanced Study Joint work with Robert Harper 1 Dependent Type Theory 2 Dependent Type Theory Basis of proof assistants (Agda, Coq, NuPRL) Formalization of math Certified

1.75k views • 111 slides

Seifert-van Kampen Theorem in Homotopy Type Theory [ Toronto version ] Michael Shulman @ U of

Seifert-van Kampen Theorem in Homotopy Type Theory [ Toronto version ] Michael Shulman @ U of San Diego * Favonia @ CMU 1 Homotopy Type Theory * Type theory <-> topology - types ~= spaces - terms ~= points - functions ~= continuous

794 views • 43 slides

Two Set-based Implementations of Quotients in Type Theory Niccol` o Veltri Institute of

Two Set-based Implementations of Quotients in Type Theory Niccol` o Veltri Institute of Cybernetics, Tallinn Theory Days in Rogosi, 08 January 2015 Quotients in Intensional Type Theory (TT) In TT (a framework for constructive mathematics)

571 views • 19 slides

Constructive Aspects of Gelfand Duality Christopher Mulvey University of Sussex

Constructive Aspects of Gelfand Duality Christopher Mulvey University of Sussex www.maths.sussex.ac.uk/Staff/CJM c.j.mulvey@cantab.net Background In this talk, I will tell you something about Gelfand duality, seen through the eyes of the

459 views • 42 slides

Addition is exponentially harder than counting for shallow monotone circuits Igor Carboni

Addition is exponentially harder than counting for shallow monotone circuits Igor Carboni Oliveira Columbia University / Charles University in Prague Joint work with Xi Chen (Columbia) and Rocco Servedio (Columbia) 1 What is this talk about?

556 views • 38 slides

Infinite sets that satisfy the principle of omniscience in constructive type theory Mart n

Infinite sets that satisfy the principle of omniscience in constructive type theory Mart n H otzel Escard o University of Birmingham, UK Tallinn, 25 May 2017 Mathematics in dependent type theory 1. Ill work in intensional

710 views • 52 slides

Constructive Presheaf Models of Univalence Thierry Coquand Pittsburgh, 12 August 2019

Constructive Presheaf Models of Univalence Thierry Coquand Pittsburgh, 12 August 2019 Constructive Presheaf Models of Univalence Acknowledgments Parts are joint work with Steve Awodey and Emily Riehl Parts are also joint with Evan Cavallo and

469 views • 24 slides

Riemann-Liouville Fractional Calculus of Coalescence Hidden-variable Fractal Interpolation

Riemann-Liouville Fractional Calculus of Coalescence Hidden-variable Fractal Interpolation Functions Srijanani Anurag Prasad Department of Applied Sciences, The NorthCap University, Gurgaon 6 th Cornell Conference on Analysis, Probability, and

911 views • 31 slides

Mechanical Verification of a Constructive Proof for FLP according to Hagen V olzer Bisping

Mechanical Verification of a Constructive Proof for FLP according to Hagen V olzer Bisping Brodmann Jungnickel Rickmann St uber Wilhelm-Weidner Seidler Peters Nestmann 24 August 2016 Models and Theory of Distributed Systems

947 views • 47 slides

Computer Graphics Si Lu Fall 2017 http://web.cecs.pdx.edu/~lusi/CS447/CS447_547_Comp

Computer Graphics Si Lu Fall 2017 http://web.cecs.pdx.edu/~lusi/CS447/CS447_547_Comp uter_Graphics.htm 11/15/2017 Last time o Polygon Mesh and Modeling 2 Today o Modeling Technologies o Final Exam: 2:00-3:30, Novermber 29, 2017 3 Modeling

576 views • 44 slides

Transforming Objects Ray : R(t) = s + c t Objects : Sphere, box, cone etc. We assume the objects

Transforming Objects Ray : R(t) = s + c t Objects : Sphere, box, cone etc. We assume the objects to be normalized so that the ray-object intersection test is easier. e.g. Sphere is x 2 + y 2 + z 2 = 1 Now while instantiating the objects in our

304 views • 15 slides