( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Purely Functional Data Structures

. Cambridge University Press, (1999)

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.

Chris Protzel

Chris Fröhlich

Chris Neisse

Chris Thümmler

Chris Paschold

 

Другие публикации лиц с тем же именем

Catenable Double-Ended Queues.. ICFP, стр. 66-74. ACM, (1997)SIGPLAN Notices 32(8), August 1997.Safe-for-Space Threads in Standard ML., , , , и . High. Order Symb. Comput., 11 (2): 209-225 (1998)Simple Confluently Persistent Catenable Lists (Extended Abstract)., , и . SWAT, том 1432 из Lecture Notes in Computer Science, стр. 119-130. Springer, (1998)The Role of Lazy Evaluation in Amortized Data Structures.. ICFP, стр. 62-72. ACM, (1996)SIGPLAN Notices 31(6), June 1996.Alternatives to two classic data structures.. SIGCSE, стр. 162-165. ACM, (2005)Call-by-Need and Continuation-Passing Style., , и . LISP Symb. Comput., 7 (1): 57-82 (1994)Breadth-first numbering: lessons from a small exercise in algorithm design.. ICFP, стр. 131-136. ACM, (2000)SIGPLAN Notices 35(9), September 2000.From Fast Exponentiation to Square Matrices: An Adventure in Types.. ICFP, стр. 28-35. ACM, (1999)SIGPLAN Notices 34(9), September 1999.Purely Functional Data Structures. Cambridge University Press, (1999)Purely Functional Random-Access Lists.. FPCA, стр. 86-95. ACM, (1995)