The Type Theory of Lean [Thesis]

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Mario Carneiro
Year: 2019

Language: English

Introduction
Type theory in programming languages
Set theoretic models of type theory
The axioms
Typing
Definitional equality
Reduction
let binders ( reduction)
Definitions ( reduction)
Inductive types
Inductive specifications
Large elimination
The recursor
The computation rule ( reduction)
Non-primitive axioms
Quotient types
Propositional extensionality
Axiom of choice
Differences from Coq
Properties of the type system
Undecidability of definitional equality
Algorithmic equality is not transitive
Failure of subject reduction
Regularity
Unique typing
The reduction
The Church-Rosser theorem
Reduction of inductive types to W-types
The menagerie
Translating type families
Translating subsingleton eliminators
The remainder
Soundness
Proof splitting
Modeling Lean in ZFC
Definition of W-types in ZFC
Definition of acc in ZFC
Soundness
Type injectivity