Tag: Gavin Bierman
-
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 “BI as an Assertion Language for Mutable Data Structures”
- Discussing “Sheaves in Geometry and Logic”
- Discussing “Extended Curry-Howard Correspondence for a Basic Constructive Modal Logic”
- Discussing “Basic Proof Theory”
Tags
1994 1996 2000 2001 2014 2019 2020 2021 2023 Bedrock Systems Cambridge Tracts in Theoretical Computer Science Carnegie Mellon University City University of New York Coq Cubical Type Theory Cyril Cohen Côte d'Azur University Fabian Kunze Gregory Malecha Inria Nantes intuitionistic logic intuitionistic modal logic Jonathan Sterling LICS Melvin Fitting Metaprogramming modal logic nested sequent calculus Nicolas Tabareau Notre Dame Journal of Formal Logic POPL Proof theory Rocq Saarland University 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