Mathematics of program construction : second international conference, Oxford, U.K., June 29 July 3, 1992 : proceedings
Not very long ago, the uninhibited use of mathematics in the development of software was regarded as something for academics alone. Today, there is moreand more interest from industry in formal methods based on mathematics. This interest has come from the success of a number of experiments on real i...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
669 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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, second international conference, Oxford, U.K., June/July 1992, proceedings, R.S. bird, C.C. Morgan, J.C.P. Woodcock, eds, Berlin, Springer-Verlag, 1993, 1 vol. (VIII-378 p.), Lecture notes in computer science, 3-540-56625-2 • Mathematics of Program Construction, Texte imprimé, 9783662173107 |
Table des matières:
- Extended calculus of constructions as a specification language
- On the economy of doing Mathematics
- Pretty-printing: An exercise in functional programming
- True concurrency: Theory and practice
- Programming for behaviour
- Calculating a path algorithm
- Solving optimisation problems with catamorphisms
- A time-interval calculus
- Conservative fixpoint functions on a graph
- An algebraic construction of predicate transformers
- Upwards and downwards accumulations on trees
- Distributing a class of sequential programs
- (Relational) programming laws in the boom hierarchy of types
- A logarithmic implementation of flexible arrays
- Designing arithmetic circuits by refinement in Ruby
- An operational semantics for the guarded command language
- Shorter paths to graph algorithms
- Logical specifications for functional programs
- Inorder traversal of a binary heap and its inversion in optimal time and space
- A calculus for predicative programming
- Derivation of a parallel matching algorithm
- Modular reasoning in an object-oriented refinement calculus
- An alternative derivation of a binary heap construction function
- A derivation of Huffman's algorithm.