GALILEO: a strongly-typed, interactive conceptual language
ACM Transactions on Database Systems (TODS)
A generic persistent object store
Software Engineering Journal - Object-oriented systems
GUM: a portable parallel implementation of Haskell
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Dynamic typing as staged type inference
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The bits between the lambdas: binary data in a lazy functional language
Proceedings of the 1st international symposium on Memory management
Proceedings of the Thirteenth Spring School of the LITP on Combinators and Functional Programming Languages
The PROSPECTRA System: A Unified Development Framework
AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
IFL '96 Selected Papers from the 8th International Workshop on Implementation of Functional Languages
Orthogonal serialisation for Haskell
IFL'10 Proceedings of the 22nd international conference on Implementation and application of functional languages
| Hi-index | 0.00 |
Persistent programming offers the prospect of seamless integration of programs with long-lived data, offering the prospect of constructing systems that allow more rapid program development, and also simplifying the process of writing applications whose purpose is to handle long-lived data. While there have been some previous attempts to produce persistent functional languages, the majority of these have been interpreted, and performance has generally been seriously compromised. It has therefore become something of a shibboleth that persistence cannot be implemented efficiently in a purely functional language. This paper offers the first systematic study of this claim. This paper describes the first-ever implementation of orthogonal persistence for a compiled purely functional language, based on an existing St Andrews persistent object store. Preliminary performance results show that it is possible to implement orthogonal persistence efficiently and there is hope that the result is more efficient than more straightforward approaches such as binary I/O.