A Syntactic and Functional Correspondence between Reduction Semantics and Reduction-Free Full Normalisers ∗

@inproceedings{GarcaPrez2012ASA,
  title={A Syntactic and Functional Correspondence between Reduction Semantics and Reduction-Free Full Normalisers ∗},
  author={{\'A}lvaro Garcı́a-P{\'e}rez},
  year={2012}
}
  • Álvaro Garcı́a-Pérez
  • Published 2012
Olivier Danvy and others have shown the syntactic correspondence between reduction semantics (a small-step semantics) and abstract machines, as well as the functional correspondence between reduction-free normalisers (a big-step semantics) and abstract machines. The correspondences are established by program transformation (so-called interderivation) techniques. A reduction semantics and a reduction-free normaliser are interderivable when the abstract machine obtained from them is the same… CONTINUE READING