Credit-based amortized analysis is sound for persistent data structures when credits are stored only on thunks, and Okasaki's debit approach receives a formal operational semantics.
Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages , series =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.
citing papers explorer
-
Persistent Amortised Analysis, Operationally
Credit-based amortized analysis is sound for persistent data structures when credits are stored only on thunks, and Okasaki's debit approach receives a formal operational semantics.
-
Crumbling Abstract Machines
Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.