Red-black trees with types

DOI10.1017/S0956796801004026MaRDI QIDQ2757083zbMATH OpenOpenAlexWikidataFDO

Authors Stefan Michael Kahrs

Publication date 21 November 2001

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

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

zbMATH Keywords

functional programming languagered-black trees

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Red-black trees in a functional setting
• Red-black trees with relative node keys
• scientific article; zbMATH DE number 5279360
• Type Classes of Context Trees
• Binary Trees and (Maximal) Order Types
• Red-black trees with constant update time
• CONSTRUCTING RED-BLACK TREE SHAPES
• An assertional proof of red-black trees using Dafny

Cited in

(9)

• Iteration and coiteration schemes for higher-order and nested datatypes
• An assertional proof of red-black trees using Dafny
• How to keep your neighbours in order
• Automatic functional correctness proofs for functional search trees
• CONSTRUCTING RED-BLACK TREE SHAPES
• Purely Functional 1-2 Brother Trees
• Red-black trees in a functional setting
• Program-ing finger trees in Coq
• Proving tree algorithms for succinct data structures

This page was built for publication: Red-black trees with types

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