1. Completeness of hoare-calculi revisited

   • Bjørn Kirkerud

   Part I Computer Science Pages: 401 - 418

2. Access mechanisms in block structured environments

   • Mats Löfgren
   • Boris Magnusson

   Part I Computer Science Pages: 419 - 436

3. Formalization in program development

   • Peter Naur

   Part I Computer Science Pages: 437 - 453

4. An improvement of the binary merge algorithm

   • Mai Thanh
   • T. D. Bui

   Part I Computer Science Pages: 454 - 462

5. P-stable andP[α, β]-stable integration/interpolation methods in the solution of retarded differential-difference equations

   • Theodore A. Bickart

   Part II Numerical Mathematics Pages: 463 - 476

6. Blending product-type quadrature rules

   • Wolfgang Bunse

   Part II Numerical Mathematics Pages: 477 - 486

7. A weighted pseudoinverse, generalized singular values, and constrained least squares problems

   • Lars Eldén

   Part II Numerical Mathematics Pages: 487 - 502

8. On the optimal error of algorithms for solving a scalar autonomous ode

   • Bolesław Kacewicz

   Part II Numerical Mathematics Pages: 503 - 518

9. The continued fraction methods for the solution of systems of linear equations

   • Gunhild Lindskog

   Part II Numerical Mathematics Pages: 519 - 527

10. A short proof concerningB-stability

    • J. C. Butcher

    Scientific Notes Pages: 528 - 529

11. An upper bound for the Gauss-Legendre quadrature error for analytic functions

    • T. H. Charles Chen

    Scientific Notes Pages: 530 - 532

12. Nonhomogeneous recursions and Generalised Continued Fractions

    • P. van der Cruyssen

    Scientific Notes Pages: 533 - 537

13. A prime gap of 682 and a prime arithmetic sequence

    • S. Weintraub

    Scientific Notes Pages: 538 - 538

14. Problems

    Legacy Pages: 539 - 539

15. New books and journals

    Announcement Pages: 540 - 540

16. Notes

    Announcement Pages: 540 - 541

17. Acknowledgements

    Acknowledgments Pages: 542 - 542