A Tight, Practical Integration of Relations and Functions
Boley, Harold.
A Tight, Practical Integration of Relations and Functions [electronic resource] / by Harold Boley. - 1st ed. 1999. - XII, 176 p. online resource. - Lecture Notes in Artificial Intelligence, 1712 2945-9141 ; . - Lecture Notes in Artificial Intelligence, 1712 .
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.
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.
9783540480648
10.1007/BFb0103291 doi
Artificial intelligence.
Compilers (Computer programs).
Machine theory.
Computer science.
Artificial Intelligence.
Compilers and Interpreters.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Q334-342 TA347.A78
006.3
A Tight, Practical Integration of Relations and Functions [electronic resource] / by Harold Boley. - 1st ed. 1999. - XII, 176 p. online resource. - Lecture Notes in Artificial Intelligence, 1712 2945-9141 ; . - Lecture Notes in Artificial Intelligence, 1712 .
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.
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.
9783540480648
10.1007/BFb0103291 doi
Artificial intelligence.
Compilers (Computer programs).
Machine theory.
Computer science.
Artificial Intelligence.
Compilers and Interpreters.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Q334-342 TA347.A78
006.3