|
1224
|
Introduction to functional programming
– Philip Wadler
- 1995
|
|
196
|
Functional Data Structures
– Chris Okasaki
- 1996
|
|
265
|
Why functional programming matters
– John Hughes
- 1989
|
|
418
|
Comprehending Monads
– Philip Wadler
- 1992
|
|
636
|
Structure and Interpretation of Computer Programs
– H Abelson, G J Sussman, J 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
|
|
30
|
Fully persistent arrays
– P F Dietz
- 1989
|
|
12
|
Manipulating multilinked data structures in a pure functional language
– F W Burton, Hsi-Kai Yang
- 1990
|
|
10
|
Graph Algorithms = Iteration + Data Structures? - The Structure of Graph Algorithms and a Corresponding Style of Programming
– Martin Erwig
- 1992
|
|
10
|
Graph algorithms in a lazy functional programming language
– Yugo Kashiwagi, David S Wise
- 1991
|
|
67
|
Conventional and Uniqueness Typing in Graph Rewrite Systems (Extended Abstract)
– Erik Barendsen, Sjaak Smetsers
- 1993
|
|
8
|
Graph Algorithms with a Functional Flavour
– J Launchbury
- 1995
|
|
104
|
Lazy functional state threads
– John Launchbury, Simon L Peyton Jones
- 1994
|
|
213
|
Monad Transformers and Modular Interpreters
– Sheng Liang, Paul Hudak, Mark Jones
- 1995
|
|
79
|
A Generic Account of Continuation-Passing Styles
– John Hatcliff, Olivier Danvy
- 1994
|
|
6
|
Cheap Eagerness: Speculative Evaluation in a Lazy Functional Language
– Karl-Filip Faxen
- 2000
|
|
60
|
The Objective Caml system: Documentation and user's manual, 2000
– X Leroy
|
|
5
|
Eager haskell: Resource-bounded execution yields e#cient iteration
– J-W Maessen
- 2002
|
