Red-black trees with types

Kahrs, Stefan (2001) Red-black trees with types. Journal of Functional Programming, 11 (4). pp. 425-432. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1017/S0956796801004026

Abstract

Chris Okasaki showed how to implement red-black trees in a functional programming language. Ralf Hinze incorporated even the invariants of such data structures into their types, using higher-order nested datatypes. We show how one can achieve something very similar without the usual performance penalty of such types, by combining the features of nested datatypes, phantom types and existential type variables.

Item Type: Article
Uncontrolled keywords: balanced trees, existential types
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:59
Last Modified: 03 Jul 2009 15:37
Resource URI: http://kar.kent.ac.uk/id/eprint/13587 (The current URI for this page, for reference purposes)
  • Depositors only (login required):