Three syntactic theories for combinatory graph reduction

DOI10.1145/2528932zbMATH Open1353.68040OpenAlexW2073131294MaRDI QIDQ2946718

Ian Zerny, Olivier Danvy

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2528932

zbMATH Keywords

reduction semanticscontinuationsabstract machinesrefocusingdefunctionalizationrefunctionalizationcontinuation-passing style (CPS)CPS transformationevaluation contextsreduction contextsreduction-based normalizationreduction-free normalization

Mathematics Subject Classification ID

Applications of graph theory (05C90) Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Three Syntactic Theories for Combinatory Graph Reduction

This page was built for publication: Three syntactic theories for combinatory graph reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946718)