On the semantics of static exception handling

Philippe de Groote 1 Catherine Pilière 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00098946
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:40:39 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • HAL Id : inria-00098946, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

139