000 | 03365nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-35632-5 | ||
003 | DE-He213 | ||
005 | 20240730184621.0 | ||
007 | cr nn 008mamaa | ||
008 | 110215s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540356325 _9978-3-540-35632-5 |
||
024 | 7 |
_a10.1007/11783596 _2doi |
|
050 | 4 | _aQA76.758 | |
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aCOM051230 _2bisacsh |
|
072 | 7 |
_aUMZ _2thema |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aMathematics of Program Construction _h[electronic resource] : _b8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006, Proceedings / _cedited by Tarmo Uustalu. |
250 | _a1st ed. 2006. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
300 |
_aX, 458 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4014 |
|
505 | 0 | _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. | |
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aMachine theory. _9136060 |
|
650 | 0 |
_aCompilers (Computer programs). _93350 |
|
650 | 1 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9136061 |
650 | 2 | 4 |
_aTheory of Computation. _9136062 |
650 | 2 | 4 |
_aCompilers and Interpreters. _931853 |
700 | 1 |
_aUustalu, Tarmo. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9136063 |
|
710 | 2 |
_aSpringerLink (Online service) _9136064 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540356318 |
776 | 0 | 8 |
_iPrinted edition: _z9783540825975 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4014 _9136065 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11783596 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c92395 _d92395 |