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.
M. Barr and C. Wells (1985) Toposes, Triples, and Theories. Springer Verlag.
J. Fairbairn (1987) Form follows function. Software — Practice and Experience, 17(6) 379–386.
M. Gordon R. Milner and C. Wadsworth (1979) Ediburgh LCF. LNCS 78, Springer-Verlag.
J. Hughes (1989) Why functional programming matters. The Computer Journal, 32(2) 98–107.
S. Mac Lane (1971) Categories for the Working Mathematician. Springer-Verlag.
G. Plotkin (1975) Call-by-name, call-by-value, and the λ-calculus. Theoretical Computer Science, 1 125–159.
J. Rees and W. Clinger , editors, (1986) The revised3 report on the algorithmic language Scheme. ACM SIGPLAn Notices, 21(12) 37–79.
D. A. Schmidt (1985) Detecting global variables in denotational specifications. ACM Transactions on Programming Languages and Systems, 7 299–310.
M. Spivey (1990) A functional theory of exceptions. Science of Computer Programming. 14(1) 25–42.
D. A. Turner (1985) Miranda: A non-strict functional language with polymorphic types. In: Proceedings of the 2nd International Conference on Functional Programming Languages and Computer Architecture, Nancy, France, LNCS 201, Springer Verlag.
P. Wadler (1985) How to replace failure by a list of successes. In: 2nd Symposium on Functional Programming Languages and Computer Architecture, Nancy, LNCS 273, Springer-Verlag.