Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008269749/catalog> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- catalog abstract "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.".
- catalog contributor b11505293.
- catalog created "1999.".
- catalog date "1999".
- catalog date "1999.".
- catalog dateCopyrighted "1999.".
- catalog description "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.".
- catalog 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.".
- catalog description "Includes bibliographical references.".
- catalog extent "xi, 169 p. :".
- catalog identifier "3540666443".
- catalog isPartOf "Lecture notes in computer science ; 1712. Lecture notes in artificial intelligence".
- catalog isPartOf "Lecture notes in computer science ; 1712.".
- catalog isPartOf "Lecture notes in computer science. Lecture notes in artificial intelligence.".
- catalog issued "1999".
- catalog issued "1999.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "005.74 21".
- catalog subject "Artificial intelligence.".
- catalog subject "Computer science.".
- catalog subject "Functional programming (Computer science)".
- catalog subject "Logic design.".
- catalog subject "Logic programming.".
- catalog subject "QA76.63 .B65 1999".
- catalog subject "Relational databases.".
- catalog tableOfContents "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.".
- catalog title "A tight, practical integration of relations and functions / Harold Boley.".
- catalog type "text".