Towards Applicative Relational Programming

Details Towards Applicative Relational Programming Towards Applicative Relational Programming

2006-02-28

arxiv.org/abs/cs/0602099v1

Computer Science

Programming Languages

10 pages; no figures

Scientific paper

Functional programming comes in two flavours: one where ``functions are first-class citizens'' (we call this applicative) and one which is based on equations (we call this declarative). In relational programming clauses play the role of equations. Hence Prolog is declarative. The purpose of this paper is to provide in relational programming a mathematical basis for the relational analog of applicative functional programming. We use the cylindric semantics of first-order logic due to Tarski and provide a new notation for the required cylinders that we call tables. We define the Table/Relation Algebra with operators sufficient to translate Horn clauses into algebraic form. We establish basic mathematical properties of these operators. We show how relations can be first-class citizens, and devise mechanisms for modularity, for local scoping of predicates, and for exporting/importing relations between programs.

Affiliated with

Also associated with

No associations

Rating

Towards Applicative Relational Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Towards Applicative Relational Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Applicative Relational Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-388278