Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Variable elimination for building interpreters

Abstract : In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (the language which is used to build the interpreter). In order to transform user-defined functions into host language functions we use combinatory logic : lambda-abstractions are transformed into a composition of combinators. We provide a mechanically checked proof that this step is correct for the call-by-value strategy with imperative features.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Julien Cohen <>
Submitted on : Friday, May 7, 2010 - 5:18:18 PM
Last modification on : Tuesday, June 30, 2020 - 11:56:07 AM
Long-term archiving on: : Thursday, December 1, 2016 - 12:24:53 AM



  • HAL Id : hal-00482002, version 1
  • ARXIV : 1005.1466


Julien Cohen, Jean-Louis Giavitto, Olivier Michel. Variable elimination for building interpreters. 2010. ⟨hal-00482002⟩



Record views


Files downloads