Skip to main content
PRL Project

KnowledgeBase » Seminar SEMINAR » ID = 619

Verified Implementation of Red-Black Trees

by Alexei Kopylov
2003-2004

Red-black trees is a data structure of balanced binary trees. I'll show how it could be implemented and verified in MetaPRL.
Slides

PRL Home
Introduction
The Nuprl book
Origins of the PRL Project
Goals
Dynamics of the Project
Mathematical Expression in Nuprl
Cross Links to Math & CS Fields
Knowledge Base
Math Library
Publications
Projects
CRASH
Nuprl/FDL System
EventML Software
Seminar
People
Wiki
The Book
Lectures
Other Groups


Website feedback
PRL Project   |   Computer Science Department   |   Cornell University
nuprl@cs.cornell.edu   |   320 Gates Hall, Ithaca, NY 14853   |   © 2014 Cornell University
site admin | Prof Constable's Library