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.
| ISBN: | 9783540666448 |
| Publication date: | 29th September 1999 |
| Author: | H Boley |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Paperback |
| Pagination: | 169 pages |
| Series: | Lecture Notes in Computer Science. Lecture Notes in Artificial Intelligence |
| Genres: |
Artificial intelligence Compilers and interpreters Mathematical theory of computation |
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.
A Tight, Practical Integration of Relations and Functions features in the following genres: Artificial intelligence, Compilers and interpreters, Mathematical theory of computation
Paperback. Not Available.
A Tight, Practical Integration of Relations and Functions was written by H Boley and published by Springer an imprint of Springer Berlin Heidelberg
A Tight, Practical Integration of Relations and Functions has 169 pages
Yes it is part of Lecture Notes in Computer Science. Lecture Notes in Artificial Intelligence series