LEADER 04353nam  22006615  450 
001 996466099303316
005 20200701024827.0
010   $a3-540-39302-1
024 7 $a10.1007/3-540-15198-2
035   $a(CKB)1000000000230423
035   $a(SSID)ssj0000324678
035   $a(PQKBManifestationID)11912690
035   $a(PQKBTitleCode)TC0000324678
035   $a(PQKBWorkID)10313220
035   $a(PQKB)10467900
035   $a(DE-He213)978-3-540-39302-3
035   $a(PPN)155192493
035   $a(EXLCZ)991000000000230423
100   $a20121227d1985      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aMathematical Foundations of Software Development. Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, March 25-29, 1985$b[electronic resource] $eVolume 1: Colloquium on Trees in Algebra and Programming (CAAP'85) /$fedited by Hartmut Ehrig, Christiane Floyd, Maurice Nivat, James Thatcher
205   $a1st ed. 1985.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1985.
215   $a1 online resource (XVIII, 422 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v185
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-15198-2 
327   $aSpecification and top down design of distributed systems -- Specification languages for distributed systems -- Semantically based programming tools (Summary) -- From function level semantics to program transformation and optimization -- Inductively defined functions -- Three approaches to type structure -- On the maximum size of random trees -- Fast searching in a real algebraic manifold with applications to geometric complexity -- Typed categorical combinatory logic -- A path ordering for proving termination of term rewriting systems -- A rewrite rule based approach for synthesizing abstract data types -- ?Delayability? in proofs of strong normalizability in the typed lambda Calculus -- Bisimulations and abstraction homomorphisms -- A metric characterization of fair computations in CCS -- A complete modal proof system for a subset of SCCS -- Amalgamation of graph transformations with applications to synchronization -- Decompilation of control structures by means of graph transformations -- Synchronized bottom-up tree automata and L-systems -- On observational equivalence and algebraic specification -- Parameter preserving data type specifications -- On the parameterized algebraic specification of concurrent systems -- The semantics of shared submodules specifications -- Why Horn formulas matter in computer science: Initial structures and generic examples -- On the implementation of abstract data types by programming language constructs -- A LISP compiler for FP language and its proof via algebraic semantics.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v185
606   $aComputers
606   $aSoftware engineering
606   $aComputer logic
606   $aCombinatorics
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
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   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
615  0$aComputers.
615  0$aSoftware engineering.
615  0$aComputer logic.
615  0$aCombinatorics.
615 14$aTheory of Computation.
615 24$aSoftware Engineering.
615 24$aLogics and Meanings of Programs.
615 24$aCombinatorics.
676   $a004.0151
702   $aEhrig$b Hartmut$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aFloyd$b Christiane$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aNivat$b Maurice$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aThatcher$b James$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466099303316
996   $aMATHEMATICAL foundations of software development$9343707
997   $aUNISA