Functional Pearls - Three Algorithms on Braun Trees (1997)

Cached

Download Links

by Chris Okasaki
Citations:2 - 0 self

Active Bibliography

4 Perfect Trees and Bit-reversal Permutations – Ralf Hinze - 1999
3 Generic programming, now – Ralf Hinze, Andres Löh - 2006
8 A Simple Implementation Technique for Priority Search Queues – Ralf Hinze - 2001
24 Manufacturing Datatypes – Ralf Hinze - 1999
7 An Algebra of Scans – Ralf Hinze - 2004
13 A New Method for Functional Arrays – Melissa O'Neill, F. Warren Burton - 1997
Purity, Impurity and Efficiency in Graph Algorithms – n.n.
23 Fast Mergeable Integer Maps – Chris Okasaki, Andrew Gill - 1998
5 Automated Benchmarking of Functional Data Structures – Graeme E. Moss, Colin Runciman - 1999
17 Purely Functional Random-Access Lists – Chris Okasaki - 1995
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
Quicksort via Bird's Tree Fusion Transformation – Tjark Weber And, Tjark Weber, James Caldwell
2 Polytypic Abstraction in Type Theory – H. Pfeifer, H. Rueß - 1998
1 An iterator construct for the refinement calculus – Steve King, Carroll Morgan - 2000
Are Anamorphisms Reasonable Abstractions? – Bernhard Möller - 1998
Scientific Report of the HDR application file. – unknown authors - 1998
Declarative FPGA Circuit Synthesis using Kansas Lava – Andy Gill
10 Steps Towards Mechanizing Program Transformations Using PVS – Natarajan Shankar - 1996
Assertions, Assertive Coding Application to Sudoku Puzzles – Jan Van Eijck