LEADER 04009nam  22006135  450 
001 996465971903316
005 20200706055440.0
010   $a3-540-47746-2
024 7 $a10.1007/3-540-17660-8
035   $a(CKB)1000000000230609
035   $a(SSID)ssj0000327119
035   $a(PQKBManifestationID)11213079
035   $a(PQKBTitleCode)TC0000327119
035   $a(PQKBWorkID)10299180
035   $a(PQKB)11224573
035   $a(DE-He213)978-3-540-47746-4
035   $a(PPN)155223984
035   $a(EXLCZ)991000000000230609
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 1987$b[electronic resource] $eVolume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP '87) /$fedited by Hartmut Ehrig, Robert Kowalski, Giorgio Levi, Ugo Montanari
205   $a1st ed. 1987.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1987.
215   $a1 online resource (XVIII, 294 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v249
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-17660-8 
327   $aOn the complexity of branching programs and decision trees for clique functions -- Average complexity of additive properties for multiway tries: A unified approach -- Longest common factor of two words -- An unification semi-algorithm for intersection type schemes -- Optimal run time optimization proved by a new look at abstract interpretations -- Transformation ordering -- On parametric algebraic specifications with clean error handling -- Toward formal development of programs from algebraic specifications: Implementations revisited -- Finite algebraic specifications of semicomputable data types -- On the semantics of concurrency: Partial orders and transition systems -- CCS without ?'s -- A fully observational model for infinite behaviours of communicating systems -- SMoLCS-driven concurrent calculi -- Parameterized horn clause specifications: Proof theory and correctness -- Partial composition and recursion of module specifications -- Efficient representation of taxonomies -- Applications of compactness in the Smyth powerdomain of streams -- Characterizing Kripke structures in temporal logic -- Dialogue with a proof system -- Induction principles formalized in the calculus of constructions -- Algebraic semantics.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v249
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$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   $a996465971903316
996   $aTAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987$92830624
997   $aUNISA