THE IMPLEMENTATION OF FUNCTIONAL PROGRAMMING LANGUAGES - Simon L. Peyton Jones

158 References Completed 25 Missing References. 3 PENDING SCANNING.

CH1. Introduction

The functional programming languages mentioned in the book predating 1987:

• SASL Turner, 1976

• ML Gorden et al., 1979

• KRC Turner, 1982

• Hope Burstall et al., 1980

• Ponder Fairbairn, 1985

• LML Augustsson, 1984

• Miranda Turner, 1985

• Orwell Wadler, 1985

CH1 References

Abelson, H., and Sussman, G.J. 1985. Structure and Interpretation of Computer Programs. MIT Press.

Augustsson, L. 1984. A compiler for lazy ML. Proceedings of the ACM Symposium on Lisp and Programming, Austin. August, pp. 218-27.

Burstall, R.M., MacQueen, D.B., and Sanella, D.T. 1980. Hope: an experimental applicative language. CSR-62-80. Department of Computer Science, University of Edinburgh. May.

Darlington, J. 1984. Functional programming. In Distributed Computing. Duce (Editor). Academic Press. --TODO SCAN pg.57 - pg.136

Fairbairn, J. 1985. Design and implementation of a simple typed language based on the lambda calculus. PhD thesis, TechnicalReport 75. University of Cambridge. May.

Glaser, H., Hankin, C., and Till, D. 1984. Principles of Functional Programming. Prentice-Hall. --TODO SCAN BOOK

Gordon, M.J., Milner, A.J., and Wadsworth, C.P. 1979. Edinburgh LCF. LNCS 78. Springer Verlag.

Henderson,P. 1980. Functional Programming. Prentice-Hall.

Turner, D.A. 1976. The SASL language manual. University of St Andrews. December.

Turner, D.A. 1982. Recursion equations as a programming language. In Functional Programming and Its Applications, Darlington et al. (editors), pp. 1-28. Cambridge University Press.

Turner, D.A. 1985. Miranda — a non-strict functional language with polymorphic types. In Conference on Functional Programming Languages and Computer Architecture, Nancy, pp. |-16. Jouannaud (editor), LNCS 201. Springer Verlag.

Wadler, P. 1985. Introduction to Orwell. Programming Research Group, University of Oxford.

Part I - Compiling High Level Functional Languages

Chapter 2 - The Lambda Calculus

CH2 References

Barendregt, H.P. 1984. The Lambda Calculus—Its Syntax and Semantics, 2nd edition. North-Holland.

Church, A. 1941. The Calculi of Lambda Conversion. Princeton University Press.

Curry, H.B., and Feys, R. 1958. Combinatory Logic, Vol. 1. North-Holland.

Kennaway, J.R. 1984. An Outline of Some Results of Staples on Optimal Reduction Orders in Replacement Systems. CSA/19/1984, School of information Systems, University of East Anglia. March.

Levy, J.J. 1980. Optimal reductions in the lambda calculus. In Essays on Combinatory Logic, pp.159-92. Hindley and Seldin (editors). Academic Press.

Rosser, J.B. 1982. Highlights of the history of the lambda calculus. Proceedings of the ACM Symposium on Lisp and Functional Programming, Pittsburgh, pp. 216-25. August.

Schonfinkel, M. 1924. Uber die Bausteine der mathematischen Logik. Mathematische Annalen, Vol. 92, pp. 305-16.

Scott, D. 1981. Lectures on a Mathematical Theory of Computation. PRG-19. Programming Research Group, Oxford. May.

Staples, J. 1980a. Computation on graph-like expressions. Theoretical Computer Science. Vol. 10, pp. 171-85.

Staples, J. 1980b. Optimal evaluations of graph-like expressions. Theoretical Computer Science. Vol. 10, pp. 297-316.

Staples, J. 1980c. Speeding up subtree replacement systems. Theoretical Computer Science, Vol. 11, pp. 39-47.

