Tag: INRIA Rocquencourt
-
Discussing “A very modal model of a modern, major, general type system”
This paper is an influential landmark in the development of what is now usually called guarded recursion, following a trail that roughly goes from Nakano’s introduction of the approximation modality, to this paper, to a Dreyer, Ahmed, and Birkedal paper that I haven’t yet read for this blog but will probably eventually get to, to…
Categories
Recent Posts
- Discussing “Sheaves in Geometry and Logic”
- Discussing “Extended Curry-Howard Correspondence for a Basic Constructive Modal Logic”
- Discussing “Basic Proof Theory”
- A Blog Update for 2025
Tags
1994 1996 2000 2001 2014 2019 2020 2021 2023 Abhishek Anand Cambridge Tracts in Theoretical Computer Science Carnegie Mellon University City University of New York Coq Cubical Type Theory Cyril Cohen Eike Ritter Fabian Kunze intuitionistic logic intuitionistic modal logic Jonathan Sterling Journal of Automated Reasoning LICS LORIA Matthieu Sozeau Melvin Fitting Metaprogramming modal logic nested sequent calculus Nicolas Tabareau Notre Dame Journal of Formal Logic Proof theory Rocq 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 Yde Venema