1 option
A Tight, Practical Integration of Relations and Functions / by Harold Boley.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Author/Creator:
- Boley, H. (Harold), author.
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 1712.
- Lecture Notes in Artificial Intelligence ; 1712
- Language:
- English
- Subjects (All):
- Artificial intelligence.
- Programming languages (Electronic computers).
- Logic, Symbolic and mathematical.
- Computer logic.
- Artificial Intelligence.
- Programming Languages, Compilers, Interpreters.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Local Subjects:
- Artificial Intelligence.
- Programming Languages, Compilers, Interpreters.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Physical Description:
- 1 online resource (XII, 176 pages).
- Edition:
- First edition 1999.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-48064-8
- 9783540480648
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.