Danvy, Olivier; Zerny, Ian Three syntactic theories for combinatory graph reduction. (English) Zbl 1353.68040 ACM Trans. Comput. Log. 14, No. 4, Article No. 29, 27 p. (2013). MSC: 68N18 Functional programming and lambda calculus 03B40 Combinatory logic and lambda calculus 05C90 Applications of graph theory Keywords:CPS transformation; continuation-passing style (CPS); reduction-based normalization; abstract machines; continuations; defunctionalization; evaluation contexts; reduction contexts; reduction semantics; reduction-free normalization; refocusing; refunctionalization PDFBibTeX XMLCite \textit{O. Danvy} and \textit{I. Zerny}, ACM Trans. Comput. Log. 14, No. 4, Article No. 29, 27 p. (2013; Zbl 1353.68040) Full Text: DOI