Decorated proofs for computational effects: Exceptions

Decorated proofs for computational effects: Exceptions

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 pr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Dumas, Jean-Guillaume, Duval, Dominique, Fousse, Laurent, Reynaud, Jean-Claude
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Logic in Computer Science
Mathematics - Category Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.48550/arxiv.1203.2900