Mathematics of Program Construction

5th International Conference, MPC 2000 Ponte de Lima, Portugal, July 3-5, 2000 Proceedings

Roland Backhouse, Jose Nuno Oliveira (Herausgeber)

Buch | Softcover

X, 262 Seiten

2000 | 2000
Springer Berlin (Verlag)
978-3-540-67727-7 (ISBN)

Artikel merken

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.

Integrating Programming, Properties, and Validation.- Polytypic Values Possess Polykinded Types.- The Zip Calculus.- Separation and Reduction.- Reasoning about Non-terminating Loops Using Deadline Commands.- Quantum Programming.- Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series.- Proving Pointer Programs in Hoare Logic.- On Guarded Commands with Fair Choice.- Formal Methods and Dependability.- Liberating Data Refinement.- Theorems about Composition.- The Universal Resolving Algorithm: Inverse Computation in a Functional Language.- Metacomputation-Based Compiler Architecture.- A Metalanguage for Programming with Bound Names Modulo Renaming.

Erscheint lt. Verlag	21.6.2000
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	X, 262 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 233 mm
Gewicht	415 g
Themenwelt	Mathematik / Informatik ► Informatik ► Software Entwicklung
Themenwelt	Informatik ► Theorie / Studium ► Compilerbau
Schlagworte	algorithms • Automata • Compiler • D programming language • Formal Method • formal methods • Program Development • Program Logics • programming • Programming language • Programming Theory • Program Semantics • Program specification • Regular Expressions • Semantics
ISBN-10	3-540-67727-5 / 3540677275
ISBN-13	978-3-540-67727-7 / 9783540677277
Zustand	Neuware