Finger trees: a simple general-purpose data structure
From MaRDI portal
Publication:3377461
DOI10.1017/S0956796805005769zbMath1088.68041WikidataQ59595142 ScholiaQ59595142MaRDI QIDQ3377461
Publication date: 22 March 2006
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items (12)
Lazy tree splitting ⋮ Shape Neutral Analysis of Graph-based Data-structures ⋮ Refinement to Imperative/HOL ⋮ Calculating datastructures ⋮ Unnamed Item ⋮ Towards an induction principle for nested data types ⋮ Efficient parallel and incremental parsing of practical context-free languages ⋮ Calculating a linear-time solution to the densest-segment problem ⋮ Unnamed Item ⋮ On constructing 2-3 trees ⋮ Genetic programming \(+\) proof search \(=\) automatic improvement ⋮ Purely Functional 1-2 Brother Trees
This page was built for publication: Finger trees: a simple general-purpose data structure