On the semantics of static exception handling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1999

On the semantics of static exception handling

Abstract

We study an idealized programming language (lambda-exn) that features a static variant of ML-like exception handling. We present three different kinds of semantics: an operational semantics, based on a quasi term-rewriting system that specifies a completely deterministic evaluation strategy; a reduction semantics, based on lambda-calculus-like reduction relations that satisfy the Church-Rosser property; a denotational semantics, based on call-by-value continuation passing. We prove that these three semantics coincide on programs.
No file

Dates and versions

inria-00098946 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00098946 , version 1

Cite

Philippe de Groote, Catherine Pilière. On the semantics of static exception handling. [Intern report] 99-R-418 || de_groote99a, 1999, 15 p. ⟨inria-00098946⟩
101 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More