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. Milner 1977. Fully abstract models of typed λ-calculi. Theoretical Computer Science, 4, 1–22.
M. Odersky , D. Rabin and P. Hudak 1993. Call-by-name, assignment, and the λ-calculus. In: Conf. Record 20th ACM Symp. on Principles of Programming Languages. Charleston, South Carolina: ACM, New York.
G. D. Plotkin 1977. LCF considered as a programming language. Theoretical Computer Science, 5, 223–255.
R. D. Tennent 1989. Elementary data structures in Algol-like languages. Science of Computer Programming, 13, 73–110.
R. D. Tennent 1990. Semantical analysis of specification logic. Information and Computation, 85 (2), 135–162.