Red-black trees in a functional setting
From MaRDI portal
Publication:4943361
DOI10.1017/S0956796899003494zbMath0949.68518WikidataQ56060742 ScholiaQ56060742MaRDI QIDQ4943361
Publication date: 16 March 2000
Published in: Journal of Functional Programming (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Functional programming and lambda calculus (68N18)
Related Items (7)
Deletion: The curse of the red-black tree ⋮ Red-black trees with constant update time ⋮ Space-efficient functional offline-partially-persistent trees with applications to planar point location ⋮ Pattern matching for the masses using custom notations ⋮ An assertional proof of red-black trees using Dafny ⋮ Iteration and coiteration schemes for higher-order and nested datatypes ⋮ Purely Functional 1-2 Brother Trees
This page was built for publication: Red-black trees in a functional setting
