ENGLISH

A Tight, Practical Integration of Relations and Functions

By Harold Boley (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1999
ISBN
3540666443, 9783540666448
DOI
10.1007/BFb0103291
Open Library ID
OL9347400M
Language
english
Format
PDF
Filesize
8 MB (8418028 bytes)
Series
Lecture Notes in Computer Science 1712 : Lecture Notes in Artificial Intelligence
Edition
1
Pages
176\178
Orientation
no
Scanned
yes
Time added
2011-08-31 04:54:40
Artificial Intelligence (incl. Robotics); Mathemat

Description

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.

Similar books