Stoy, J.E. 1981. Denotational Semantics. MIT Press.

Welch,P. 1975. Some Notes on the Martin-Lof Proof of the Church Rosser Theorem as Rediscovered by Park. Computer Lab., University of Kent. October.

CH3

CH3 References

Gordon, M.J.C. 1979. The Denotational Description of Programming Languages. Springer Verlag.

Turner, D.A. 1985. Miranda — a non-strict functional language with polymorphic types. In Conference on Functional Programming Languages and Computer Architecture, Nancy, pp. 1-16, Jouannaud(editor). LNCS 201. Springer Verlag.

CH4

CH4 References

Burstall, R.M. 1969. Proving properties of programs by structural induction. The Computer Journal. Vol. 12, No. 1, pp. 41-8.

Burstall, R.M. 1977. Design considerations for a functional programming language. In Proceedings Infotech State of the Art Conference, Copenhagen, pp. 54-7.

Burstall, R.M., and Darlington, J. 1977. A transformation system for developing recursive programs. Journal of the ACM.Vol. 24, No. 1, pp. 44-67.

Burstall, R.M., and Gognen, J.A. 1982. Algebras, Theories, and Freeness: An Introduction for Computer Scientists. Report CSR-101-82, Dept of Computer Science, University of Edinburgh. February.

Landin, P.J. 1966. The next 700 programming langnages. Communications of the ACM.Vol. 9, No. 3, pp. 157-64.

Turner, D.A., 1981.. Aspects of the implementation of programming languages. D.Phil. thesis, University of Oxford. February.

Wadler, P. 1985. A Splitting Headache— and Its Cure. Programming Research Group, Oxford. January.

CH5

References

Augustsson, L. 1985. Compiling pattern matching. In Conference on Functional Programming Languages and Computer Architecture, Nancy, pp. 368-81. Jouannaud(editor), LNCS 201. Springer Verlag.

Barrett, G., and Wadler, P. 1986. Derivation of a Pattern-matching Compiler. Programming Research Group, Oxford.

Burstall, R.M., MacQueen, D.B., and Sanella, D.T. 1980. HOPE: an experimental applicative language. In Proceedings of the ACM Lisp Conference. August.

Hoffmann, C.M., and O’Donnell, M.J. 1983. Implementation of an interpreter for abstract equations. In 10th ACM Symposium on Principles of Programming Languages, pp. 111-21. ACM.

Huet, G., and Levy, J.J. 1979. Computations in Non-ambiguous Linear Term Rewriting Systems. INRIA technical report 359.

CH6

CH6 References

Aho, A.V., Hopcroft, J.E., and Ullman, D. 1974. The Design and Analysis of Computer Algorithms, pp. 189-95. Addison Wesley.

Aho, A.V., Hopcroft, J.E., and Ullman, D. 1983a. Data Structures and Algorithms, pp. 222-6. Addison Wesley.

Aho, A.V., Hopcroft, J.E., and Ullman, D. 1983b. Data Structures and Algorithms, pp. 221-2. Addison Wesley.

Dijkstra, E.W. 1976. A Discipline of Programming, pp. 192-200. Prentice Hall.

CH7

CH7 References

Turner, D.A. 1982. Recursion equations as a programming language. In Functional Programming and Its Applications. Darlington et al. (editors). Cambridge University Press

CH8

CH8 References

Gaeck, P., and Black, M. (editors) 1970. Function and concept. In Translations from the Philosophical Writings of Gottlob Frege. Basil Blackwell.

Milner, R. 1978. A theory of type polymorphism in programming. Journal of Computer and System Science. Vol. 17, pp. 348-75.

Mycroft, A. 1984. Polymorphic type schemes and recursive definitions. In Proceedings of the International Symposium on Programming, Toulouse, pp. 217-39. LNCS 167. Springer Verlag.

