ShopSpell

A Tight, Practical Integration of Relations and Functions [Paperback]

$41.99     $54.99    24% Off      (Free Shipping)
100 available
  • Category: Books (Computers)
  • Author:  Boley, Harold
  • Author:  Boley, Harold
  • ISBN-10:  3540666443
  • ISBN-10:  3540666443
  • ISBN-13:  9783540666448
  • ISBN-13:  9783540666448
  • Publisher:  Springer
  • Publisher:  Springer
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Feb-1999
  • Pub Date:  01-Feb-1999
  • SKU:  3540666443-11-SPRI
  • SKU:  3540666443-11-SPRI
  • Item ID: 100707259
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 04 to Jul 06
  • Notes: Brand New Book. Order Now.
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.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.An overview of the relational-functional language RELFUN.- Extended logic-plus-functional programming.- A lcĄ
Add Review