A. Abel, Mathematical Structures in Computer Science, 2008.

S. Colin, Specifying the unboxability check on mutually recursive datatypes in OCaml, 2018.

J. Garrigue, Relaxing the value restriction, FLOPS, 2004.

R. Lepigre and C. Raffalli, Abstract representation of binders in ocaml using the bindlib library, LFMTP, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01972050

X. Leroy, Efficient data representation in polymorphic languages, PLILP, 1990.
URL : https://hal.archives-ouvertes.fr/hal-01499983

X. Leroy, Unboxed objects and polymorphic typing, POPL, 1992.
URL : https://hal.archives-ouvertes.fr/hal-01499973

J. Peterson, Untagged data in tagged environments: Choosing optimal representations at compile time, FPCA, 1989.

L. Simon, P. Jones, and J. Launchbury, Unboxed values as first class citizens in a nonstrict functional language, FPCA, 1991.

G. Scherer and D. Rémy, Gadts meet subtyping, ESOP, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01093816

V. Simonet and F. Pottier, A constraint-based approach to guarded algebraic data types, TOPLAS, 2007.