Finger trees: a simple general-purpose data structure

DOI10.1017/S0956796805005769MaRDI QIDQ3377461zbMATH OpenWikidataFDO

Authors Ralf Hinze, Ross Paterson

Publication date 22 March 2006

Published in Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

search treepriority queuepriority search queue

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Program-ing finger trees in Coq
• scientific article; zbMATH DE number 1256736
• scientific article; zbMATH DE number 218385
• scientific article; zbMATH DE number 1303596
• scientific article; zbMATH DE number 2079361

Cited in

(20)

• Genetic programming + proof search = automatic improvement
• Program-ing finger trees in Coq
• Efficient implementation of linearly used finite maps
• Inductive benchmarking for purely functional data structures
• An overview of Edison
• scientific article; zbMATH DE number 1874367 (Why is no real title available?)
• Shape neutral analysis of graph-based data-structures
• Numerical representations as purely functional data structures
• Calculating datastructures
• scientific article; zbMATH DE number 7779291 (Why is no real title available?)
• Multi-Finger Binary Search Trees
• Calculating a linear-time solution to the densest-segment problem
• Efficient parallel and incremental parsing of practical context-free languages
• Refinement to Imperative/HOL
• Towards an induction principle for nested data types
• Lazy tree splitting
• Purely Functional 1-2 Brother Trees
• scientific article; zbMATH DE number 7649972 (Why is no real title available?)
• On constructing 2-3 trees
• Theory and practice of chunked sequences

This page was built for publication: Finger trees: a simple general-purpose data structure

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