Tag: 1998
-
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…
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