LEADER 04096nam  22006135  450 
001 996465964903316
005 20200706060934.0
010   $a3-540-47717-9
024 7 $a10.1007/BFb0014968
035   $a(CKB)1000000000230601
035   $a(SSID)ssj0000327118
035   $a(PQKBManifestationID)11268687
035   $a(PQKBTitleCode)TC0000327118
035   $a(PQKBWorkID)10298427
035   $a(PQKB)10911268
035   $a(DE-He213)978-3-540-47717-4
035   $a(PPN)155203193
035   $a(EXLCZ)991000000000230601
100   $a20121227d1987      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23 - 27 1987$b[electronic resource] $eVolume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Functional and Logic Programming and Specifications (CFLP) /$fedited by Hartmut Ehrig, Robert A. Kowalski, Giorgio Levi, Ugo Montanari
205   $a1st ed. 1987.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1987.
215   $a1 online resource (XIV, 336 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v250
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-17611-X 
327   $aModels and equality for logical programming -- Fifth generation computer project: Current research activity and future plans -- A compositive abstraction algorithm for combinatory logic -- Linear logic and lazy computation -- The natural dynamic semantics of mini-Standard ML -- Listlog ? A PROLOG extension for list processing -- Intensional negation of logic programs: Examples and implementation techniques -- Improving the execution speed of compiled Prolog with modes, clause selection, and determinism -- Simulation results of a multiprocessor PROLOG architecture based on a distributed and/or graph -- Generating efficient code from strictness annotations -- Hoisting: Lazy evaluation in a cold climate -- Inductive assertion method for logic programs -- Higher order generalization in program derivation -- Implementing algebraically specified abstract data types in an imperative programming language -- A declarative environment for concurrent logic programming -- Or-parallel execution models of Prolog -- Retractions: A functional paradigm for logic programming -- Refined strategies for semantic unification -- Extensional models for polymorphism -- A type discipline for program modules -- Theory and practice of canonical term functors in abstract data type specifications.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v250
606   $aSoftware engineering
606   $aComputer logic
606   $aMathematical logic
606   $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029
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$aSoftware engineering.
615  0$aComputer logic.
615  0$aMathematical logic.
615 14$aSoftware Engineering.
615 24$aLogics and Meanings of Programs.
615 24$aMathematical Logic and Formal Languages.
676   $a005.1
702   $aEhrig$b Hartmut$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKowalski$b Robert A$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aLevi$b Giorgio$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aMontanari$b Ugo$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465964903316
996   $aTAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23 - 27 1987$92830078
997   $aUNISA