Strachey, C. 1967. Fundamental concepts in programming languages. In Notes for the International Summer School in Computer Programming, Copenhagen.

Whitehead, A.N., and Russell, B.A.W. 1910-1913. Principia Mathematica, Volume One. Cambridge University Press.

Whitehead, A.N., and Russell, B.A.W. 1910-1913. Principia Mathematica, Volume Two. Cambridge University Press.

Whitehead, A.N., and Russell, B.A.W. 1910-1913. Principia Mathematica, Volume Three. Cambridge University Press.

CH9

CH9 References

Damas,L. 1985.Type Assignment in Programming Languages. CST-33-35. Department of Computer Science, University of Edinburgh. April.

Robinson, J.A. 1965. A machine-oriented logic based on the resolution principle. JournaloftheACM.Vol. 12,no. 1, pp. 23-41.

Wadler, P. 1985. How to replace failure by a list of successes. In Conference on Functional Programming Languages and Computer Architecture, Nancy. Jouannaud(editor). LNCS 201. Springer Verlag.

Part II - Graph Reduction

CH10

CH10 References

Clarke, T.J.W., Gladstone, P.J.S., Maclean, C., and Norman, A.C. 1980. SKIM — The SKI reduction machine. Proceedings of the ACM Lisp Conference, Stanford, Calif. 95044.

Richards, H. 1985. An Overview of Burroughs NORMA. Austin Research Center, Burroughs Corp., Austin, Texas. January

CH11

CH11 References

Abelson, H., and Sussman, G.J. 1985. Structure and Interpretation of Computer Programs. MITPress.

Arvind, Kathail, V., and Pingali, K. 1984. Sharing of Computation in Functional Language Implementations. Laboratory for Computer Science, MIT.July.

Barendregt, H.P., Kennaway, J.R., Klop, J.W., and Sleep, M.R. 1986. Needed reduction and spine strategies for the lambda calculus. Report CS-R8621. Centre for Mathematics and Computer Science, Amsterdam. May.

Henderson, P. 1980. Functional Programming — Application and Implementation. Prentice-Hall.

Peyton Jones, S.L. 1986. Functional programming languages as a software engineering tool. In Software Engineering - The Critical Decade. Ince (editor). Peter Peregrinus.

Scheevel, M. 1986. Norma: a graph reduction processor. In Proceedings of the ACM Conference on Lisp and Functional Programming, Cambridge, Mass., pp. 212-19. August.

Schorr, H., and Waite, W. 1967. An efficient machine independent procedure for garbage collection. Communications ofthe ACM. Vol.10, no. 8, pp. 501-6.

Stoye, W.R., Clarke, T.J.W., and Norman, A.C. 1984. Some practical methods for rapid combinator reduction. In Proceedings ofthe ACM Symposium on Lisp and Functional Programming, Austin, pp. 159-66. August.

Turner, D.A. 1983. The SASL Language Manual. University of Kent. November.

Watson, P., Watson, I., and Woods, V. 1986. A Model of Computation for the Parallel Evaluation of Functional Languages. PMP/MU/PW/000001. Department of ComputerScience, University of Manchester. February.

CH12

CH12 References

Hughes, R.J.M. 1985. Lazy memo functions. In Proceedings of the IFIP Conference on Functional Programming Languages and Computer Architecture, Nancy, pp. 129-46, Jouannaud(editor). LNCS 201. Springer Verlag. September.

Mago, G.A. 1980. A cellular computer architecture for functional programming. IEEE Computer Society COMPCON,pp.179-87.

Wadsworth, C.P. 1971. Semantics and pragmatics of the lambda calculus, Chapter4. PhD thesis, Oxford.

CH13

CH13 References

Barendregt, H.P. 1984. The Lambda Calculus: Its Syntax and Semantics, 2nd edition,p.24. North-Holland.

Curry, H.B., and Feys, R. 1958. Combinatory Logic, Vol. 1. North-Holland.

