Three Syntactic Theories for Combinatory Graph Reduction

Article, Contribution for newspaper or weekly magazine English RESTRICTED
Danvy, Olivier; Zerny, Ian; (2013)
  • Journal: volume 14,pages1-20issn: 1529-3785
  • Related identifiers: doi: 10.1007/978-3-642-20551-4_1, doi: 10.1145/2528932
  • Subject: abstract machines | refunctionalization | evaluation contexts | CPS transformation | continuations | reduction semantics | reduction-free normalization | reduction context | reduction-based normalization | continuation-passing style (CPS | refocusing | defunctionalization

We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where<br/>graph vertices are represented with evaluation contexts and let expressions. We express this rst syntactic<br/>theory as a storeless reduction semantics of combi... View more
Share - Bookmark