Mathematics of program construction : 375th anniversary of the Groningen university, international conference, Groningen, The Netherlands, June 26-30, 1989 : proceedings
The papers included in this volume were presented at the Conference on Mathematics of Program Construction held from June 26 to 30, 1989. The conference was organized by the Department of Computing Science, Groningen University, The Netherlands, at the occasion of the University's 375th anniver...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
375 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
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, 375th anniversary of the Groningen university, international conference, Groningen, The Netherlands, June 26-30, 1989, proceedings, J.L.A. van de Snepscheut (ed.), Berlin, Springer-Verlag, 1989, 1 vol. (VI-420 p.), Lecture notes in computer science, 3-540-51305-1 • Mathematics of Program Construction, Texte imprimé, 9783662206485 |
Obsah:
- A formal approach to large SOFTWARE CONSTRUCTION
- Mathematics of program construction applied to analog neural networks
- Termination is timing
- Towards totally verified systems
- Constructing a calculus of programs
- Specifications of concurrently accessed data
- Stepwise refinement of action systems
- A lattice-theoretical basis for a specification language
- Transformational programming and forests
- Networks of communicating processes and their (De-)composition
- Towards a calculus of data refinement
- Stepwise refinement and concurrency: A small exercise
- Deriving mixed evaluation from standard evaluation for a simple functional language
- Realizability models for program construction
- Initialisation with a final value, an exercise in program transformation
- A derivation of a systolic rank order filter with constant response time
- Searching by elimination
- The projection of systolic programs
- The formal construction of a parallel triangular system solver
- Homomorphisms and promotability
- Applicative assertions
- Types and invariants in the refinement calculus
- Algorithm theories and design tactics
- A categorical approach to the theory of lists
- Rabbitcounrt :=Rabbitcount 1.