Tag: University of Birmingham
-
Discussing “Extended Curry-Howard Correspondence for a Basic Constructive Modal Logic”
This is one of the classic papers – I’ve read, and cited, it a few times over the years myself – looking at extending the classic ‘Curry-Howard’ correspondence between lambda calculus and intuitionistic logic, to intuitionistic modal logic.
-
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 “Computational Types from a Logical Perspective”
This is a sequel to a paper by Moggi that I discussed some time ago. That paper discussed side effects, which are, roughly speaking, anything interesting that a program does other than map inputs deterministically to outputs, such as failure to terminate with a value, taking in user input, or producing output before the computation…
-
Discussing “Domain Theory”
Domains are certain forms of ordered sets used to address problems in the denotational semantics (mathematical interpretation) of programming languages. The area was invented by Dana Scott in a series of papers starting in 1969, building on earlier work by many others that used lattices. This book (which admittedly, I did not have time to…
Categories
Recent Posts
- Discussing “Extended Curry-Howard Correspondence for a Basic Constructive Modal Logic”
- Discussing “Basic Proof Theory”
- A Blog Update for 2025
- Discussing “Proof Analysis in Modal Logic”
Tags
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 Fabian Kunze intuitionistic logic intuitionistic modal logic Jonathan Sterling Journal of Automated Reasoning LICS LORIA Maarten de Rijke Matthieu Sozeau Melvin Fitting Metaprogramming modal logic nested sequent calculus Notre Dame Journal of Formal Logic Patrick Blackburn Princeton University Proof theory Rocq sequent calculus Simon Boulier TABLEAUX types type theory University of Amsterdam University of Birmingham University of Cambridge University of Oxford Valeria de Paiva Yannick Forster Yde Venema