Pretty-Big-Step Semantics - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Pretty-Big-Step Semantics

(1, 2)
1
2

Abstract

In spite of the popularity of small-step semantics, big-step semantics remain used by many researchers. However, big-step semantics suffer from a serious duplication problem, which appears as soon as the semantics account for exceptions and/or divergence. In particular, many premises need to be copy-pasted across several evaluation rules. This duplication problem, which is particularly visible when scaling up to full-blown languages, results in formal definitions growing far bigger than necessary. Moreover, it leads to unsatisfactory redundancy in proofs. In this paper, we address the problem by introducing pretty-big-step semantics. Pretty-big-step semantics preserve the spirit of big-step semantics, in the sense that terms are directly related to their results, but they eliminate the duplication associated with big-step semantics.
Fichier principal
Vignette du fichier
prettybigstep.pdf (464.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00798227 , version 1 (08-03-2013)

Identifiers

  • HAL Id : hal-00798227 , version 1

Cite

Arthur Charguéraud. Pretty-Big-Step Semantics. 22nd European Symposium on Programming (ESOP), Mar 2013, Rome, Italy. ⟨hal-00798227⟩
192 View
254 Download

Share

Gmail Facebook Twitter LinkedIn More