De Bruijn, N.G. 1972. Lambda calculus notation with nameless dummies. Indagationes Mathematicae. Vol. 34, pp. 381-92.

Henderson, P. 1980. Functional Programming: application and implementation. Prentice-Hall.

Hoffman, C.M., and O'Donnell, M.J. 1982. Programming with equations. ‘ACM TOPLAS.Vol. 4, no. 1, pp. 83-112.

Hughes, R.J.M. 1984. The design and implementation of programming languages. PhDthesis, PRG-40, Programming Research Group, Oxford. September.

Johnsson, T. 1984. Efficient compilation of lazy evaluation. In Proceeding of the ACM Symposium on Compiler Construction, Montreal, pp. 58-69. June.

Johnsson, T. 1985. Lambdalifting: transforming programs to recursive equations. In Conference on Functional Programming Languages and Computer Architecture, Nancy. Jouannaud (editor). LNCS 201. Springer Verlag.

Keller, R.M. 1985. Distributed graph reduction from first principles. Department of Computer Science, University of Utah.' Klop, J.W.1980. Combinatory reduction systems. PhD thesis, Mathematisch Centrum, Amsterdam.

Klop, J.W. 1980. Combinatory reduction systems. PhD thesis, Mathematisch Centrum, Amsterdam.

Landin, P.J. 1964. The mechanical evaluation of expressions. Computer Journal. Vol. 6, pp. 308-20.

O’Donnell, M.J. 1977. Computing in Systems Described by Equations. LNCS 58, Springer Verlag.

CH14

CH14 References

Hudak, P., and Kranz, D. 1984. A combinator based compiler for a functional language. In Proceedings of the 11th ACM Symposium on Principles of Programming Languages, pp. 122-32. January.

Johnsson, T. 1985. Lambda-lifting— transforming programsto recursive equations. In Conference on Functional Programming and Computer Architecture, Nancy, pp. 190-203. Jouannaud (editor). LNCS 201. Springer Verlag

CH15

CH15 References

Fairbairn, J. 1985. The design and implementation of a simple typed language based on the lambda calculus, pp. 59-60. PhD thesis, Technical Report 75. University of Cambridge. May.

Hudak, P., and Goldberg, B. 1985. Serial combinators. In Conference on Functional Programming Languages and Computer Architecture, Nancy, pp. 382-99. Jouannaud(editor). LNCS 201. Springer Verlag.

Hughes, R.J.M. 1984. The design and implementation of programming languages. PhD thesis, PRG-40. Programming Research Group, Oxford. September.

Wadsworth, C.P. 1971. Semantics and pragmatics of the lambda calculus, Chapter4. PhD thesis, Oxford.

CH16

CH16 References

Burton, F.W. 1982. A linear space translation of functional programs to Turner combinators. /nformation Processing Letters. Vol. 14, no. 5, pp. 202-4.

Curry, H.B., and Feys, R. 1958. Combinatory Logic, Vol. 1. North-Holland. Hughes, R.J.M. 1984. The design and implementation of programming languages. PhD thesis, PRG-40. Programming Research Group, Oxford.

Hughes, R.J.M. 1984. The design and implementation of programming languages. PhD thesis, PRG-40. Programming Research Group, Oxford.

Joy, M.S., Rayward-Smith, V.J., and Burton, F.W. 1985. Efficient combinator code. Computer Languages. Vol. 10, no. 3/4, pp. 211-24.

Kennaway, J.R. 1982. The Complexity of a Translation of Lambda Calculus to Combinators. Department of Computer Science, University of East Anglia.

Kennaway, J.R., and Sleep, M.R. 1982a. Director Strings as Combinators. Department ofComputer Science, University of East Anglia.

Kennaway, J.R., and Sleep, M.R. 1982b. Counting Director Strings. Department of Computer Science, University ofEast Anglia.

