
A Tight, Practical Integration of Relations and Functions
Harold Boley(Author)
Springer (Publisher)
Published on 29. September 1999
Book
Paperback/Softback
XII, 176 pages
978-3-540-66644-8 (ISBN)
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.
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.
More details
Series
Edition
1999 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XII, 176 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 11 mm
Weight
295 gr
ISBN-13
978-3-540-66644-8 (9783540666448)
DOI
10.1007/BFb0103291
Schweitzer Classification
Content
An overview of the relational-functional language RELFUN.- Extended logic-plus-functional programming.- A direct semantic characterization of RELFUN.- Finite domains and exclusions as first-class citizens.- Multiple-valued Horn clauses and their WAM compilation.