Sorting and searching by distribution: from generic discrimination to generic tries

Fritz Henglein, Ralf Hinze

1 Citationer (Scopus)

Abstract

A discriminator partitions values associated with keys into groups listed in ascending order. Discriminators can be defined generically by structural recursion on representations of ordering relations. Employing type-indexed families we demonstrate how tries with an optimaltime lookup function can be constructed generically in worst-case linear time. We provide generic implementations of comparison, sorting, discrimination and trie building functions and give equational proofs of correctness that highlight core relations between these algorithms.

OriginalsprogEngelsk
TitelProgramming Languages and Systems : 11th Asian Symposium, APLAS 2013, Melbourne, VIC, Australia, December 9-11, 2013. Proceedings
RedaktørerChung-chieh Shan
Antal sider18
ForlagSpringer
Publikationsdato2013
Sider315-332
ISBN (Trykt)978-3-319-03542-0
ISBN (Elektronisk)978-3-319-03542-0
DOI
StatusUdgivet - 2013
Begivenhed11th Asian Symposium on Programming Languages and Systems - Melbourne, Australien
Varighed: 9 dec. 201311 dec. 2013
Konferencens nummer: 11

Konference

Konference11th Asian Symposium on Programming Languages and Systems
Nummer11
Land/OmrådeAustralien
ByMelbourne
Periode09/12/201311/12/2013
NavnLecture notes in computer science
Vol/bind8301
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'Sorting and searching by distribution: from generic discrimination to generic tries'. Sammen danner de et unikt fingeraftryk.

Citationsformater