Author of the publication

Simple Confluently Persistent Catenable Lists (Extended Abstract).

, , and . SWAT, volume 1432 of Lecture Notes in Computer Science, page 119-130. Springer, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Simple Confluently Persistent Catenable Lists (Extended Abstract)., , and . SWAT, volume 1432 of Lecture Notes in Computer Science, page 119-130. Springer, (1998)Theoretical Pearls.. J. Funct. Program., 13 (4): 815-822 (2003)Safe-for-Space Threads in Standard ML., , , , and . High. Order Symb. Comput., 11 (2): 209-225 (1998)Red-Black Trees in a Functional Setting.. J. Funct. Program., 9 (4): 471-477 (1999)Three Algorithms on Braun Trees.. J. Funct. Program., 7 (6): 661-666 (1997)Catenable Double-Ended Queues.. ICFP, page 66-74. ACM, (1997)SIGPLAN Notices 32(8), August 1997.Call-by-Need and Continuation-Passing Style., , and . LISP Symb. Comput., 7 (1): 57-82 (1994)Simple Confluently Persistent Catenable Lists., , and . SIAM J. Comput., 30 (3): 965-977 (2000)The Role of Lazy Evaluation in Amortized Data Structures.. ICFP, page 62-72. ACM, (1996)SIGPLAN Notices 31(6), June 1996.An Overview of Edison.. Haskell, volume 41 of Electronic Notes in Theoretical Computer Science, page 60-73. Elsevier, (2000)