S. Aditya, C. H. Flood, and J. E. Hick, Garbage collection for strongly-typed languages using runtime type reconstruction, Lisp and Functional Programming, pp.12-23, 1994.
DOI : 10.1145/182590.182414
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.5356

A. W. Appel, Run-time tags aren't necessary, Lisp and Symbolic Computation, 1989.
DOI : 10.1007/bf01811537
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.595

J. Goubault, Generalized boxings, congruences and partial inlining, Static Analysis Symposium '94, number 864 in Lecture Notes in Computer Science, pp.147-161, 1994.
DOI : 10.1007/3-540-58485-4_38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.4215

M. P. Jones, Dictionary-free overloading by partial evaluation, Lisp and Symbolic Computation, vol.28, issue.6, 1993.
DOI : 10.1007/BF01019005
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.274

X. Leroy, J. Vouillon, and D. Doligez, The Objective Caml system. Software and documentation available on the Web, 1996.

X. Leroy, Unboxed objects and polymorphic typing, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, pp.177-188, 1992.
DOI : 10.1145/143165.143205
URL : https://hal.archives-ouvertes.fr/hal-01499973

X. Leroy, Le syst eme Caml Special Light: modules et compilation eecace en Caml, 1995.

G. Morrisett, Compiling with types, 1995.

R. Morrison, A. Dearle, R. C. Connor, and A. L. Brown, An ad hoc approach to the implementation of polymorphism, ACM Trans. Prog. Lang. Syst, vol.13, issue.3, 1991.

A. Ohori and T. Takamizawa, An unboxed operational semantics for ML polymorphism, Lisp and Symbolic Computation, 1997.
DOI : 10.1145/99370.99393
URL : http://repository.upenn.edu/cgi/viewcontent.cgi?article=1818&context=cis_reports

D. P. Oliva and A. Tolmach, From ML to Ada(!?!): strongly-typed language interoperability via source translation. Draft, available electronically, 1996.

S. L. Peyton-jones and J. Launchbury, Unboxed values as first class citizens in a non-strict functional language, Functional Programming Languages and Computer Architecture, pp.636-666, 1991.
DOI : 10.1007/3540543961_30

M. Serrano and M. Feeley, Storage use analysis and its applications, International Conference on Functional Programming, pp.50-61, 1996.
DOI : 10.1145/232629.232635
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.8423

M. Serrano, Control ow analysis: a functional language compilation paradigm, Symposium on Applied Computing SAC '95, 1995.
DOI : 10.1145/315891.315934

Z. Shao and A. Appel, A type-based compiler for Standard ML, Programming Language Design and Implementation, pp.116-129, 1995.
DOI : 10.1145/207110.207123
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.5599

Z. Shao, Flexible representation analysis, International Conference on Functional Programming, 1997.
DOI : 10.1145/258949.258958
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.3252

O. Shivers, Control--ow analysis in Scheme, SIG- PLAN Notices, pp.164-174, 1988.

D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper et al., TIL: a type-directed optimizing compiler for ML, Programming Language Design and Implementation, pp.181-192, 1996.

A. Tolmach, Tag-free garbage collection using explicit type parameters, Lisp and Functional Programming 1994, pp.1-11, 1994.
DOI : 10.1145/182409.182411
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.1106