iRho: An Imperative Rewriting Calculus [Extended Abstract] - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

iRho: An Imperative Rewriting Calculus [Extended Abstract]


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 call-by-value dynamic semantics of iRho like that of Gilles Kahn's Natural Semantics. 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-type, which can be assigned to iRho-terms like structures (i.e. pairs). 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 or an intermediate language, because it can safely access and modify a (monomorphic) typed store, and because fixed-points can be defined. Properties like 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
2004-ppdp-04.pdf (388.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01149659 , version 1 (07-05-2015)



Luigi Liquori, Bernard P. Serpette. iRho: An Imperative Rewriting Calculus [Extended Abstract]. Proceedings of the 6th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP), Aug 2004, Verona, Italy. pp.167-178, ⟨10.1145/1013963.1013983⟩. ⟨hal-01149659⟩
239 View
98 Download



Gmail Facebook Twitter LinkedIn More