A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines

Authors

  • Malgorzata Biernacka
  • Olivier Danvy

DOI:

https://doi.org/10.7146/brics.v13i18.22176

Abstract

We present a systematic construction of environment-based abstract machines from context-sensitive calculi of explicit substitutions, and we illustrate it with ten calculi and machines for applicative order with an abort operation, normal order with generalized reduction and call/cc, the lambda-mu-calculus, delimited continuations, i/o, stack inspection, proper tail-recursion, and lazy evaluation. Most of the machines already exist but they have been obtained independently and are only indirectly related to the corresponding calculi. All of the calculi are new and they make it possible to directly reason about the execution of the corresponding machines.

Published

2006-12-18

How to Cite

Biernacka, M., & Danvy, O. (2006). A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines. BRICS Report Series, 13(18). https://doi.org/10.7146/brics.v13i18.22176