Journal of Functional Programming · 1992 · 183 citations · 5 references
Language StudiesComputer ScienceCombinatoricsNatural Language ProcessingSyntaxParsingSyntactic AnalysisSyntactic ParsingSyntactic ProcessingSyntax AnalysisSyntax ParsingHigher-order FunctionsLanguage ParsingParser CombinatorsParser DesignParsing AlgorithmsParsing Theory
Abstract In combinator parsing , the text of parsers resembles BNF notation. We present the basic method, and a number of extensions. We address the special problems presented by white-space, and parsers with separate lexical and syntactic phases. In particular, a combining form for handling the ‘offside rule’ is given. Other extensions to the basic method include an ‘into’ combining form with many useful applications, and a simple means by which combinator parsers can produce more informative error messages.
5
Report on the programming language Haskell
Paul Hudak, Simon Peyton Jones, Philip Wadler et al. · ACM SIGPLAN Notices · 1992 · 1K citations · Full text
The next 700 programming languages
P. J. Landin · Communications of the ACM · 1966 · 581 citations · Full text
How to replace failure by a list of successes
Philip Wadler · 1985 · 110 citations