Mark P. Jones (auth.), Roland Backhouse, José Nuno Oliveira (eds.)3540677275, 9783540677277
This volume contains the proceedings of MPC 2000, the ?fth international c- ference on Mathematics of Program Construction. This series of conferences aims to promote the development of mathematical principles and techniques that are demonstrably useful and usable in the process of constructing c- puter programs (whether implemented in hardware or software). The focus is on techniques that combine precision with concision, enabling programs to be constructed by formal calculation. Within this theme, the scope of the series is very diverse, including programming methodology, program speci?cation and transformation, programming paradigms, programming calculi, and progr- ming language semantics. The quality of the papers submitted to the conference was in general very high. However,the number of submissions has decreased compared to the pre- ous conferences in the series. Each paper was refereed by at least ?ve and often more committee members. In order to maintain the high standards of the c- ference the committee took a stringent view on quality; this has meant that, in some cases, a paper was rejected even though there was a basis for a good c- ference or journal paper but the submitted paper did not meet the committee’s required standards. In a few cases a good paper was rejected on the grounds that it did not ?t within the scope of the conference. |
Table of contents :
Front Matter….Pages –
Integrating Programming, Properties, and Validation….Pages 1-1
Polytypic Values Possess Polykinded Types….Pages 2-27
The Zip Calculus….Pages 28-44
Separation and Reduction….Pages 45-59
Reasoning about Non-terminating Loops Using Deadline Commands….Pages 60-79
Quantum Programming….Pages 80-99
Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series….Pages 100-101
Proving Pointer Programs in Hoare Logic….Pages 102-126
On Guarded Commands with Fair Choice….Pages 127-139
Formal Methods and Dependability….Pages 140-143
Liberating Data Refinement….Pages 144-166
Theorems about Composition….Pages 167-186
The Universal Resolving Algorithm: Inverse Computation in a Functional Language….Pages 187-212
Metacomputation-Based Compiler Architecture….Pages 213-229
A Metalanguage for Programming with Bound Names Modulo Renaming….Pages 230-255
Back Matter….Pages – |
Reviews
There are no reviews yet.