J. Le-lisp, INRIA : le manuel de reference, volume 15-2. INRIA, 1986. 3. H. Baker. Lisp integers in " recursive binary " rb " really bignum " format, 2012.

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

R. E. Bryant, Symbolic Boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys, vol.24, issue.3, pp.293-318, 1992.
DOI : 10.1145/136035.136043

C. Carlet, Boolean Functions for Cryptography and Error-Correcting Codes, pp.1-183, 2010.
DOI : 10.1017/CBO9780511780448.011

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

A. Frey, G. Berry, P. Bertin, F. Bourdoncle, and J. Vuillemin, The jazz home page, 1998.

P. Hdak and A. Bloss, The aggregate update problem in functional programming systems, th ACM POPL. ACM, vol.12, 1985.

J. Hervé, B. Serpette, and J. Vuillemin, Bignum: a portable efficient package for arbitrary-precision arithmetic, PRL report 2, 1989.

J. C. Kieffer, A survey of advances in hierarchical data compression, 2000.

J. C. Kieffer, E. Yang, G. J. Nelson, and P. Cosman, Universal lossless compression via multilevel pattern matching, IEEE Transactions on Information Theory, vol.46, issue.4, pp.1227-1245, 2000.
DOI : 10.1109/18.850665

D. E. Knuth, Fundamental Algorithms, The Art of Computer Programming, 1997.

D. E. Knuth, Seminumerical Algorithms, The Art of Computer Programming, 1997.

D. E. Knuth, Sorting and Searching, The Art of Computer Programming, 1998.

P. Lévy, Sur les lois de probabilit?? dont d??pendent les quotients complets et incomplets d'une fraction continue, Bulletin de la Société mathématique de France, vol.2, pp.178-194, 1929.
DOI : 10.24033/bsmf.1150

J. Mccarthy, The implementation of lisp, History of Lisp, pp.2-12, 1979.

S. I. Minato, Zero suppressed decision diagrams, ACM/IEEE Design Automation Conf, vol.30, pp.272-277, 1993.

P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.
DOI : 10.1090/S0025-5718-1985-0777282-X

E. Nkya, Karatsuba algorithm using sums of. differences, pp.1-57, 2007.

M. Shand and J. Vuillemin, Fast implementations of RSA cryptography, Proceedings of IEEE 11th Symposium on Computer Arithmetic, 1993.
DOI : 10.1109/ARITH.1993.378085

C. E. Shannon, The Synthesis of Two-Terminal Switching Circuits, Bell System Technical Journal, vol.28, issue.1, pp.59-98, 1949.
DOI : 10.1002/j.1538-7305.1949.tb03624.x

C. E. Shannon and W. Weaver, The Mathematical Theory of Communication, 1947.

D. Stehlé and P. Zimmermann, A Binary Recursive Gcd Algorithm, Proceedings of ANTS 04, pp.411-425, 2004.
DOI : 10.1007/978-3-540-24847-7_31

J. Vuillemin, Exact real arithmetic with continued fractions, ACM Conference on Lisp and Functional Programming, pp.14-27, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00075792

J. Vuillemin and F. Béal, On the BDD of a Random Boolean Function, Lecture Notes in Computer Science, vol.3321, pp.483-493, 2004.
DOI : 10.1007/978-3-540-30502-6_35

J. E. Vuillemin, Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates, 2009 19th IEEE Symposium on Computer Arithmetic, pp.7-14, 2009.
DOI : 10.1109/ARITH.2009.25