iRho: An Imperative Rewriting-calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Structures in Computer Science Year : 2008

iRho: An Imperative Rewriting-calculus


We propose an imperative version of the Rewriting-calculus, a calculus based on pattern-matching, pattern-abstraction, and side-effects, which we call iRho. We formulate a static and a big-step call-by-value operational semantics of iRho. The operational semantics is deterministic, and immediately suggests how to build an interpreter for the calculus. The static semantics is given via a first-order type system based on a form of product-types, which can be assigned to terms-like structures (i.e., records). The calculus is a la Church, i.e., pattern-abstractions are decorated with the types of the free variables of the pattern. iRho is a good candidate for a core of a pattern-matching imperative language, where a (monomorphic) typed store can be safely manipulated and where fixed-points are built-in into the language itself. Properties such as determinism of the interpreter and subject-reduction are completely checked by a machine-assisted approach, using the Coq proof assistant. Progress and decidability of type-checking are proved by pen and paper.
Fichier principal
Vignette du fichier
2008-mscs-08.pdf (405.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01147678 , version 1 (30-04-2015)



Luigi Liquori, Bernard P. Serpette. iRho: An Imperative Rewriting-calculus. Mathematical Structures in Computer Science, 2008, 18 (03), pp.467-500. ⟨10.1017/S0960129508006750⟩. ⟨hal-01147678⟩


130 View
194 Download



Gmail Facebook X LinkedIn More