04009nam 22006135 450 99646597190331620200706055440.03-540-47746-210.1007/3-540-17660-8(CKB)1000000000230609(SSID)ssj0000327119(PQKBManifestationID)11213079(PQKBTitleCode)TC0000327119(PQKBWorkID)10299180(PQKB)11224573(DE-He213)978-3-540-47746-4(PPN)155223984(EXLCZ)99100000000023060920121227d1987 u| 0engurnn|008mamaatxtccrTAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987[electronic resource] Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP '87) /edited by Hartmut Ehrig, Robert Kowalski, Giorgio Levi, Ugo Montanari1st ed. 1987.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1987.1 online resource (XVIII, 294 p.) Lecture Notes in Computer Science,0302-9743 ;249Bibliographic Level Mode of Issuance: Monograph3-540-17660-8 On 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.Lecture Notes in Computer Science,0302-9743 ;249Software engineeringComputer logicMathematical logicSoftware Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Software engineering.Computer logic.Mathematical logic.Software Engineering.Logics and Meanings of Programs.Mathematical Logic and Formal Languages.005.1Ehrig Hartmutedthttp://id.loc.gov/vocabulary/relators/edtKowalski Robertedthttp://id.loc.gov/vocabulary/relators/edtLevi Giorgioedthttp://id.loc.gov/vocabulary/relators/edtMontanari Ugoedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465971903316TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 19872830624UNISA