In Proceedings of the 3rd International Workshop on Database Programming Languages (DBPL) (1991), pp. 9-19
posted to functional query
on 2005-02-02 22:11:11
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. Its main computational engine is structural recursion on sets. All programming is done within a "nicely" typed lambda calculus, as in Machiavelli [OBB89]. A guiding principle is that how queries are implemented is as important as whether they can be implemented. As in relational algebra, the meaning of any relation... ...