This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
R. M. Burstall and J. Darlington 1977. A transformation system for developing recursive programs. J. ACM, 24 (1): 44–67.
J. Darlington 1989. A functional programming environment supporting execution, partial execution and transformation. In PARLE ‘89, Parallel Architectures and Languages Europe, Springer-Verlag, pp. 286–305.
J. Fairbairn and S. Wray 1987. TIM: a simple, lazy abstract machine to execute supercombinators. In G. Kahn (editor) Functional Programming Languages and Computer Architecture, Springer-Verlag, pp. 34–45.
M. S. Feather 1987. A system for assisting program transformation. ACM Transactions on Programming Languages and Systems, 4 (1): 1–20.
M. J. C. Gordon , R. Milner and C. P. Wadsworth 1979. Edinburgh LCF. Springer-Verlag.
T. Johnsson 1984. Efficient compilation of lazy evaluation. ACM SIGPLAN Notices, 19 (6): 58–69.
J. T. O'Donnell and C. V. Hall 1988. Debugging in applicative languages. Lisp and Symbolic Computation, 1 (2).
S. L. Peyton Jones 1988. FLIC – a Functional Language Intermediate Code. ACM SIGPLAN Notices, 23 (8): 30–48.
C. Runciman 1989. What about the natural numbers? Computer Languages 14 (3): 181–191.
C. Runciman , M. Firth and N. Jagger 1990. Transformation in a non-strict language: an approach to instantiation. In Proc. Glasgow Workshop on Functional Programming, Springer-Verlag, pp. 133–141.
R. M. Snyder 1990. Lazy debugging of lazy functional programs. New Generation Computing, 8 (2): 139–161.
W. F. Tichy 1985. RCS – a system for version control. Software – Practice and Experience, 15 (7): 637–654.
I. Toyn and C. Runciman 1986. Adapting combinator and SECD machines to display snapshots of functional computations. J. New Generation Computing, 4: 339–363.
D. A. Turner 1979. A new implementation technique for applicative languages. Software – Practice and Experience 9 (1): 31–49.
D. A. Turner 1985. Miranda: a non-strict functional language with polymorphic types. In J.-P. Jouannaud (editor), Functional Programming Languages and Computer Architecture, Volume 201 of Lecture Notes in Computer Science. Springer-Verlag, pp. 1–16.
P. Wadler 1985. How to replace failure by a list of successes. In Proc. 2nd ACM Conf. on Functional Programming Languages and Computer Architecture, Springer-Verlag, pp. 113–128.