000 03242nam a22005895i 4500
001 978-3-540-48064-8
003 DE-He213
005 20240423132531.0
007 cr nn 008mamaa
008 121227s1999 gw | s |||| 0|eng d
020 _a9783540480648
_9978-3-540-48064-8
024 7 _a10.1007/BFb0103291
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
100 1 _aBoley, Harold.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 2 _aA Tight, Practical Integration of Relations and Functions
_h[electronic resource] /
_cby Harold Boley.
250 _a1st ed. 1999.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1999.
300 _aXII, 176 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1712
505 0 _aAn 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.
520 _aAs 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 0 _aArtificial intelligence.
650 0 _aCompilers (Computer programs).
650 0 _aMachine theory.
650 0 _aComputer science.
650 1 4 _aArtificial Intelligence.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540666448
776 0 8 _iPrinted edition:
_z9783662200636
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1712
856 4 0 _uhttps://doi.org/10.1007/BFb0103291
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188815
_d188815