Decorated proofs for computational effects: Exceptions

Abstract : We define a proof system for exceptions which is close to the syntax for exceptions, in the sense that the exceptions do not appear explicitly in the type of any expression. This proof system is sound with respect to the intended denotational semantics of exceptions. With this inference system we prove several properties of exceptions.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00678738
Contributor : Dominique Duval <>
Submitted on : Tuesday, March 13, 2012 - 4:52:28 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM
Long-term archiving on : Thursday, June 14, 2012 - 5:55:48 PM

Files

DDFR-proofs-exceptions.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00678738, version 1
  • ARXIV : 1203.2900

Collections

Citation

Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud. Decorated proofs for computational effects: Exceptions. 2012. ⟨hal-00678738⟩

Share

Metrics

Record views

365

Files downloads

70