Skip to content
0:00 / 0:00

#homotopytypetheory#typetheory#dependenttypes

Peter LeFanu Lumsdaine, What are we thinking when we present a type theory?

HoTTEST

2.8K subscribers • 2 videos on Hallway

YouTube
  • Recommended by 1 person: 1 in engineering communities.
  • Presented by Peter LeFanu Lumsdaine

Advanced. Deep dive for people who know the field.

1.4K views6 years ago1 recommendation

Computer scienceProgramming languagesComputation and complexityLanguage design and type systems

Peter LeFanu Lumsdaine explores the implicit principles and formal structures behind how we present and understand dependent type theories.

Homotopy Type Theory Electronic Seminar Talks, 2020-06-15 uwo.ca/math/faculty/kapulkin/seminars/hottest_conference_202… Presentations of dependent type theories, as traditionally written, are deceptively simple: a collection of rules specifying an inductively defined derivability relation on judgments (or some variation on such a setup). However, in writing these rules, we usually follow various guiding principles — or at least, we have these principles in mind, and depart from them only with good cause and extra care. Some of these principles are (sometimes) explicitly stated: “all rules hold over an arbitrary ambient context”, for instance. Other principles almost always remain implicit — “the rules are ordered, and each rule may make use of earlier-introduced constructions, but not later ones” — but become apparent through our reliance on them in later definitions and proofs. I will present a careful analysis of these implicit principles, and how they contribute to the well-behavedness properties we expect our type theories to enjoy. (Based on joint work with Andrej Bauer and Philipp Haselwarter, forthcoming since 2016.)

Why it's here

1 person recommends this

u/mttdin r/ProgrammingLanguages • Recommends

What are we thinking when we present a type theory? - Peter LeFanu Lumsdaine