An Overview of Edison (2000)

Cached

Download Links

by Chris Okasaki
Venue:Electronic Notes in Theoretical Computer Science
Citations:15 - 0 self

Active Bibliography

23 Fast Mergeable Integer Maps – Chris Okasaki, Andrew Gill - 1998
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
5 Automated Benchmarking of Functional Data Structures – Graeme E. Moss, Colin Runciman - 1999
The performance of Haskell CONTAINERS package – Milan Straka
6 A Probabilistic Approach to the Problem of Automatic Selection of Data Representations – Tyng-Ruey Chuang, Wen L. Hwang - 1996
Queries and Fault Tolerance – Allan Grønlund Jørgensen, Phd Dissertation, Allan Grønlund Jørgensen
9 Exploring the Design Space for Type-based Implicit Parameterization – Mark P. Jones - 1999
8 Type Inference for Overloading without Restrictions, Declarations or Annotations – Carlos Camarao, Lucília Figueiredo, Belo Horizonte, Ouro Preto - 1999
153 Type classes with functional dependencies – Mark P. Jones - 2000
1 Functional Data Structures for Typed Racket – Hari Prashanth K R, Sam Tobin-hochstadt
unknown title – unknown authors - 1997
89 Type Classes: An Exploration of the Design Space – Simon Peyton Jones, Mark Jones, Erik Meijer - 1997
Relational Programming in MiniKanren: Techniques, . . . – William E. Byrd - 2009
2 Benchmarking Purely Functional Data Structures – Graeme E. Moss - 1999
Applicative Notions in ML-like Programs – Budi Halim Ling - 1998
13 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
16 Inductive Graphs and Functional Graph Algorithms – Martin Erwig - 2001
12 The Isabelle Collections Framework – Peter Lammich, Andreas Lochbihler, Universität Münster
30 Generic Haskell: applications – Ralf Hinze, Johan Jeuring - 2003