Purely Functional Random-Access Lists (1995)

Cached

Download Links

by Chris Okasaki
Venue:In Functional Programming Languages and Computer Architecture
Citations:17 - 2 self

Active Bibliography

13 The Role of Lazy Evaluation in Amortized Data Structures – Chris Okasaki - 1996
7 Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking – Chris Okasaki - 1995
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
13 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
6 A Probabilistic Approach to the Problem of Automatic Selection of Data Representations – Tyng-Ruey Chuang, Wen L. Hwang - 1996
2 Benchmarking Purely Functional Data Structures – Graeme E. Moss - 1999
12 Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming – Tyng-Ruey Chuang, Benjamin Goldberg - 1993
18 Compiling Standard ML For Efficient Execution On Modern Machines – Zhong Shao - 1994
A Data Structure for More Efficient . . . – Melissa Elizabeth O’Neill - 1994
Modular and Extensible Types – Lucília Figueiredo, Carlos Camarão - 1999
16 Inductive Graphs and Functional Graph Algorithms – Martin Erwig - 2001
11 Simple Confluently Persistent Catenable Lists – Haim Kaplan, Chris Okasaki, Robert E. Tarjan - 1998
1 Confluently Persistent Tries for Efficient Version Control – Erik D. Demaine, Stefan Langerman, Eric Price
5 Fully Persistent Arrays for Efficient Incremental Updates and Voluminous Reads – Tyng-Ruey Chuang - 1992
29 Functional Programming with Graphs – Martin Erwig - 1997
456 Comprehending Monads – Philip Wadler - 1992
24 A Theory of Stack Allocation in Polymorphically Typed Languages – Mads Tofte, Jean-Pierre Talpin - 1993
96 How to Declare an Imperative – Philip Wadler - 1995
4 Auburn: A Kit for Benchmarking Functional Data Structures – Graeme E. Moss, Colin Runciman - 1997