LEADER 03136nam 2200577 a 450 001 9910483383503321 005 20200520144314.0 010 $a3-540-35632-0 024 7 $a10.1007/11783596 035 $a(CKB)1000000000236506 035 $a(SSID)ssj0000318845 035 $a(PQKBManifestationID)11255717 035 $a(PQKBTitleCode)TC0000318845 035 $a(PQKBWorkID)10311325 035 $a(PQKB)10770894 035 $a(DE-He213)978-3-540-35632-5 035 $a(MiAaPQ)EBC3068165 035 $a(PPN)12313627X 035 $a(EXLCZ)991000000000236506 100 $a20060518d2006 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aMathematics of program construction $e8th international conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006 : proceedings /$fTarmo Uustalu (ed.) 205 $a1st ed. 2006. 210 $aBerlin $cSpringer$d2006 215 $a1 online resource (X, 458 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v4014 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-35631-2 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- What Is a Good Process Semantics? -- Refunctionalization at Work -- Aspects and Data Refinement -- Contributed Papers -- Towards Generic Programming with Sized Types -- Relational Semantics for Higher-Order Programs -- Proofs of Randomized Algorithms in Coq -- Exercises in Quantifier Manipulation -- Improving Saddleback Search: A Lesson in Algorithm Design -- Loopless Functional Algorithms -- Compositional Reasoning for Pointer Structures -- Progress in Deriving Concurrent Programs: Emphasizing the Role of Stable Guards -- Fission for Program Comprehension -- ?Scrap Your Boilerplate? Revolutions -- Generic Views on Data Types -- Recursion Schemes for Dynamic Programming -- Bimonadic Semantics for Basic Pattern Matching Calculi -- Nondeterministic Folds -- A Datastructure for Iterated Powers -- Continuous Action System Refinement -- The Linear Algebra of UTP -- The Shadow Knows: Refinement of Ignorance in Sequential Programs -- Swapping Arguments and Results of Recursive Functions -- Refinement Algebra with Operators for Enabledness and Termination -- Constructing Rewrite-Based Decision Procedures for Embeddings and Termination -- Quantum Predicative Programming. 410 0$aLecture notes in computer science ;$v4014. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 517 3 $aMPC 2006 606 $aComputer programming$vCongresses 606 $aComputer science$xMathematics$vCongresses 615 0$aComputer programming 615 0$aComputer science$xMathematics 676 $a005.1 701 $aUustalu$b Tarmo$01754880 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483383503321 996 $aMathematics of program construction$94198195 997 $aUNINA