Automated Benchmarking of Functional Data Structures (1999)

Cached

Download Links

by Graeme E. Moss , Colin Runciman
Venue:In Practical Aspects of Declarative Languages
Citations:5 - 2 self

Documents Related by Co-Citation

4 Auburn: A Kit for Benchmarking Functional Data Structures – Graeme E. Moss, Colin Runciman - 1997
17 Purely Functional Random-Access Lists – Chris Okasaki - 1995
309 QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs – Koen Claessen, John Hughes - 2000
13 A New Method for Functional Arrays – Melissa O'Neill, F. Warren Burton - 1997
3 HUnit 1.0 User's Guide – Dean Herington - 2002
2 Automated evaluation of cots components – C Mueller, B Korel - 2000
16 Efficient functional implementation of FIFO queues – F Warren Burton - 1982
24 A Framework for Practical, Automated Black-Box Testing of Component-Based Software – Stephen H. Edwards - 2001
15 An Overview of Edison – Chris Okasaki - 2000
36 Multiple-view tracing for Haskell: a new hat – Malcolm Wallace, Olaf Chitil, Thorsten Brehm, Colin Runciman - 2001
55 Automatically Checking an Implementation against Its Formal Specification – Sergio Antoy, Dick Hamlet - 2000
88 Categorical Logic – Andrew M. Pitts - 1995
94 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
1312 Monads for functional programming – Philip Wadler - 1995
68 Random Testing – Richard Hamlet - 1994
131 Specification Case Studies – I Hayes - 1987
233 Monad Transformers and Modular Interpreters – Sheng Liang, Paul Hudak, Mark Jones - 1995
214 An Evaluation of Random Testing – J Duran, S Ntafos - 1984
97 Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell – Simon Peyton Jones - 2001