Scheevel, M., 1986. Norma: a graph reduction processor. In Proceedings ofthe ACM Conference on Lisp and Functional Programming, Cambridge, Mass., pp. 212-19. August.

Stoye, W.R. 1983. The SKIM microprogrammer’s guide. Technical Report 31. University of Cambridge. October.

Stoye, W.R. 1985. The implementation of functional languages using custom hardware. PhD thesis, Computer Lab., University ofCambridge. May.

Turner, D.A. 1976. SASL Reference Manual. University of St Andrews.

Turner, D.A. 1979a. A new implementation technique for applicative languages. Software— Practice and Experience. Vol. 9, pp. 31-49.

Turner, D.A. 1979b. Another algorithm for bracket abstraction. Journal of Symbolic Logic. Vol. 44, no. 2, pp. 67-270

CH17

CH17 References

Aerts, J.P.H. 1981. Implementing SASL without Garbage Collection. EUT-Report 81-WSK-05. Eindhoven Univ. of Technology. November.

Baker, H. 1978. List processing in real time on a serial computer. Communications of the ACM.Vol. 21, no.4, pp. 280-94.

Ben-Ari, M. 1984. Algorithms for on-the-fly garbage collection. ACM TOPLAS.Vol. 6, no. 3, pp. 333-44.

Bobrow, D.G. 1980. Managing reentrant structures using reference-counts. ACM TOPLAS.Vol.2,no. 3, pp. 269-73.

Brownbridge, D. 1985. Cyclic reference-counting for combinator machines. in Proceedings ofthe IFIP Conference on Functional Programming and Computer Architecture, Nancy. September.

Cohen,J. 1981. Garbage collection of linked datastructures. ACMComputing Surveys. Vol. 13, no. 3, pp. 341-67.

Dijkstra, E.W., Lamport, L., Martin, A.J., Scholten, C.S., and Steffens, E.F.M. 1978. On-the-fly garbage collection—an exercise in cooperation. Communications of the ACM.Vol. 21, no. 11, pp. 966-75.

Hudak, P. 1983a. Distributed Graph Marking. Research report 268, Computer Science Dept, Yale. January.

Hudak, P. 1983b. Distributed task and memory management. in Proceedings of the ACM Symposium on Principles of Distributed Computing, pp. 277-89. August.

Hughes, R.J.M. 1982. Reference-counting with Circular Structures in Virtual Memory Applicative Systems. Programming Research Group, Oxford.

Hughes, R.J.M. 1985. A distributed garbage collection algorithm. in Proceedings of the IFIP Conf. on Functional Programming and Computer Architecture, Nancy, pp 256-72. Jouannaud(editor). LNCS 201, Springer Verlag. September.

Knuth, D. 1976. The Art of Computer Programming. Vol. 1, Section 2.5. Addison Wesley.

Kung, H.T., and Wong, S.W. 1977. An Efficient Parallel Garbage Collection System, and its Correctness Proof. Dept of Comp. Sci., Carnegie-Mellon Univ. September.

Lieberman, H., and Hewitt, C. 1983. A real time garbage collector based on the lifetimes of objects. Communications of the ACM.Vol. 26, no. 6, pp. 419-29.

Mohamed-Ali, K.A. 1984. Object oriented storage management and garbage collection in distributed processing systems. PhD Thesis, report TRITA-CS-8406. Royal Institute of Technology, Stockholm. December.

Schorr, H., and Waite, W. 1967. An efficient machine independent procedure for garbage collection. Communications of the ACM.Vol. 10, no. 8, pp. 501-6.

Steele, G.L. 1975. Multiprocessing compactifying garbage collection. Communications of the ACM.Vol.18, no. 9, pp. 495-508.

Stoye, W.R., Clarke, T.J.W., and Norman, A.C. 1984. Some practical methods for rapid combinator reduction. In Proceedings of the ACM Symposium on Lisp and Functional Programming, Austin, pp. 159-66. August.

