Database manipulation in Haskell 1.3

Authors:
Kevin Hammond;Phil Trinder
Affiliations:
Division of Computer Science, University of St. Andrews, St. Andrews, Scotland, U.K;Department of Computing Science, University of Glasgow, Glasgow, Scotland, U.K
Venue:
FP'95 Proceedings of the 1995 international conference on Functional Programming
Year:
1995

Citing 7
Cited 0

List comprehensions in Agna, a parallel persistent object system

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Comprehensions, a query notation for DBPLs

DBPL3 Proceedings of the third international workshop on Database programming languages : bulk types & persistent data: bulk types & persistent data
Shadowed management of free disk pages with a linked list

ACM Transactions on Database Systems (TODS)
A Functional Programming Approach to Deductive Databases

VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Processing Transactions on GRIP, a Parallel Graph Reducer

PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
A Parallel Functional Database on GRIP

Proceedings of the 1991 Glasgow Workshop on Functional Programming
A functional database (databases)

A functional database (databases)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates using a functional language with a sophisticated type system to implement data-intensive programs. We focus on how bulk data types can be represented rather than on the efficient implementation of those types. The paper is intended more as a discussion document, recording some thoughts on how to represent bulk data in a functional language, than as a conclusive statement on functional databases. It also serves as a reasonably complex and hopefully realistic example of how some of the new features of Haskell 1.3, including constructor classes, can be exploited to good effect. The limitations of these features are also assessed.