Skip to main content
SpringerLink
Log in

A Tight, Practical Integration of Relations and Functions

  • Book
  • © 1999

Overview

Authors:
  1. Harold Boley
    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1712)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Download chapter PDF

  2. An overview of the relational-functional language RELFUN

    Pages 1-20

  3. Extended logic-plus-functional programming

    Pages 21-53

  4. A direct semantic characterization of RELFUN

    Pages 55-88

  5. Finite domains and exclusions as first-class citizens

    Pages 89-116

  6. Multiple-valued Horn clauses and their WAM compilation

    Pages 117-160

  7. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation