W. Andrew, M. J. Appel, and . Goncalves, Hash-Consing Garbage Collection. Rap. tech. TR-412-93, p.18, 1993.

P. Cuoq and D. Doligez, Hashconsing in an incrementally garbage-collected system, Proceedings of the 2008 ACM SIGPLAN workshop on ML, ML '08, 2008.
DOI : 10.1145/1411304.1411308

J. Filliâtre-et-sylvain-conchon, « Type-safe modular hash-consing, Proceedings of the 2006 workshop on ML. ML '06, 2006.

G. «. Gonthier, The Four Colour Theorem: Engineering of a Formal Proof, Proc. ASCM. T. 5081. Lecture Notes in Computer Science, p.333, 2007.
DOI : 10.1007/978-3-540-87827-8_28

H. Herbelin, The Coq Proof Assistant, Reference Manual, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00069968

J. E. Hopcroft, AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON, Theory of Machines and Computations. Sous la dir, pp.189-196, 1971.
DOI : 10.1016/B978-0-12-417750-5.50022-1

X. Leroy, Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, pp.107-115, 2009.
DOI : 10.1145/1538788.1538814
URL : https://hal.archives-ouvertes.fr/inria-00415861

X. Leroy, The OCaml system, Documentation and user's manual. 2012. url : http: //caml.inria.fr/pub

J. Rutten, Automata and coinduction (an exercise in coalgebra), p.98
DOI : 10.1007/BFb0055624

C. Theory, . Sous-la-dir, and . T. De-davide-sangiorgi-et-robert-de-simone, Lecture Notes in Computer Science. 10.1007/BFb0055624, pp.194-218, 1466.

D. Rémy and . Using, Using, Understanding, and Unraveling the OCaml Language From Practice to Theory and Vice Versa, Lecture Notes in Computer Science, vol.isbn, pp.413-536, 2000.
DOI : 10.1007/3-540-45699-6_9