Tag: 2023

Discussing “On Intuitionistic Diamonds (and Lack Thereof)”
I choose papers for this blog by looking at the most cited papers in my Google Scholar recommendations of recent papers. This week, my algorithm has read my mind by recommending a fairly new paper that was already at the top of my list of papers to read. Its topic, as with a few papers…

Discussing “Isabelle/HOL: A Proof Assistant for HigherOrder Logic”
In the world of interactive theorem provers two systems stand out for their maturity and wide adoption. One is Rocq, until recently known as Coq, about which I have written previously; Isabelle/HOL, the topic of this week’s reading, is the other. Rocq is one of a number of systems (for example, Lean) based on MartinLöf’s…
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