A Tight, Practical Integration of Relations and Functions

  • Authors
  • Harold Boley

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1712)

About this book


As in other fields, in computer science certain objects of study can be synthesized from different basic elements, in different ways, and with different resulting stabilities. In subfields such as artificial intelligence, computational logic, and programming languages various relational and functional ingredients and techniques have been tried for the synthesis of declarative programs.
This text considers the notions of relations, as found in logic programming or in relational databases, and of functions, as found in functional programming or in equational languages. We study a declarative integration which is tight, because it takes place right at the level of these notions, and which is still practical, because it preserves the advantages of the widely used relational and functional languages PROLOG and LISP. The resulting relational and functional language, RELFUN, is used here for exemplifying all integration principles.


LISP artificial intelligence functional programming intelligence logic programming programming language

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0103291
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66644-8
  • Online ISBN 978-3-540-48064-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book