04353nam 22006615 450 99646609930331620200701024827.03-540-39302-110.1007/3-540-15198-2(CKB)1000000000230423(SSID)ssj0000324678(PQKBManifestationID)11912690(PQKBTitleCode)TC0000324678(PQKBWorkID)10313220(PQKB)10467900(DE-He213)978-3-540-39302-3(PPN)155192493(EXLCZ)99100000000023042320121227d1985 u| 0engurnn|008mamaatxtccrMathematical Foundations of Software Development. Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, March 25-29, 1985[electronic resource] Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'85) /edited by Hartmut Ehrig, Christiane Floyd, Maurice Nivat, James Thatcher1st ed. 1985.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1985.1 online resource (XVIII, 422 p.) Lecture Notes in Computer Science,0302-9743 ;185Bibliographic Level Mode of Issuance: Monograph3-540-15198-2 Specification 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.Lecture Notes in Computer Science,0302-9743 ;185ComputersSoftware engineeringComputer logicCombinatoricsTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Software Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XCombinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Computers.Software engineering.Computer logic.Combinatorics.Theory of Computation.Software Engineering.Logics and Meanings of Programs.Combinatorics.004.0151Ehrig Hartmutedthttp://id.loc.gov/vocabulary/relators/edtFloyd Christianeedthttp://id.loc.gov/vocabulary/relators/edtNivat Mauriceedthttp://id.loc.gov/vocabulary/relators/edtThatcher Jamesedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466099303316MATHEMATICAL foundations of software development343707UNISA