Adjunctions for exceptions

Abstract : An algebraic method is used to study the semantics of exceptions in computer languages. The exceptions form a computational effect, in the sense that there is an apparent mismatch between the syntax of exceptions and their intended semantics. We solve this apparent contradiction by efining a logic for exceptions with a proof system which is close to their syntax and where their intended semantics can be seen as a model. This requires a robust framework for logics and their morphisms, which is provided by categorical tools relying on adjunctions, fractions and limit sketches.
Complete list of metadatas
Contributor : Dominique Duval <>
Submitted on : Thursday, July 5, 2012 - 2:13:52 PM
Last modification on : Monday, April 8, 2019 - 1:28:02 PM
Long-term archiving on : Saturday, October 6, 2012 - 2:40:45 AM


Files produced by the author(s)


  • HAL Id : hal-00714710, version 1
  • ARXIV : 1207.1255


Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud. Adjunctions for exceptions. 2012. ⟨hal-00714710v1⟩



Record views


Files downloads