Wadler, P. 1984. Listlessness is better than laziness: lazy evaluation and garbage collection at compile-time. In Proceedings ofthe ACM Symposium on Lisp and Functional Programming, Austin, pp. 45-52. August.

Wise, D. 1985. Design for a multiprocessing heap with on-board reference-counting. In Functional Programming and Computer Architecture, Nancy, pp. 289-304. Jouannaud (editor). LNCS 201. Springer Verlag.

Wise, D.S., and Friedman, D.P. 1977. The one-bit reference-count. B/T. Vol. 17, no. 3, pp. 351-9.

CH18

CH18 References

Augustsson, L. 1984. A compiler for lazy ML. In Proceedings of the ACM Symposium on Lisp and Functional Programming, Austin, pp. 218-27, August.

Burstall, R.M., MacQueen, D.B., and Sanella, D.T. 1980. HOPE: an experimental applicative language. In Proceedings of the ACM Lisp Conference, pp. 136-43, August.

Clark, R. (editor) 1981. UCSD P-system and UCSD Pascal Users’ Manual, 2nd edition. Softech Microsystems, San Diego.

Elworthy, D. 1985. Implementing a Ponder cross compiler for the SKIM processor. Dip. Comp.Sci. Dissertation, Computer Lab., Cambridge. July.

Fairbairn, J. 1982. Ponder and its type system. Technical Report 31. Computer Lab., Cambridge. November.

Fairbairn,J. 1985. Design and implementation of a simple typed language based on the lambda calculus. Technical Report 75. Computer Lab., Cambridge. May.

Fairbairn, J., and Wray, S.C. 1986. Code generation techniques for functional languages. In Proceedings of the ACM Conference on Lisp and Functional Programming, Boston, pp. 94-104, August.

Field, A. 1985. The Compilation of FP/M Programs into Conventional Machine Code. Dept Comp.Sci., Imperial College. June.

Griss, M.L., and Hearn, A.C. 1981. A portable Lisp compiler. Software— Practice and Experience. Vol. 11, pp. 541-605.

Hudak, P., and Kranz, D. 1984. A combinator based compiler for a functional language. In Proceedings of the llth ACM Symposium on Principles of Programming Languages, pp. 122-32, January.

Johnsson, T. 1984. Efficient compilation of lazy evaluation. In Proceedings of the ACM Conference on Compiler Construction, Montreal, pp. 58-69, June.

Lester, D. 1985. The correctness of a G-machine compiler. MSc dissertation, Programming Research Group, Oxford. December.

Rees, J.A., and Adams, N.1. 1982. T —a dialect of LISP. In Proceedings of the ACM Symposium on Lisp and Functional Programming, pp. 114-22, August.

Richards, M. 1971. The portability of the BCPL compiler. Software — Practice and Experience. Vol. 1, no. 2, pp. 135-46.

Steele, G.L., and Sussman, G.J. 1978. The Revised Report on Scheme. Al Memo452, MIT. January.

CH19

CH19 References

Aho, A.V., and Ullman, J.D. 1977. Principles of Compiler Design. Addison Wesley. Bauer, F.L., and Eickel, J. 1976. Compiler Construction. Springer Verlag. --TODO SCAN BOOK

Bauer, F.L., and Eickel, J. 1976. Compiler Construction. Springer Verlag.

Landin, P.J. 1964. The mechanical evaluation of expressions. ComputerJournal. Vol. 6, pp. 308-20.

Wulf, W., Johnsson, R.K., Weinstock, C.B., Hobbs, S.O., and Geschke, C.M. 1975.The Design of an Optimising Compiler. Elsevier.

CH20

CH20 References

Augustsson, L. 1985. Compiling pattern matching. In Conference on Functional Programming Languages and Computer Architecture, Nancy. Jouannaud (editor). LNCS 201. Springer Verlag.

CH21

