Purely Functional 1-2 Brother Trees

DOI10.1017/S0956796809007333MaRDI QIDQ3648351zbMATH OpenWikidataFDO

Authors Ralf Hinze

Publication date 25 November 2009

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

Full work available at URL https://doi.org/10.1017/S0956796809007333

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimal-Cost Brother Trees
• scientific article; zbMATH DE number 3845066
• Red-black trees in a functional setting
• scientific article; zbMATH DE number 4049071
• Balance in AVL trees and space cost of brother trees

Cites work

• Balanced trees with removals: An exercise in rewriting and proof
• Finger trees: a simple general-purpose data structure
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• On the correspondence between AVL trees and brother trees
• Purely Functional Data Structures
• Red-black trees in a functional setting
• Red-black trees with types
• Symmetric binary B-trees: Data structure and maintenance algorithms

Cited in

(2)

• Automatic functional correctness proofs for functional search trees
• On constructing 2-3 trees

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Purely Functional 1-2 Brother Trees

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