LEADER 05678nam 22006975 450 001 996465485803316 005 20200629120555.0 010 $a3-540-47302-5 024 7 $a10.1007/BFb0013814 035 $a(CKB)1000000000233865 035 $a(SSID)ssj0000321086 035 $a(PQKBManifestationID)11220350 035 $a(PQKBTitleCode)TC0000321086 035 $a(PQKBWorkID)10262414 035 $a(PQKB)11296399 035 $a(DE-He213)978-3-540-47302-2 035 $a(PPN)155228005 035 $a(EXLCZ)991000000000233865 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgebraic and Logic Programming$b[electronic resource] $eThird International Conference, Volterra, Italy, September 2-4, 1992. Proceedings /$fedited by Helene Kirchner, Giorgio Levi 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (IX, 460 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v632 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-55873-X 327 $aOutline of an object-oriented calculus of higher type -- High-level-replacement systems for equational algebraic specifications -- Termination of rewrite systems by elementary interpretations -- Termination of order-sorted rewriting -- Generalized sufficient conditions for modular termination of rewriting -- A theory of first-order built-in's of prolog -- Fixpoint semantics for partial computed answer substitutions and call patterns -- Oracle semantics for Prologa -- On the relation between primitive recursion, schematization, and divergence -- Term rewriting with sharing and memoïzation -- Definitional trees -- Multiparadigm logic programming -- Non-linear real constraints in constraint logic programming -- A general scheme for constraint functional logic programming -- Incremental rewriting in narrowing derivations -- Counterexamples to completeness results for basic narrowing (extended abstract) -- Uniform narrowing strategies -- Proof by consistency in constructive systems with final algebra semantics -- A fast algorithm for ground normal form analysis -- Eta-conversion for the languages of explicit substitutions -- Serialisation analysis of concurrent logic programs -- Implementation of a toolset for prototyping algebraic specifications of concurrent systems -- Axiomatizing permutation equivalence in the ?-calculus -- A CLP view of logic programming -- Partial deduction of logic programs WRT well-founded semantics -- The finiteness of logic programming derivations -- Theorem proving for hierarchic first-order theories -- A goal oriented strategy based on completion -- On n-syntactic equational theories. 330 $aThis volume contains the proceedings of the Third International Conference on Algebraic and Logic Programming, held in Pisa, Italy, September 2-4, 1992. Like the two previous conferences in Germany in 1988 and France in 1990, the third conference aims at strengthening the connections betweenalgebraic techniques and logic programming. On the one hand, logic programming has been very successful during the last decades and more and more systems compete in enhancing its expressive power. On the other hand, concepts like functions, equality theory, and modularity are particularly well handled in an algebraic framework. Common foundations of both approaches have recently been developed, and this conference is a forum for people from both areas to exchange ideas, results, and experiences. The book covers the following topics: semantics ofalgebraic and logic programming; integration of functional and logic programming; term rewriting, narrowing, and resolution; constraintlogic programming and theorem proving; concurrent features in algebraic and logic programming languages; and implementation issues. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v632 606 $aComputers 606 $aSoftware engineering 606 $aProgramming languages (Electronic computers) 606 $aComputer logic 606 $aMathematical logic 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aProgramming languages (Electronic computers). 615 0$aComputer logic. 615 0$aMathematical logic. 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 676 $a005.13/1 702 $aKirchner$b Helene$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLevi$b Giorgio$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465485803316 996 $aAlgebraic and logic programming$91492537 997 $aUNISA