Advertisement

Transforming recursive programs for execution on parallel machines

  • V. J. Bush
  • J. R. Gurd
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 201)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. {1}.
    Backus J., "Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs", CACM 21(8), August 1978.Google Scholar
  2. {2}.
    Bauer F.L. and Wössner H., Algorithmic Language and Program Development, Springer-Verlag, 1982.Google Scholar
  3. {3}.
    Bird R.S., "Notes on Recursion Elimination", CACM 20(6), June 1977.Google Scholar
  4. {4}.
    Bird R.S., "Improving Programs by the Introduction of Recursion", CACM 20(11), November 1977.Google Scholar
  5. {5}.
    Burstall R.M. and Darlington J., "A Transformation System for Developing Recursive Programs", JACM 24(1), January 1977.Google Scholar
  6. {6}.
    Bush V.J., "A Proof of the Equivalence Between Two Recursive Forms", Dataflow Research Project, Department of Computer Science, University of Manchester, 1985.Google Scholar
  7. {7}.
    Cooper D.C., "The Equivalence of Certain Computations", Computer Journal 9(1), May 1966.Google Scholar
  8. {8}.
    Darlington J. and Burstall R.M., "A System Which Automatically Improves Programs", Acta Informatica 6(1), January 1976.Google Scholar
  9. {9}.
    Darlington J., "Program Transformation", in Darlington J., Henderson P. and Turner D.A. (eds.), Functional Programming and its Applications, Cambridge University Press, 1982.Google Scholar
  10. {10}.
    Darlington J. and Reeve M., "ALICE: A Multi-Processor Reduction Machine for the Parallel Evaluation of Applicative Languages", Proceedings of the ACM Conference on Functional Languages and Computer Architecture, October 1981.Google Scholar
  11. {11}.
    Gurd J.R., Kirkham C.C. and Watson I., "The Manchester Prototype Dataflow Computer", CACM 28(1), January 1985.Google Scholar
  12. {12}.
    Kieburtz R.B. and Shultis J., "Transformations of FP Program Schemes", Proceedings of the ACM Conference on Functional Languages and Computer Architecture, October 1981.Google Scholar
  13. {13}.
    Manna Z., Ness S. and Vuillemin J., "Inductive Methods for Proving Properties of Programs", CACM 16(8), August 1973.Google Scholar
  14. {14}.
    McCarthy J., "A Basis for a Mathematical Theory of Computation", in Braffort P. and Hirschberg D. (eds.), Computer Programming and Formal Systems, North Holland, 1963.Google Scholar
  15. {15}.
    Minsky M.L., Computation: Finite and Infinite Machines, Prentice-Hall, 1972.Google Scholar
  16. {16}.
    Oliveira J.N.F., "The Formal Semantics of Deterministic Dataflow Programs", Ph.D. Thesis, Department of Computer Science, University of Manchester, February 1984.Google Scholar
  17. {17}.
    Wadler P., "Applicative Style Programming, Program Transformations, and List Operators", Proceedings of the ACM Conference on Functional Languages and Computer Architecture, October 1981.Google Scholar
  18. {18}.
    Williams J.H., "On the Development of the Algebra of Functional Programs", Research Report RJ2983 (37118), Computer Science, IBM Research Laboratory, San Jose, California 95193, October 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • V. J. Bush
    • 1
  • J. R. Gurd
    • 1
  1. 1.Department of Computer ScienceUniversity of ManchesterManchesterEngland

Personalised recommendations