Fully Persistent Arrays for Efficient Incremental Updates and Voluminous Reads (1992)

Cached

Download Links

by Tyng-Ruey Chuang
Venue:4th European Symposium on Programming
Citations:5 - 2 self

Documents Related by Co-Citation

32 Shallow Binding in Lisp 1.5 – Henry G. Baker - 1978
3 Conchon and Evelyne Contejean. Ergo: A Decision Procedure for Program Verification. http://ergo.lri.fr – Sylvain
3 Conchon and Jean-Christophe Filliâtre. Semi-Persistent Data Structures – Sylvain - 2007
15 Shallow Binding Makes Functional Arrays Fast – Henry G. Baker - 1991
14 An efficiency comparison of some representations of purely functional arrays – Annika Aasa, Sören Holmström, Christina Nilsson - 1988
31 Update analysis and the efficient implementation of functional aggregates – A Bloss - 1989
225 I-Structures: Data Structures for Parallel Computing – Arvind Rishiyur Nikhil, Rishiyur S. Nikhil Y (mit - 1989
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
4 Optimization of very high level languages --- ii. deducing relationships of inclusion and membership – J T Schwartz - 1975
11 Data Structures and Amortized Complexity in a Functional Setting – Berry Schoenmakers - 1992
13 Persistent data structures – Neil Ivor Sarnak - 1986
22 Deques with heap order – H Gajewska, R E Tarjan - 1986
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
35 Efficient Applicative Data Types – E W Myers - 1984
15 Endre Tarjan. Amortized computational complexity – Robert - 1985
43 The Aggregate Update Problem in Functional Programming Systems. Pages 300–313 of – P Hudak, A Bloss - 1985
14 How to Make Destructive Updates Less Destructive – Martin Odersky - 1991
456 Comprehending Monads – Philip Wadler - 1992
71 Single-threaded polymorphic lambda calculus – J C Guzman, P Hudak - 1990