Introduction to relational programming

ABSTRACT

In this paper we discuss relational programming, i.e. a style of programming in which entire relations are manipulated rather than individual data. This analogous to functional programming [1], wherein entire functions are the values manipulated by the operators. We will see that relational programming subsumes functional programming because every function is also a relation. It is appropriate this point to discuss why we have chosen investigate relational programming.

REFERENCES

• 1: John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
• 2: Carnap, R. Introduction to Symbolic Logic and its Applications, Dover, 1958.
• 3: Childs, D.L. Feasibility of a set-theoretic data structure based on a reconstituted definition of relation. IFIP 68 Proceedings, 420-430, North-Holland, 1969.
• 4: E. F. Codd, A relational model of data for large shared data banks, Communications of the ACM, v.13 n.6, p.377-387, June 1970 [doi>10.1145/362384.362685]
• 5: Curry, H.B., Feys, R. and Craig, W. Combinatory Logic, I, North-Holland, Amsterdam, 1958.
• 6: Jerome A. Feldman , Paul D. Rovner, An ALGOL-based associative language, Communications of the ACM, v.12 n.8, p.439-449, Aug. 1969 [doi>10.1145/363196.363204]
• 7: Kennedy, K. and Schwartz, J. An introduction to the set theoretical language SETL, J. Comptr. and Math. with Applications 1 (1975), 97-119.
• 8: Robert Kowalski, Algorithm = logic + control, Communications of the ACM, v.22 n.7, p.424-436, July 1979 [doi>10.1145/359131.359136]
• 9: Peter Henderson, Functional Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1980
• 10: Peter Henderson , James H. Morris, Jr., A lazy evaluator, Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.95-103, January 19-21, 1976, Atlanta, Georgia [doi>10.1145/800168.811543]
• 11: B. J. MacLennan, Fen—an axiomatic basis for program semantics, Communications of the ACM, v.16 n.8, p.468-474, Aug. 1973 [doi>10.1145/355609.362316]
• 12: MacLennan, B.J. Programming with a Relational Calculus, Computer Science Department Technical Report, Naval Postgraduate School, 1981.
• 13: Popplestone, R.J. Relational programming, in Hayes, J.E. et: al. (eds.), Machine Intelligence 9, Halsted Press, 1979, 3-26.
• 14: J. T. Schwartz, Automatic data structure choice in a language of very high level, Communications of the ACM, v.18 n.12, p.722-728, Dec. 1975 [doi>10.1145/361227.361235]
• 15: M. H. Van Emden , R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language, Journal of the ACM (JACM), v.23 n.4, p.733-742, Oct. 1976 [doi>10.1145/321978.321991]
• 16: Whitehead, A.N. and Russell, B. Principia Mathematica to *56, Cambridge, 1970.

INDEX TERMS

Primary Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
      D.1.1 Applicative (Functional) Programming

Additional Classification:
  E. Data
  E.1 DATA STRUCTURES

General Terms:
Design, Languages