Appel, Andrew W. 1992. Compiling with Continuations. Cambridge University Press. DOI: 10.1017/CBO9780511609619.

Boehm, Hans-Juergen, and Mark Weiser. 1988. “Garbage Collection in an Uncooperative Environment.” Software: Practice and Experience 18 (9): 807–20. DOI: 10.1002/spe.4380180902.

Cheney, C. J. 1970. “A Nonrecursive List Compacting Algorithm.” Communications of the ACM 13 (11): 677–78. DOI: 10.1145/362790.362798.

Damas, Luis, and Robin Milner. 1982. “Principal Type-Schemes for Functional Programs.” Proceedings of the 9th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL ’82, POPL ’82, 207–12. DOI: 10.1145/582153.582176.

Felleisen, Matthias, and Daniel P. Friedman. 1986. Control Operators, the SECD-Machine, and the Lambda-Calculus. No. TR197. Indiana University. Online.

Flanagan, Cormac, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. 1993. “The Essence of Compiling with Continuations.” Proceedings of the ACM SIGPLAN 1993 Conference on Programming Language Design and Implementation, PLDI93, 237–47. DOI: 10.1145/155090.155113.

Girard, Jean-Yves. 1972. “Interprétation Fonctionnelle Et Élimination Des Coupures de l’arithmétique d’ordre Supérieur.” PhD thesis, Université Paris VII. Online.

Henderson, Fergus. 2002. “Accurate Garbage Collection in an Uncooperative Environment.” Proceedings of the 3rd International Symposium on Memory Management, ISMM02, 150–56. DOI: 10.1145/512429.512449.

Jones, Mark P. 1993. “A System of Constructor Classes: Overloading and Implicit Higher-Order Polymorphism.” Proceedings of the Conference on Functional Programming Languages and Computer Architecture, FPCA93, 52–61. DOI: 10.1145/165180.165190.

Jones, Mark P. 1999. “Typing Haskell in Haskell.” Haskell Workshop. Online.

Jones, Richard, Antony Hosking, and Eliot Moss. 2023. The Garbage Collection Handbook: The Art of Automatic Memory Management. 2nd ed. Chapman and Hall/CRC. DOI: 10.1201/9781003276142.

Kiselyov, Oleg. 2013. How OCaml Type Checker Works—or What Polymorphism and Garbage Collection Have in Common. Online.

Leroy, Xavier. 1990. The ZINC Experiment: An Economical Implementation of the ML Language. RT-117. INRIA. Online.

Levy, Paul Blain. 2001. “Call-by-Push-Value.” PhD thesis, Queen Mary; Westfield College, University of London. Online.

Maranget, Luc. 2007. “Warnings for Pattern Matching.” Journal of Functional Programming 17 (3): 387–421. DOI: 10.1017/s0956796807006223.

Maranget, Luc. 2008. “Compiling Pattern Matching to Good Decision Trees.” Proceedings of the 2008 ACM SIGPLAN Workshop on ML, ICFP08, 35–46. DOI: 10.1145/1411304.1411311.

Marlow, Simon, ed. 2010. Haskell 2010 Language Report. Online.

Marlow, Simon, and Simon Peyton Jones. 2004. “Making a Fast Curry: Push/Enter Vs. Eval/Apply for Higher-Order Languages.” Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, ICFP04, 4–15. DOI: 10.1145/1016850.1016856.

Maurer, Luke, Paul Downen, Zena M. Ariola, and Simon Peyton Jones. 2017. “Compiling Without Continuations.” Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI ’17, 482–94. DOI: 10.1145/3062341.3062380.

Mitchell, Neil, and Shayne Fletcher. n.d. Record Dot Syntax. GHC Proposal 282. Online.

Pierce, Benjamin C. 2002. Types and Programming Languages. MIT Press. Online.

Rémy, Didier. 1992. Extension of ML Type System with a Sorted Equational Theory on Types. RR-1766. INRIA. Online.

Reynolds, John C. 1974. “Towards a Theory of Type Structure.” In Programming Symposium. Springer Berlin Heidelberg. DOI: 10.1007/3-540-06859-7_148.