Three Syntactic Theories for Combinatory Graph Reduction

Article, Contribution for newspaper or weekly magazine English RESTRICTED
Danvy, Olivier; Zerny, Ian;
(2011)

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