A tight, practical integration of relations and functions
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 function...
সংরক্ষণ করুন:
| প্রধান লেখক: | |
|---|---|
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| মালা: | Lecture notes in computer science. Lecture notes in artificial intelligence
1712 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| টীকা: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • A tight, practical integration of relations and functions, Harold Boley, 1999, Berlin, Springer, 1 vol. (XI-169 p.), Lecture notes in computer science, 3-540-66644-3 • A Tight, Practical Integration of Relations and Functions, Texte imprimé, 9783662200636 |
| LEADER | 03493nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 971165 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155202669 | ||
| 020 | |a 9783540480648 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 005.74 | ||
| 082 | |a 004 | ||
| 100 | 1 | |a Boley, Harold. | |
| 245 | 1 | 0 | |a A tight, practical integration of relations and functions |c Harold Boley. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science. Lecture notes in artificial intelligence |v 1712 |x 1611-3349 |x 2945-9141 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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. | ||
| 650 | |a Informatique | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Programmation fonctionnelle (informatique) | ||
| 650 | |a Bases de données relationnelles | ||
| 650 | |a Programmation logique | ||
| 776 | 0 | |0 046626670 |t A tight, practical integration of relations and functions |f Harold Boley |d 1999 |c Berlin |n Springer |p 1 vol. (XI-169 p.) |s Lecture notes in computer science |z 3-540-66644-3 | |
| 776 | 0 | |t A Tight, Practical Integration of Relations and Functions |b Texte imprimé |z 9783662200636 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0103291 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-9JSPF9ND-6 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:75065564X |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0103291 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754005550 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0103291 |z Accès INSA CVL | |
| 997 | |0 971165 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||