LEADER 04080nam 2200601 450 001 996465313103316 005 20220420204923.0 010 $a3-540-46063-2 024 7 $a10.1007/3-540-50667-5 035 $a(CKB)1000000000233345 035 $a(SSID)ssj0000321091 035 $a(PQKBManifestationID)11212652 035 $a(PQKBTitleCode)TC0000321091 035 $a(PQKBWorkID)10262688 035 $a(PQKB)10387574 035 $a(DE-He213)978-3-540-46063-3 035 $a(MiAaPQ)EBC5584960 035 $a(MiAaPQ)EBC6690100 035 $a(Au-PeEL)EBL5584960 035 $a(OCoLC)1066185610 035 $a(Au-PeEL)EBL6690100 035 $a(PPN)155197215 035 $a(EXLCZ)991000000000233345 100 $a20220420d1988 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aAlgebraic and logic programming $einternational workshop, Gaussing, GDR, November 14-18, 1988 : proceedings /$fJ. Grabowski, P. Lescanne, W. Wechler (editors) 205 $a1st ed. 1988. 210 1$aBerlin :$cSpringer-Verlag,$d[1988] 210 4$dİ1988 215 $a1 online resource (IX, 269 p.) 225 1 $aLecture notes in computer science ;$v343 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-50667-5 327 $aACP with signals -- Functional extensions to prolog: Are they needed? -- Narrowing and resolution in logic-functional programming languages -- Nondeterministic algebraic specifications and nonconfluent term rewriting -- OBJ: Programming with equalities, subsorts, overloading and parameterization -- Logic programming with polymorphically order-sorted types -- Integrating logic programming and equational specification of abstract data types -- Narrowing with built-in theories -- A completion procedure for hierarchical conditional rewriting systems -- An effective method for handling initial algebras -- Boolean valued models and incomplete specifications -- Types, modularisation and abstraction in logic programming -- Translating algebraic specifications to Prolog programs: A comparative study -- Rewrite rule systems for modal propositional logic -- A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata -- Functional data term models and semantic unification -- Modular algebraic specifications -- Proving inductive theorems based on term rewriting systems -- Jungle evaluation for efficient term rewriting -- A new quasi-reducibility testing algorithm and its application to proofs by induction -- Fuzzy reasoning based on f-horn clause rules -- Babel: A functional and logic programming language based on constructor discipline and narrowing -- Refined compilation of pattern-matching for functional languages -- Narrowing in partial conditional equational theories -- Solving equations in an equational language -- Nonstandard logics of recursive programs and denotational semantics. . 330 $aThis volume contains the proceedings of the First International Workshop on Algebraic and Logic Programming held in Gaussig (German Democratic Republic) from November 14 to 18, 1988. The workshop was devoted to Algebraic Programming, in the sense of programming by algebraic specifications and rewrite rule systems, and Logic Programming, in the sense of Horn clause specifications and resolution systems. This includes combined algebraic/logic programming systems, mutual relations and mutual implementation of programming paradigms, completeness and efficiency considerations in both fields, as well as related topics. 410 0$aLecture notes in computer science ;$v343. 606 $aLogic programming$vCongresses 615 0$aLogic programming 676 $a005.115 702 $aGrabowski$b J$g(Jan), 702 $aLescanne$b Pierre 702 $aWechler$b Wolfgang 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465313103316 996 $aAlgebraic and logic programming$91492537 997 $aUNISA