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.
Originalsprog | Engelsk |
---|---|
Titel | Programming Languages and Systems : 11th Asian Symposium, APLAS 2013, Melbourne, VIC, Australia, December 9-11, 2013. Proceedings |
Redaktører | Chung-chieh Shan |
Antal sider | 18 |
Forlag | Springer |
Publikationsdato | 2013 |
Sider | 315-332 |
ISBN (Trykt) | 978-3-319-03542-0 |
ISBN (Elektronisk) | 978-3-319-03542-0 |
DOI | |
Status | Udgivet - 2013 |
Begivenhed | 11th Asian Symposium on Programming Languages and Systems - Melbourne, Australien Varighed: 9 dec. 2013 → 11 dec. 2013 Konferencens nummer: 11 |
Konference
Konference | 11th Asian Symposium on Programming Languages and Systems |
---|---|
Nummer | 11 |
Land/Område | Australien |
By | Melbourne |
Periode | 09/12/2013 → 11/12/2013 |
Navn | Lecture notes in computer science |
---|---|
Vol/bind | 8301 |
ISSN | 0302-9743 |