Monadic Parsing in Haskell

Monadic Parsing in Haskell (1993)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Graham Hutton , Erik Meijer

Citations:

45 - 0 self

BibTeX

@MISC{Hutton93monadicparsing,
    author = {Graham Hutton and Erik Meijer},
    title = {Monadic Parsing in Haskell},
    year = {1993}
}

Years of Citing Articles

Bookmark

OpenURL

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, 1992; Fokker, 1995), the use of monads to structure functional programs (Wadler, 1990; Wadler, 1992a; Wadler, 1992b), and the use of special syntax for monadic programs in Haskell (Jones, 1995; Peterson et al. , 1996). More specifically, the paper shows how to define monadic parsers using do notation in Haskell.

Citations

418	Comprehending monads - Wadler - 1990
240	Compilers: principles, techniques and tools - Aho, Sethi, et al. - 1986
171	A system of constructor classes: overloading and implicit higher-order polymorphism - Jones - 1993
103	Recursive Programming Techniques - Burge - 1975
94	Higher-order functions for parsing - Hutton - 1992
8	Ratatosk: a parser generator and scanner generator for Gofer - Mogensen - 1993
4	Functional parsers. Lecture notes of the Baastad Spring school on functional programming - Fokker - 1995
4	Happy – The Parser Generator for Haskell - Gill, Marlow - 1995
2	How to replace failure by a list of successes. Proc. conference on functional programming and computer architecture - Wadler - 1985
2	The essence of functional programming. Proc. principles of programming languages - Wadler - 1992
1	The Haskell language report, version 1.3. Research Report YALEU/DCS/RR-1106 - Peterson - 1996