Red-black trees with types

被引：0

作者：

Kahrs, S ^{[1
]}

机构：

[1] Univ Kent, Canterbury, Kent, England

来源：

JOURNAL OF FUNCTIONAL PROGRAMMING | 2001年 / 11卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：425 / 432

页数：8

共 50 条

[1] RED-BLACK TREES
SCHNEIER, B
[J]. DR DOBBS JOURNAL, 1992, 17 (04): : 42 - &
[2] Relativistic red-black trees
Howard, Philip W.
Walpole, Jonathan
[J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2014, 26 (16): : 2684 - 2712
[3] Relaxed balanced red-black trees
Hanke, S
Ottmann, T
Soisalon-Soininen, E
[J]. ALGORITHMS AND COMPLEXITY, 1997, 1203 : 193 - 204
[4] Group updates for red-black trees
Hanke, S
Soisalon-Soininen, E
[J]. ALGORITHMS AND COMPLEXITY, 2000, 1767 : 253 - 262
[5] Parallel algorithms for red-black trees
Park, H
Park, K
[J]. THEORETICAL COMPUTER SCIENCE, 2001, 262 (1-2) : 415 - 435
[6] STL's red-black trees
Shankel, J
[J]. DR DOBBS JOURNAL, 1998, 23 (04): : 54 - +
[7] Relaxed red-black trees with group updates
Larsen, KS
[J]. ACTA INFORMATICA, 2002, 38 (08) : 565 - 586
[8] HOW COSTLY CAN RED-BLACK TREES BE
CAMERON, H
WOOD, D
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 497 : 117 - 126
[9] Red-black trees with relative node keys
Holenderski, Mike
Bril, Reinder J.
Lukkien, Johan J.
[J]. INFORMATION PROCESSING LETTERS, 2014, 114 (11) : 591 - 596
[10] Red-black trees with constant update time
Elmasry, Amr
Kahla, Mostafa
Ahdy, Fady
Hashem, Mahmoud
[J]. ACTA INFORMATICA, 2019, 56 (05) : 391 - 404

← 1 2 3 4 5 →