Contification using dominators

DOI10.1145/507635.507639MaRDI QIDQ5177993zbMATH OpenOpenAlexFDO

Authors Matthew T. Fluet, Stephen Weeks

Publication date 9 March 2015

Published in Proceedings of the sixth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Theory of compilers and interpreters (68N20)

Recommendations

• Cutting Out Continuations
• Compiling with continuations, continued
• Validating dominator trees for a fast, verified dominance test
• Generalized dominators
• Correctness of static flow analysis in continuation semantics

Cited in

(2)

• Finding Dominators in Practice
• A lambda term representation inspired by linear ordered logic

This page was built for publication: Contification using dominators

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