Structuring Depth-First Search Algorithms in Haskell (1995)

Cached

Download Links

by David King , John Launchbury
Citations:26 - 0 self

Documents Related by Co-Citation

1312 Monads for functional programming – Philip Wadler - 1995
226 Functional Data Structures – Chris Okasaki - 1996
283 Why functional programming matters – John Hughes - 1989
456 Comprehending Monads – Philip Wadler - 1992
728 G.: Structure and Interpretation of Computer Programs – H Abelson, Sussman - 1985
4 An Initial Algebra Approach to Directed Acyclic Graphs – J Gibbons - 1995
14 An efficiency comparison of some representations of purely functional arrays – Annika Aasa, Sören Holmström, Christina Nilsson - 1988
11 Manipulating multilinked data structures in a pure functional language – F W Burton, Hsi-Kai Yang - 1990
9 Graph Algorithms = Iteration + Data Structures? - The Structure of Graph Algorithms and a Corresponding Style of Programming – Martin Erwig - 1992
9 Graph algorithms in a lazy functional programming language – Yugo Kashiwagi, David S Wise - 1991
33 Fully persistent arrays – P F Dietz - 1989
8 Graph Algorithms with a Functional Flavour – J Launchbury - 1995
106 Lazy functional state threads – John Launchbury, Simon L Peyton Jones - 1994
233 Monad Transformers and Modular Interpreters – Sheng Liang, Paul Hudak, Mark Jones - 1995
87 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
7 Cheap Eagerness: Speculative Evaluation in a Lazy Functional Language – Karl-Filip Faxen - 2000
6 Eager Haskell: resource-bounded execution yields efficient iteration – J W Maessen - 2002
68 The Objective Caml system: Documentation and user’s manual. http://caml.inria.fr/ocaml/htmlman – Xavier Leroy
89 should not evaluate its arguments – D P Friedman, D S Wise, CONS - 1976