|
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910483383503321 |
|
|
Titolo |
Mathematics of program construction : 8th international conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006 : proceedings / / Tarmo Uustalu (ed.) |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2006.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 458 p.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science, , 0302-9743 ; ; 4014 |
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer programming |
Computer science - Mathematics |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
|
| |