A Typed, Algebraic Approach to Parsing
- Submitting institution
-
University of Cambridge
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1884
- Type
- E - Conference contribution
- DOI
-
10.1145/3314221.3314625
- Title of conference / published proceedings
- Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation
- First page
- 379
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- June
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper won a distinguished paper award at PLDI, one of the leading conferences in programming language research. It gives a linear time implementation strategy for combinator parsing (in fact, outperforming parser generators like YACC) while retaining a declarative semantics for the recognised language. This is a long-standing problem in the functional programming community; most production combinator parsing libraries either have exponential (or worse) time complexity, or lack any specification of the recognised language beyond the code itself.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -