Views: a way for pattern matching to cohabit with data abstraction
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Generating function versions with rational strictness patterns
Science of Computer Programming
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unboxed values as first class citizens in a non-strict functional language
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
Unboxed objects and polymorphic typing
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A system of constructor classes: overloading and implicit higher-order polymorphism
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Parallel implementation of bags
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
The nofib Benchmark Suite of Haskell Programs
Proceedings of the 1992 Glasgow Workshop on Functional Programming
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
A polymorphic record calculus and its compilation
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Unboxed Operational Semantics for ML Polymorphism
Lisp and Symbolic Computation
A systematic study of functional language implementations
ACM Transactions on Programming Languages and Systems (TOPLAS)
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
Automatic Type-Driven Library Generation for Telescoping Languages
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Higher-Order and Symbolic Computation
| Hi-index | 0.00 |
Lists are a pervasive data structure in functional programs. The generality and simplicity of their structure makes them expensive. Hindley-Milner type inference and partial evaluation are all that is needed to optimise this structure, yielding considerable improvements in space and time consumption for some interesting programs. This framework is applicable to many data types and their optimised representations, such as lists and parallel implementations of bags, or arrays and quadtrees.