Relations between programs with different storage requirements

  • M. D. Harrison
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. 1.
    R. E. Milne and C. Strachey, A Theory of Programming Language Semantics. Chapman and Hall (Late 1976).Google Scholar
  2. 2.
    C. Strachey and C. Wadsworth, Continuations: A mathematical semantics for handling full jumps. Tech. Monog. PRG-11 Prog.Res.Group. Oxford 1974.Google Scholar
  3. 3.
    C. A. R. Hoare, Proof of a structured program: "The Sieve of Erosthenes". Computer Journal 15 4 November 1972.Google Scholar
  4. 4.
    J. Darlington, A Semantic approach to automatic program improvement. Exp.Prog.Reps. 27 School of A.I. Edinburgh 1972.Google Scholar
  5. 5.
    B. Liskov and S. Zilles, Programming with Abstract Data Types. SIGPLAN Notice 9:4 1974.Google Scholar
  6. 6.
    M. D. Harrison, D.Phil. Thesis in preparation. Late 1976 Oxford.Google Scholar
  7. 7.
    D. Scott, Data Types as Lattices, Theoretical Computer Science, 1976.Google Scholar
  8. 8.
    J. Reynolds, On the Relation between direct and continuation semantics. Lecture Notes in Computer Science, vol. 14, Springer-Verlag (1974) pp. 141–156.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • M. D. Harrison
    • 1
  1. 1.Oxford University Computing LaboratoryProgramming Research GroupOxfordEngland

Personalised recommendations