Małgorzata Biernacka, Olivier Danvy
| We present a context-sensitive reduction semantics for a lambda-calculus with explicit substitutions and store and we show that the functional implementation of this small-step semantics mechanically corresponds to an abstract machine. This abstract machine is very close to the abstract machine for Core Scheme presented by Clinger at PLDI'98. This lambda-calculus with explicit substitutions and store therefore aptly accounts for Core Scheme. |
Last updated 23 July 2008.