https://github.com/andreasabel/red-black-tree-left-leaning

Left-leaning red-black trees in Agda (insertion and deletion) with static ordering and balancing invariants
https://github.com/andreasabel/red-black-tree-left-leaning

agda dependent-types red-black-tree verification

Last synced: 8 months ago
JSON representation

Left-leaning red-black trees in Agda (insertion and deletion) with static ordering and balancing invariants

• Host: GitHub
• URL: https://github.com/andreasabel/red-black-tree-left-leaning
• Owner: andreasabel
• Created: 2024-02-13T16:59:37.000Z (over 1 year ago)
• Default Branch: master
• Last Pushed: 2025-02-19T19:28:40.000Z (8 months ago)
• Last Synced: 2025-02-19T20:28:21.508Z (8 months ago)
• Topics: agda, dependent-types, red-black-tree, verification
• Language: Agda
• Homepage: https://andreasabel.github.io/red-black-tree-left-leaning/Everything.html
• Size: 144 KB
• Stars: 2
• Watchers: 2
• Forks: 0
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
Left-leaning red-black trees in Agda

====================================

This is an implementation of red-black trees (aka 2-3-4 trees) in Agda with static balancing and ordering invariants.

Insertion and deletion are implemented, the latter just for left-leaning red-black trees (aka 2-3 trees).

The development was mostly carried out by Julien Oster as a student research project at LMU Munich in 2009/2010.

The main development resides in [LLRBTree.agda](RBTree/LLRBTree.agda).

The implementation of the ordering invariant predates the seminal paper by Conor McBride, _Keeping your neighbours in order_ (ICFP 2010).  The techniques of McBride would considerably simplify the development.