The role of lazy evaluation in amortized data structures

DOI10.1145/232627.232636MaRDI QIDQ2817684zbMATH OpenOpenAlexFDO

Authors Chris Okasaki

Publication date 1 September 2016

Published in Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Data structures (68P05)

Recommendations

• Purely Functional Data Structures
• More haste, less speed: lazy versus eager evaluation
• scientific article; zbMATH DE number 54254
• Automatic amortised analysis of dynamic memory allocation for lazy functional programs
• Type-based cost analysis for lazy functional languages

Cited in

(4)

• Inductive benchmarking for purely functional data structures
• Lightweight semiformal time complexity analysis for purely functional data structures
• scientific article; zbMATH DE number 54254 (Why is no real title available?)
• Simple confluently persistent catenable lists

This page was built for publication: The role of lazy evaluation in amortized data structures

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