Tag: Carnegie Mellon University
-
Discussing “First Steps in Synthetic Tait Computability: The Objective Metatheory of Cubical Type Theory”
I’ve been meaning to get more familiar with this dissertation for a while (reading it thoroughly would take longer than the week I try to take for my blog posts), after its ideas were used in a paper I discussed last year. This thesis presents a new technique, synthetic Tait computability, for proving the ‘syntactic’…
-
Discussing “A Mechanization of the Blakers–Massey Connectivity Theorem in Homotopy Type Theory”
I first became aware of this paper from a long and fascinating blog comment thread in which mathematicians argued about the utility, or lack thereof, of homotopy type theory for homotopy theorists. Urs Schreiber, arguing for team HoTT, held up this paper an exemplar of the value of the type theoretical approach, saying “it was…
Categories
Recent Posts
- Discussing “BI as an Assertion Language for Mutable Data Structures”
- Discussing “Sheaves in Geometry and Logic”
- Discussing “Extended Curry-Howard Correspondence for a Basic Constructive Modal Logic”
- Discussing “Basic Proof Theory”
Tags
1994 1996 2000 2001 2014 2019 2020 2021 2023 Bedrock Systems Cambridge Tracts in Theoretical Computer Science Carnegie Mellon University City University of New York Coq Cubical Type Theory Cyril Cohen Côte d'Azur University Fabian Kunze Gregory Malecha Inria Nantes intuitionistic logic intuitionistic modal logic Jonathan Sterling LICS Melvin Fitting Metaprogramming modal logic nested sequent calculus Nicolas Tabareau Notre Dame Journal of Formal Logic POPL Proof theory Rocq Saarland University sequent calculus Simon Boulier Théo Winterhalter types type theory University of Amsterdam University of Birmingham University of Cambridge University of Oxford Valeria de Paiva Yannick Forster