2008.10.20 |
| Date | Wed Nov 05 |
| Time | 09:30 — 11:00 |
| Location | DI-Turing-014 |
Title: Towards compatible and interderivable semantic specifications for the
Scheme programming language, part II: reduction semantics and abstract
machines
Speaker: Olivier Danvy
Abstract:
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 mechanicallycorresponds 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.
Presented at the 2008 Workshop on Scheme and Functional Programming,
Victoria, BC, September 2008.
Joint work with Malgorzata Biernacka.