Functional big-step semantics
Paper i proceeding, 2016

When doing an interactive proof about a piece of software, it is important that the underlying programming language’s semantics does not make the proof unnecessarily difficult or unwieldy. Both smallstep and big-step semantics are commonly used, and the latter is typically given by an inductively defined relation. In this paper, we consider an alternative: using a recursive function akin to an interpreter for the language. The advantages include a better induction theorem, less duplication, accessibility to ordinary functional programmers, and the ease of doing symbolic simulation in proofs via rewriting. We believe that this style of semantics is well suited for compiler verification, including proofs of divergence preservation. We do not claim the invention of this style of semantics: our contribution here is to clarify its value, and to explain how it supports several language features that might appear to require a relational or small-step approach. We illustrate the technique on a simple imperative language with C-like for-loops and a break statement, and compare it to a variety of other approaches. We also provide ML and lambda-calculus based examples to illustrate its generality.

Författare

S. Owens

University Of Kent

Magnus Myreen

Chalmers, Data- och informationsteknik, Programvaruteknik

R. Kumar

CSIRO Data61

Yong Kiam Tan

Agency for Science, Technology and Research, Singapore

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 9632 589-615

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1007/978-3-662-49498-1_23

ISBN

9783662494974

Mer information

Senast uppdaterat

2018-02-28