LEADER 06676nam 22007455 450 001 996465489103316 005 20200629123523.0 010 $a3-540-47297-5 024 7 $a10.1007/3-540-55844-6 035 $a(CKB)1000000000233862 035 $a(SSID)ssj0000325916 035 $a(PQKBManifestationID)11265479 035 $a(PQKBTitleCode)TC0000325916 035 $a(PQKBWorkID)10265034 035 $a(PQKB)11745640 035 $a(DE-He213)978-3-540-47297-1 035 $a(PPN)15522042X 035 $a(EXLCZ)991000000000233862 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aProgramming Language Implementation and Logic Programming$b[electronic resource] $e4th International Symposium, PLILP ?92, Leuven, Belgium, August 26?28, 1992 Proceedings /$fedited by Maurice Bruynooghe, Martin Wirsing 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (XI, 494 p. 27 illus.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v631 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-55844-6 327 $aImproving control of logic programs by using functional logic languages -- Independent AND-parallel implementation of narrowing -- Binding techniques and garbage collection for OR-parallel CLP systems -- Path analysis for lazy data structures -- Why the occur-check is not a problem -- Incremental evaluation of natural semantics specifications -- Subsumption-oriented Push-Down Automata -- Unlimp uniqueness as a leitmotiv for implementation -- Using cached functions and constructors for incremental attribute evaluation -- Strictness analysis for attribute grammars -- Checking and debugging of two-level grammars -- On safe folding -- Unfold/fold transformations preserving termination properties -- A technique for transforming logic programs by fold-unfold transformations -- FOLON: An environment for declarative construction of logic programs -- A complete indexing scheme for WAM-based abstract machines -- Fast prolog with a VAM1p based Prolog compiler -- Metastructures vs. attributed variables in the context of extensible unification -- Comparing the Galois connection and widening/narrowing approaches to abstract interpretation -- Derivation of linear size relations by abstract interpretation -- Generic abstract interpretation algorithms for prolog: Two optimization techniques and their experimental evaluation -- A bottom-up interpreter for a higher-order logic programming language -- Camel: An extension of the categorical abstract machine to compile functional/logic programs -- On the interaction of lazy evaluation and backtracking -- Interprocedural dynamic slicing -- Algorithmic debugging for lazy functional languages -- A general trace query mechanism based on Prolog -- Fully declarative logic programming -- Our LIPS are sealed: Interfacing functional and logic programming systems -- Analyses of inconsistency for incremental equational logic programming -- I/O trees and interactive lazy functional programming -- UCG-E: An equational logic programming system -- A relational programming system with inferred representations -- An implementation of action semantics (Summary) -- BinProlog: A continuation passing style Prolog engine -- LaToKi: A language toolkit for bottom-Up evaluation of functional programs -- Implementing higher-order functions in an algebraic specification language with narrowing -- Implementing attribute grammars by computational models -- ProQuery: Logical access to an OODB -- Inference of inheritance relationships from Prolog programs: a system developed with PrologIII -- CLP(PB). 330 $aThis volume contains the papers accepted for presentation at the Fourth International Symposium on Programming Language Implementation and Logic Programming (PLILP '92) held in Leuven, Belgium, August 26-28, 1992. Theaim of the symposium was to explore new declarative concepts, methods and techniques relevant for implementation of all kinds of programming languages, whether algorithmic or declarative. The symposium gathered researchers from the fields of algorithmic programming languages as well as logic, functional, and object-oriented programming. The topics discussed in the volume include: - Declarative implementation techniques; - Implementation of declarative concepts and modules; - Compiler specification and construction; - Program transformation; - Programming environments for declarative languages; - Amalgamation of logic programming with algorithmic, functional, or object-oriented techniques; - Executable specification. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v631 606 $aComputer programming 606 $aComputers 606 $aProgramming languages (Electronic computers) 606 $aComputer logic 606 $aMathematical logic 606 $aArtificial intelligence 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 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 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aComputer programming. 615 0$aComputers. 615 0$aProgramming languages (Electronic computers). 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aArtificial intelligence. 615 14$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aArtificial Intelligence. 676 $a005.11 702 $aBruynooghe$b Maurice$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWirsing$b Martin$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465489103316 996 $aProgramming Language Implementation and Logic Programming$92829960 997 $aUNISA