Just do it while compiling!: fast extensible records in haskell

Authors:
Bruno Martinez;Marcos Viera;Alberto Pardo
Affiliations:
Universidad de la República, Montevideo, Uruguay;Universidad de la República, Montevideo, Uruguay;Universidad de la República, Montevideo, Uruguay
Venue:
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Year:
2013

Citing 13
Cited 0

Type Classes with Functional Dependencies

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
A Logarithmic Implementation of Flexible Arrays

Proceedings of the Second International Conference on Mathematics of Program Construction
The Zip Calculus

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Purely functional data structures

Purely functional data structures
Student paper: HaskellDB improved

Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Strongly typed heterogeneous collections

Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Associated types with class

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Associated type synonyms

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Strong types for relational databases

Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
The Clojure programming language

DLS '08 Proceedings of the 2008 symposium on Dynamic languages
Type checking with open type functions

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Attribute grammars fly first-class: how to do aspect oriented programming in Haskell

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Generic record combinators with static type checking

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The library for strongly typed heterogeneous collections HList provides an implementation of extensible records in Haskell that needs only a few common extensions of the language. In HList, records are represented as linked lists of label-value pairs with a lookup operation that is linear-time in the number of fields. In this paper, we use type-level programming techniques to develop a more efficient representation of extensible records for HList. We propose two internal encodings for extensible records that improve lookup at runtime without needing a total order on the labels. One of the encodings performs lookup in constant time but at a cost of linear time insertion. The other one performs lookup in logarithmic time while preserving the fast insertion of simple linked lists. Through staged compilation, the required slow search for a field is moved to compile time in both cases.