CH21 References

Cardelli, L. 1983. The functional abstract machine. Polymorphism. Vol. 1, no.1.

Cardelli, L. 1984. Compiling a functional language. In Proceedings of the ACM Symposium on Lisp and Functional Programming, Austin, pp. 208-17. August.

Steele, G.L. 1977. Lambda — the ultimate goto. Al Memo 443. MIT Artificial Intelligence Lab. October.

D.A. 1979. A new implementation technique for applicative languages. Software— Practice and Experience. Vol. 9, pp. 31-49.

CH22

CH22 References

Burn, G., Hankin, C.L., and Abramsky, S. 1985. Strictness analysis of higher order functions. Science of Computer Programming (to appear); also DoC 85/6, Dept Comp.Sci., Imperial College, London. April.

Clack, C.D., and PeytonJones, S.L. 1985. Strictness Analysis —a practical approach.In Conference on Functional Programming and Computer Architecture, Nancy. pp. 35-49. Jouannaud (editor). LNCS 201. Springer Verlag.

Cousot, P., and Cousot, R. 1977. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixed points. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, pp. 238-52.

Hudak, P., and Young, J. 1986. Higher order strictness analysis in untyped lambda calculus. In Proceedings of the 12th ACM Symposium on Principles of Programming Languages, pp. 97-109, January.

Hughes, R.J.M. 1985. Strictness Detection in Non-flat Domains. Programming Research Group, Oxford. August.

Mycroft, A. 1981. Abstract interpretation and optimising transformations for applicative programs. PhD thesis, Dept Computer Science, University of Edinburgh.

Stoy, J.E. 1981. Denotational Semantics. MIT Press.

Wadler, P. 1984. Listlessness is better than laziness: lazy evaluation and garbage collection at compile-time. In Proceedings ofthe ACM Symposium on Lisp and Functional Programming, Austin, Texas. August.

Wadler, P. 1985a. Strictness Analysis on Non-flat Domains. Programming Research Group, Oxford. November.

Wadler, P. 1985b. Listiessness is better than laziness 11: composing listless functions. In Programs as Data Objects, Ganzinger, H., and Jones, N.D. (editors). LNCS 217. Springer Verlag.

Wray, S.C. 1986. Implementation and programming techniques for functional languages. PhD thesis, University of Cambridge. January.

CH23

CH23 References

Backus, J. 1978. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Communications ofthe ACM. Vol. 21, no. 8, pp. 613-41.

Hughes, R.J.M. 1984. Parallel Functional Programs use Less Space. Programming Research Group, Oxford.

Meira, S.R.L. 1985. On the efficiency of applicative algorithms. PhD thesis, Computer Laboratory, University of Kent, p. 36. March.

Stoye, W. 1985. The implementation of functional languages using custom hardware. PhD thesis, Computer Lab., University of Cambridge. May.

Turner, D.A. 1981. The semantic elegance of applicative languages. In Proceedings of the ACM Conference on Functional Languages and Computer Architecture, pp. 85-92. ACM.

CH24

CH24 References

Clack, C.D., and Peyton Jones, S.L. 1985. Generating Parallelism from Strictness Analysis. Internal Note 1679, Dept Comp. Sci., University College London. February.

Clack, C.D., and Peyton Jones, S.L. 1986. The four-stroke reduction engine. In ACM Conference on Lisp and Functional Programming, Boston. pp. 220-32, August.

Cripps, M.D., and Field, A.J. 1983, An Asynchronous Structure-independent Switching System with System-level Fault Tolerance. Dept Comp. Sci., Imperial College, London.

Darlington, J., and Reeve, M. 1981. ALICE—a multiprocessor reduction machine for the parallel evaluation of applicative languages. In Proceedings of the ACM Symposium on Functional Languages and Computer Architecture, Portsmouth. pp. 65~—76, October.

