Red-black trees with types

Kahrs, Stefan (2001) Red-black trees with types. Journal of Functional Programming, 11 (4). pp. 425-432. (doi:10.1017/S0956796801004026) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13587)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
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
DOI/Identification number:	10.1017/S0956796801004026
Uncontrolled keywords:	balanced trees, existential types
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Mark Wheadon
Date Deposited:	24 Nov 2008 17:59 UTC
Last Modified:	05 Nov 2024 09:47 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/13587 (The current URI for this page, for reference purposes)

University of Kent Author Information

Kahrs, Stefan.

Creator's ORCID:	https://orcid.org/0000-0001-5099-9375
CReDIT Contributor Roles:

Depositors only (login required):

Altmetric

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.