FUNCT I ONAL PEARLS Monadic Parsing in Haskell
Download:
|
|
by Graham Hutton, Erik Meijer
http://www.cs.nott.ac.uk/~gmh//pearl.ps
Add To MetaCart
Abstract:
This paper is a tutorial on defining recursive descent parsers in Haskell. In the spirit of one-stop shopping, the paper combines material from three areas into a single source. The three areas are functional parsers (Burge, 1975; Wadler, 1985; Hutton,
Citations
| 393 | Comprehending monads – Wadler - 1992 |
| 195 | Compilers: principles, techniques and tools – Aho, Sethi, et al. - 1996 |
| 164 | A system of constructor classes: Overloading and implicit higher-order polymorphism – Jones - 1993 |
| 97 | Recursive Programming Techniques – Burge - 1975 |
| 82 | Higher-order functions for parsing – Hutton - 1992 |
| 12 | Ratatosk: a parser generator and scanner generator for Gofer – Mogensen - 1993 |
| 7 | Happy: the parser generator for Haskell – Gill - 1995 |
| 6 | Functional parsers. Lecture notes of the Baastad Spring school on functional programming – Fokker - 1995 |
| 4 | How to replace failure by a list of successes. Proc. conference on functional programming and computer architecture – Wadler - 1985 |
| 4 | The essence of functional programming. Proc. principles of programming languages – Wadler - 1992 |
| 2 | The Haskell language report, version 1.3. Research Report YALEU/DCS/RR-1106 – Peterson - 1996 |
