Compiling self-adjusting programs with continuations

DOI10.1145/1411204.1411249MaRDI QIDQ5178772zbMATH OpenOpenAlexFDO

Authors Ruy Ley-Wild, Matthew T. Fluet, Umut A. Acar

Publication date 16 March 2015

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

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

zbMATH Keywords

memoizationcontinuation-passing styleself-adjusting computation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• A cost semantics for self-adjusting computation
• Imperative self-adjusting computation
• Non-monotonic self-adjusting computation
• A consistent semantics of self-adjusting computation
• A Consistent Semantics of Self-adjusting Computation

Cited in

(8)

• Adaptive functional programming
• Automata, Languages and Programming
• A cost semantics for self-adjusting computation
• Functional programming for dynamic and large data with self-adjusting computation
• Implicit self-adjusting computation for purely functional programs
• Implicit self-adjusting computation for purely functional programs
• Non-monotonic self-adjusting computation
• A consistent semantics of self-adjusting computation

This page was built for publication: Compiling self-adjusting programs with continuations

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