Denning, P.J. 1972. On modeling program behavior. In Proceedings of the Spring Joint Computer Conference, 40, pp. 937-44. AFIPS Press.

Goldberg, B., and Hudak,P. 1985. Serial combinators— optimal grains of parallelism. In Functional Programming Languages and Computer Architecture. pp. 382-99. LNCS 201. Springer Verlag.

Hankin, C.L., Burn, G.L., and Peyton Jones, S.L. 1986. An approach to safe parallel combinator reduction. European Symposium on Programming. Robinet, B., and Wilhelm,R.(editors), pp. 99-110. LNCS 213. Springer Verlag. March.

Hudak,P. 1984. Distributed Applicative Processing Systems. YALEU/DCS/TR-317. Dept Comp.Sci., Yale. May.

Hudak,P, 1985. Functional Programming on Multiprocessor Architectures — Research in Progress, Dept Comp.Sci., Yale University. November.

Hudak,P., and Goldberg, B. 1985a. Distributed execution of functional programs using serial combinators. IEEE Transactions on Computers. Vol. C-34, no. 10.

Hudak,P., and Goldberg, B. 1985b. Serial combinators. In Conference on Functional Programming and Computer Architecture, Nancy. Jouannaud (editor). LNCS 201. Springer Verlag.

Hudak, P., and Smith, L. 1985. Para-functional Programming — a Paradigm for Programming MultiprocessorSystems. YALEU/DCS/RR-390. Dept Comp.Sci., Yale University. June. Intel 1985. iPSC User’s Guide. Intel Corporation, Order Number 175455-003. October.

Intel 1985. iPSC User's Guide. Intel Corporation, Order Number 175455-003. October.

Keller, R.M. 1985. Rediflow Architecture Prospectus, UUCS-85-105. Dept Comp. Sci., University of Utah. August.

Keller, R.M., and Lin, F.C.H. 1984. Simulated performance of a reduction based multiprocessor. IEEE Computer. Vol. 17, no. 7, pp. 70-82.

Keller, R.M., Lindstrom, G., and Patil, S. 1979. A loosely-coupled applicative multi-processing system. In AFIPS Conference Proceedings, pp. 613-22, June.

Peyton Jones, S.L. 1986. Using Futurebus in a fifth generation computer. Micro-processors and Microsystems. Vol. 10, no. 2.

Peyton Jones, S.L., Clack, C.D., and Salkild, J. 1985. GRIP — a Parallel Graph Reduction Machine, Dept Comp.Sci., University College London. November.

Smith, A.J. 1982. Cache memories. ACM Computing Surveys. Vol. 14, no. 3, pp.473-530.

Tighe, S. 1985. A Study of the Parallelism Inherent in Combinator Reduction. Parallel processing program, MCC, Austin, Texas. August.

Appendix

Appendix References

Gordon, M.J., Milner, A.J., and Wadsworth, C.P. 1979. Edinburgh LCF. Springer Lecture Notes in Computer Science. Vol. 78.

Landin, P.J. 1966. The next 700 programming languages. Communications of the ACM.Vol.9, no. 3.

Milner, A.J. 1978. A theory of type polymorphism in programming. Journal of Computer and System Sciences. Vol. 17.

Richards, H. 1984. An overview of ARC SASL. SIGPLAN Notices. October.

Thompson, S.J. 1986. Laws in Miranda. Proceedings of the 4th ACM International Conference on LISPand Functional Programming, Boston, Mass. August.

Turner, D.A. 1976. SASL language manual. StAndrews University Technical Report. December.

Turner, D.A. 1982. Recursion equations as a programming language. In Functional Programming and its Applications, Darlington et al. (editors). Cambridge University Press.

Turner, D.A. 1985. Miranda: a non-strict functional language with polymorphic types. In Proceedings of the IFIP International Conference on Functional Programming Languages and Computer Architecture, Nancy. Springer Lecture Notes in ComputerScience. LNCS 201.