Mathematics of Program Construction Second International Conference, Oxford, U.K., June 29 - July 3, 1992. Proceedings

Mathematics of Program Construction Second International Conference, Oxford, U.K., June 29 - July 3, 1992. Proceedings / edited by Richard S. Bird, C.Carroll Morgan, James C.P. Woodcock.

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...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Bird, Richard S. (Editor), Morgan, C.Carroll (Editor), Woodcock, James C.P (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1993.
Edition:1st ed. 1993.
Series:Lecture Notes in Computer Science, 669
Springer eBook Collection.
Subjects:
Software engineering.
Computers.
Applied mathematics.
Engineering mathematics.
Computer programming.
Algorithms.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items