LEADER 02150nam  22005415  450 
001 996465832903316
005 20200706044954.0
010   $a3-540-47811-6
024 7 $a10.1007/3-540-18217-9
035   $a(CKB)1000000000230658
035   $a(SSID)ssj0000323313
035   $a(PQKBManifestationID)11242987
035   $a(PQKBTitleCode)TC0000323313
035   $a(PQKBWorkID)10299240
035   $a(PQKB)11321242
035   $a(DE-He213)978-3-540-47811-9
035   $a(PPN)155214276
035   $a(EXLCZ)991000000000230658
100   $a20121227d1987      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFrom Logic Design to Logic Programming$b[electronic resource] $eTheorem Proving Techniques and P-Functions /$fby Dominique Snyers, Andre Thayse
205   $a1st ed. 1987.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1987.
215   $a1 online resource (IV, 125 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v271
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-18217-9 
327   $aTheorem in proving and P-functions -- Grammars, logics and declarative programming -- Grammars and Semantics.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v271
606   $aComputer logic
606   $aComputer programming
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
615  0$aComputer logic.
615  0$aComputer programming.
615 14$aLogics and Meanings of Programs.
615 24$aProgramming Techniques.
676   $a005.1015113
700   $aSnyers$b Dominique$4aut$4http://id.loc.gov/vocabulary/relators/aut$059197
702   $aThayse$b Andre$4aut$4http://id.loc.gov/vocabulary/relators/aut
906   $aBOOK
912   $a996465832903316
996   $aFrom logic design to logic programming$9383176
997   $aUNISA