Program production by successive transformation

  • M. Griffiths
Chapter 2.: Program Development
Part of the Lecture Notes in Computer Science book series (LNCS, volume 46)


Machine Intelligence Recursive Call Program Scheme Successive Transformation Iterative Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. D.W. BARRON Recursive Techniques in Programming Macdonald Computer Monographs, 1968Google Scholar
  2. F.L. BAUER Variables Considered Harmful Seminar, TU Munich, 1974Google Scholar
  3. F.L. BAUER A Philosophy of Programming TU Munich, 1975Google Scholar
  4. F.L. BAUER Marktoberdorf, 1975 (b)Google Scholar
  5. R.M. BURSTALL, J. DARLINGTON Some Transformations for Developping Recursive Programs SIGPLAN Notices 10, 6, June 1975Google Scholar
  6. D.C. COOPER The Equivalence of Certain Computations Comp. Jnl. May 1966Google Scholar
  7. J. COURTIN, J. VOIRON Introduction à l'Algorithmique et aux structures de données Université de Grenoble, 1975Google Scholar
  8. O.J. DAHL, E.W. DIJKSTRA, C.A.R. HOARE Structured Programming Academic Press, 1972Google Scholar
  9. J. DARLINGTON, R.M. BURSTALL A System which Automatically Improves Programs 3rd Int. Conf. on Artificial Intelligence, Stanford, Aug. 1973Google Scholar
  10. E.W. ELCOCK Descriptions in Machine Intelligence, 3, Edinburgh University Press, 1968Google Scholar
  11. E.W. ELCOCK, J.M. FOSTER, P.M.D. GRAY, J.J. MGGREGOR, A.M. MURRAY ABSET-A Programming Language Based on Sets: Motivation and Examples in Machine Intelligence, 6, Edinburgh University Press, 1971Google Scholar
  12. A.P. ERSHOV Problems in Many-Language Systems Marktoberdorf, 1975Google Scholar
  13. R.W. FLOYD Assigning Meanings to Programs Proc. Symposium in Appl. Maths., AMS, New York, 1967Google Scholar
  14. J.M. FOSTER Assertions: Programs Written Without Specifying Unnecessary Order in Machine Intelligence, 3, Edinburgh University Press, 1968Google Scholar
  15. J.M. FOSTER, E.W. ELCOCK ABSYS 1: An Incremental Compiler for Assertions; An introduction in Machine Intelligence, 4, Edinburgh University Press, 1969Google Scholar
  16. S.J. GARLAND, D.C. LUCKHAM Program Schemes, Recursion Schemes and Formal Languages UCLA-ENG-7154, University of California, 1971Google Scholar
  17. D. GRIES Recursion as a Programming Technique Cornell, April 1975Google Scholar
  18. M. GRIFFITHS Relationship between Language Definition and Implementation in Advanced Course in Software Engineering, Springer-Verlag, 1973Google Scholar
  19. C.A.R. HOARE An Axiomatic Basic for Computer Programming CACM, 1969Google Scholar
  20. D.E. KNUTH Semantics of Context-Free Languages (a) Math. Sys. Theory, Vol. 2, no 2, 1968Google Scholar
  21. D.E. KNUTH Semantics of Context-Free Languages (b) Math. Sys. Theory, Vol. 5, no 1, 1971Google Scholar
  22. D.E. KNUTH The Art of Computer Programming, Vol. 1 Addison Wesley, 1973Google Scholar
  23. D.E. KNUTH Structured Programming with GOTO Statements ACM Comp. Surveys, Dec. 1974Google Scholar
  24. H. KRÖGER Bemerkungen zur Auflösung von Rekursionen Seminar, TU Munich, 1974Google Scholar
  25. Z. MANNA Mathematical Theory of Computation McGraw Hill, 1974Google Scholar
  26. R. RUSTIN (ed.) Design and Optimization of Compilers Prentice Hall, 1972Google Scholar
  27. T.B. STEEL UNCOL: The Myth and the Fact Ann. Rev. in Aut. Prog., 2, 1961Google Scholar
  28. H.R. STRONG Translation of Recursion Equations into Flowcharts JCSS, June 1971Google Scholar
  29. G. VEILLON Transformation de Programmes Récursifs Grenoble, 1975Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • M. Griffiths
    • 1
  1. 1.Université de GrenobleFrance

Personalised recommendations