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 “Proof Analysis in Modal Logic”
 Discussing “An algebraic and Kripkestyle approach to a certain extension of intuitionistic logic”
 Discussing “A very modal model of a modern, major, general type system”
 Discussing “The MetaCoq Project”
Tags
2000 2001 2007 2014 2019 2020 2021 2023 Anupam Das Cambridge Tracts in Theoretical Computer Science Carnegie Mellon University Christopher D. Richards City University of New York Coq Cubical Type Theory Guarded recursion Hiroshi Nakano INRIA Rocquencourt intuitionistic logic intuitionistic modal logic Jonathan Sterling LICS LORIA Maarten de Rijke Melvin Fitting Metaprogramming modal logic nested sequent calculus Notre Dame Journal of Formal Logic Patrick Blackburn POPL Princeton University Rocq Ryukoku University sequent calculus Sonia Marin TABLEAUX types type theory University of Amsterdam University of Birmingham University of Cambridge University of Oxford Université Paris 7 Yde Venema