Mathematics of program construction. 375th anniversary of the Groningen University, international conference, Groningen, Netherlands, June 26-30, 1989. Proceedings (Q1187672)

[The articles of this volume will not be indexed individually.] The volume provides the proceedings of the conference held in 1989 at the occasion of the 375th anniversary of Groningen University. The main topic of the conference was ``Mathematics of program construction'' and that was also its title, however some close topics as calculi for the specification and analysis of sequential and concurrent programming, logics of programs etc. were also presented. Unlike many other conference on Mathematics in Computer Science that conference avoided their typical defect i.e. too many subjects. In 6 invited lectures and 19 contributed papers the reader can find a great number of common problems, first of all concerning program construction with the use of mathematics. The most remarkable in that field are the following articles: Mathematics of program construction applied to analog neural networks, by \textit{K. M. Chandy}, Constructing a calculus of programs, by \textit{L. Meertens}, Specification of concurrently accessed data, by \textit{J. Misra}, Stepwise refinement of action systems, by \textit{R. Back} and \textit{K. Sere}, Initialisation with a final value, by \textit{W. Hesselink}, A derivation of a systolic rank order filter with constant response time, by \textit{A. Kaldewaij} and \textit{M. Rem}, Searching by elimination by \textit{A. Kaldewaij} and \textit{B. Schoenmakers}, The projection of systolic programs, by \textit{C. Lengauer} and \textit{J. Sanders}, The formal construction of a parallel triangular system solver, by \textit{L. Loyens} and \textit{R. Bisseling}, Rabbitcount:=Rabbitcount-1 (finding the largest rectangle under a histogram), by \textit{J. van der Woude}. All these articles provide interesting partical examples. There are also a number of more abstract papers concerning formal inference systems. Among them it is worth to read: A lattice-theoretic basis for a specification language, by \textit{R. Back} and \textit{J. von Wright}, Transformational programming and forests, by \textit{A. Bijlsma}, Towards a calculus of data refinement, by \textit{W. Chen} and \textit{J. Udding}, Homomorphism and promotability, by \textit{G. Malcolm}, Applicative assertions by \textit{B. Möller} and A categorical approach to the theory of lists, by \textit{M. Spivey}. Reading these proceedings one feels that the conference was fruitful.