Parsec, a fast combinator parser

[1]  William H. Burge,et al.  Recursive Programming Techniques , 1975 .

[2]  Marinus J. Plasmeijer,et al.  Efficient Combinator Parsers , 1998, IFL.

[3]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[4]  S. Doaitse Swierstra,et al.  Fast, Error Correcting Parser Combinatiors: A Short Tutorial , 1999, SOFSEM.

[5]  Philip Wadler,et al.  Featherweight Java: a minimal core calculus for Java and GJ , 1999, OOPSLA '99.

[6]  S. Doaitse Swierstra,et al.  Deterministic, Error-Correcting Combinator Parsers , 1996, Advanced Functional Programming.

[7]  Steve Hill,et al.  Combinators for parsing expressions , 1996, Journal of Functional Programming.

[8]  Simon Peyton Jones,et al.  Henk: a typed intermediate language , 1997 .

[9]  David Wright,et al.  Predictive parser combinators need four values to report errors , 1996, Journal of Functional Programming.

[10]  E. Meijer,et al.  Monadic parser combinators , 1996 .

[11]  Philip Wadler,et al.  The essence of functional programming , 1992, POPL '92.

[12]  Werner Kluge,et al.  Implementation of Functional Languages , 1996, Lecture Notes in Computer Science.

[13]  Jeroen D. Fokker,et al.  Functional Parsers , 1995, Advanced Functional Programming.

[14]  Graham Hutton,et al.  Higher-order functions for parsing , 1992, Journal of Functional Programming.

[15]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[16]  Niklas Röjemo.  Garbage Collection, and Memory Efficiency, in Lazy Functional Languages , 1995 .

[17]  Philip Wadler,et al.  Comprehending monads , 1990, LISP and Functional Programming.