Mathematics of program construction : third international conference, MPC '95, Kloster Irsee, Germany, July 17-21, 1995 : proceedings
This volume constitutes the proceedings of the Third International Conference on the Mathematics of Program Construction, held at Kloster Irsee, Germany in July 1995. Besides five invited lectures by distinguished researchers there are presented 19 full revised papers selected from a total of 58 sub...
Αποθηκεύτηκε σε:
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Livre numérique |
| Γλώσσα: | Anglais |
| Έκδοση: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Σειρά: | Lecture notes in computer science
947 |
| Θέματα: | |
| Διαθέσιμο Online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Σημείωση: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Mathematics of Program Construction, Texte imprimé, 9783540601173 • Mathematics of Program Construction, Texte imprimé, 9783662169636 |
Πίνακας περιεχομένων:
- Towards automatic parallelization of logic programs
- Functional Algorithm Design
- Mathematics of software engineering
- Program construction in intuitionistic Type Theory
- Computer-aided computing
- Derivation of parallel algorithms from functional specifications to CSP processes
- Architecture independent massive parallelization of divide-and-conquer algorithms
- Exploring summation and product operators in the refinement calculus
- An action system specification of the caltech asynchronous microprocessor
- Formal derivation of CSP programs from temporal specifications
- A compositional proof system for asynchronously communicating processes
- A graphical calculus
- A simple, efficient, and flexible implementation of flexible arrays
- Induction and recursion on datatypes
- Program construction by parts
- An initial-algebra approach to directed acyclic graphs
- Algebraic proof assistants in HOL
- Angelic termination in Dijkstra's calculus
- Extracting programs with exceptions in an impredicative type system
- Synthesizing proofs from programs in the Calculus of Inductive Constructions
- A general scheme for breadth-first graph traversal
- Specware: Formal support for composing software
- A refinement relation supporting the transition from unbounded to bounded communication buffers
- ImpUNITY: UNITY with procedures and local variables.