|
|
|
|
| LEADER |
03204nam a22005535i 4500 |
| 001 |
978-3-540-35632-5 |
| 003 |
DE-He213 |
| 005 |
20151204183724.0 |
| 007 |
cr nn 008mamaa |
| 008 |
110215s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540356325
|9 978-3-540-35632-5
|
| 024 |
7 |
|
|a 10.1007/11783596
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.758
|
| 072 |
|
7 |
|a UMZ
|2 bicssc
|
| 072 |
|
7 |
|a UL
|2 bicssc
|
| 072 |
|
7 |
|a COM051230
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Mathematics of Program Construction
|h [electronic resource] :
|b 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006. Proceedings /
|c edited by Tarmo Uustalu.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2006.
|
| 300 |
|
|
|a X, 458 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4014
|
| 505 |
0 |
|
|a Invited 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 700 |
1 |
|
|a Uustalu, Tarmo.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540356318
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4014
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11783596
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
