A. Umut, A. Acar, M. Charguéraud, and . Rainey, Theory and practice of chunked sequences. Full version

J. Bernardy, The Haskell yi package

L. Adam, R. E. Buchsbaum, and . Tarjan, Confluently persistent deques via data-structural bootstrapping, J. Algorithms, vol.18, issue.3, pp.513-547, 1995.

A. L. Buchsbaum, Data-structural bootstrapping and catenable deques, 1993.

F. Paul and . Dietz, Maintaining order in a linked list, STOC '82, pp.122-127, 1982.

L. J. Guibas, E. M. Mccreight, M. F. Plass, and J. R. Roberts, A new representation for linear lists, Proceedings of the ninth annual ACM symposium on Theory of computing , STOC '77, pp.49-60, 1977.
DOI : 10.1145/800105.803395

R. Hinze and R. Paterson, Finger trees: a simple general-purpose data structure, Journal of Functional Programming, vol.16, issue.02, pp.197-218, 2006.
DOI : 10.1017/S0956796805005769

H. Kaplan, E. Robert, and . Tarjan, Persistent lists with catenation via recursive slow-down, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.93-102, 1995.
DOI : 10.1145/225058.225090

H. Kaplan and R. E. Tarjan, Purely functional representations of catenable sorted lists, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.202-211, 1996.
DOI : 10.1145/237814.237865

E. Donald and . Knuth, The Art of Computer Programming: Sorting and Searching, pp.481-489, 1998.

E. Charles, T. B. Leiserson, and . Schardl, A work-efficient parallel breadth-first search algorithm, SPAA '10, pp.303-314, 2010.

A. Stepanov and M. Lee, The Standard Template Library, volume 1501, HP Laboratories, 1995.