Tutorial: languages for collection types
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Domain-theoretic Approach to Integrating Functional and Logic Database Languages
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Database query languages and functional logic programming
New Generation Computing
| Hi-index | 0.00 |
A new functional database language called PFL is described. PFL is a lazy functional language with a polymorphic type inference system which enforces strong static type-checking. All functions persist in a repository, and are specified by the insertion and deletion of equations. New data types can be added at any time, and the order in which types and equations are inserted is immaterial. A class of functions called selectors are used for the storage of bulk data. Selectors allow flexible, efficient access to stored data and encourage a natural and succinct programming style. We describe the type system of PFL and the definition of functions, including selectors. We then compare PFL with logic based languages, and other functional languages. Finally, we give an extended example based upon the manufacturing company parts database of [Atk87].