Extending Functional Programming Towards Relations

  title={Extending Functional Programming Towards Relations},
  author={R. Legrand},
  • R. Legrand
  • Published in ESOP 1988
  • Computer Science
  • This article describes the relational programming paradigm. Because a function is a particular case of relation, we can consider the computation of points-to-set processes (relations) instead of points-to-point processes (functions). Relations are useful for parallel, non-deterministic or multi-valued algorithms. The first section presents the main features of the proposed language and it is shown how relations make programs more flexible and natural. Then, we present an efficient… CONTINUE READING
    3 Citations
    Widening the representation bottleneck: a functional implementation of relational programming
    • 7
    • PDF
    Evaluation of logic programs in a relational language
    Functions and Relations: The GRAAL System


    A new implementation technique for applicative languages
    • D. Turner
    • Computer Science
    • Softw. Pract. Exp.
    • 1979
    • 682
    • PDF
    LELISP, a portable and efficient LISP system
    • 36
    • PDF
    Depth-First Iterative-Deepening: An Optimal Admissible Tree Search
    • R. Korf
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1985
    • 1,619
    • PDF