Functional pearl: Monadic parsing in Haskell

Journal of Functional Programming

Volumn 8, Issue 4, 1998, Pages 437-444

  Hutton, Graham ^a   Meijer, Erik ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042872297     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796898003050     Document Type: Article

References (12)

1. Aho, A., Sethi, R. and Ullman, J. (1986) Compilers - Principles, Techniques and Tools. Addison-Wesley.
2. Burge, W, H. (1975) Recursive Programming Techniques. Addison-Wesley.
3. Fokker, J. (1995) Functional parsers. Lecture Notes of the Baastad Spring School on Functional Programming.
4. Gill, A. and Marlow, S. (1995) Happy: the parser generator for Haskell. University of Glasgow.
5. Hutton, G. (1992) Higher-order functions for parsing. J. Functional Programming, 2(3), 323-343.
6. Jones, M. P. (1995) A system of constructor classes: overloading and implicit higher-order polymorphism. J. Functional Programming, 5(1), 1-35.
7. Mogensen, T. (1993) Ratatosk: A parser generator and scanner generator for Gofer. University of Copenhagen (DIKU).
8. Peterson, J. et al. (1996) The Haskell Language Report, version 1.3. Research report YALEU/DCS/RR-1106, Yale University.
9. Wadler, P. (1985) How to replace failure by a list of successes. Proc. Conf. on Functional Programming and Computer Architecture. Springer-Verlag.
10. Wadler, P. (1990) Comprehending monads. Proc. ACM Conf. on Lisp and Functional Programming.
11. Wadler, P. (1992a) The essence of functional programming. Proc. Principles of Programming Languages.
12. Wadler, P. (1992b) Monads for functional programming. In: Broy, M. (ed.), Proc. Marktoberdorf Summer School on Program Design Calculi. Springer-Verlag.