LEADER 05702nam 22007335 450 001 996465335203316 005 20200702024024.0 010 $a3-540-46191-4 024 7 $a10.1007/3-540-51305-1 035 $a(CKB)1000000000233406 035 $a(SSID)ssj0000324708 035 $a(PQKBManifestationID)11239162 035 $a(PQKBTitleCode)TC0000324708 035 $a(PQKBWorkID)10315538 035 $a(PQKB)10983334 035 $a(DE-He213)978-3-540-46191-3 035 $a(PPN)155192469 035 $a(EXLCZ)991000000000233406 100 $a20121227d1989 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aMathematics of Program Construction$b[electronic resource] $e375th Anniversary of the Groningen University. International Conference, Groningen, The Netherlands, June 26-30, 1989 Proceedings /$fedited by Jan L.A. van de Snepscheut 205 $a1st ed. 1989. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1989. 215 $a1 online resource (XII, 428 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v375 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-51305-1 327 $aA formal approach to large SOFTWARE CONSTRUCTION -- Mathematics of program construction applied to analog neural networks -- Termination is timing -- Towards totally verified systems -- Constructing a calculus of programs -- Specifications of concurrently accessed data -- Stepwise refinement of action systems -- A lattice-theoretical basis for a specification language -- Transformational programming and forests -- Networks of communicating processes and their (De-)composition -- Towards a calculus of data refinement -- Stepwise refinement and concurrency: A small exercise -- Deriving mixed evaluation from standard evaluation for a simple functional language -- Realizability models for program construction -- Initialisation with a final value, an exercise in program transformation -- A derivation of a systolic rank order filter with constant response time -- Searching by elimination -- The projection of systolic programs -- The formal construction of a parallel triangular system solver -- Homomorphisms and promotability -- Applicative assertions -- Types and invariants in the refinement calculus -- Algorithm theories and design tactics -- A categorical approach to the theory of lists -- Rabbitcounrt :=Rabbitcount ? 1. 330 $aThe papers included in this volume were presented at the Conference on Mathematics of Program Construction held from June 26 to 30, 1989. The conference was organized by the Department of Computing Science, Groningen University, The Netherlands, at the occasion of the University's 375th anniversary. The creative inspiration of the modern computer has led to the development of new mathematics, the mathematics of program construction. Initially concerned with the posterior verification of computer programs, the mathematics have now matured to the point where they are actively being used for the discovery of elegant solutions to new programming problems. Initially concerned specifically with imperative programming, the application of mathematical methodologies is now established as an essential part of all programming paradigms - functional, logic and object-oriented programming, modularity and type structure etc. Initially concerned with software only, the mathematics are also finding fruit in hardware design so that the traditional boundaries between the two disciplines have become blurred. The varieties of mathematics of program construction are wide-ranging. They include calculi for the specification of sequential and concurrent programs, program transformation and analysis methodologies, and formal inference systems for the construction and analysis of programs. The mathematics of specification, implementation and analysis have become indispensable tools for practical programming. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v375 606 $aComputer programming 606 $aSoftware engineering 606 $aComputer logic 606 $aMathematical logic 606 $aAlgorithms 606 $aMicroprocessors 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 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 606 $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018 606 $aProcessor Architectures$3https://scigraph.springernature.com/ontologies/product-market-codes/I13014 615 0$aComputer programming. 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aAlgorithms. 615 0$aMicroprocessors. 615 14$aProgramming Techniques. 615 24$aSoftware Engineering. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aAlgorithms. 615 24$aProcessor Architectures. 676 $a005.11 702 $aSnepscheut$b Jan L.A. van de$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465335203316 996 $aMathematics of Program Construction$9772229 997 $aUNISA