Deterministic, Error-Correcting Combinator Parsers (1996)

Cached

Download Links

by S. Doaitse Swierstra , Luc Duponcheel
Venue:ADVANCED FUNCTIONAL PROGRAMMING
Citations:57 - 10 self

Documents Related by Co-Citation

47 Functional Parsers – Jeroen Fokker - 1995
56 Monadic Parsing in Haskell – Graham Hutton, Erik Meijer - 1993
57 Monadic Parser Combinators – Graham Hutton , Erik Meijer - 1996
98 Higher-Order Functions for parsing – Graham Hutton - 1993
106 Recursive Programming Techniques – W BURGE - 1975
9 How to replace failure with a list of successes – P WADLER - 1985
1312 Monads for functional programming – Philip Wadler - 1995
32 Generalising Monads to Arrows. Science of Computer Programming, 37:67–111, May 2000. R. van der Meyden. Finite State Implementations of Knowledge-Based Programs – J Hughes
13 a fast Combinator Parser – Parsec - 2001
92 98 Language and Libraries: The Revised Report – Peyton Jones, S Haskell - 2003
48 A new notation for arrows – Ross Paterson - 2001
99 Premonoidal Categories and Notions of Computation – John Power, Edmund Robinson - 1995
159 Generalising Monads to Arrows – John Hughes - 1998
93 Polytypic programming – Patrik Jansson - 2000
8 Lazy Lexing is Fast – Manuel M.T. Chakravarty - 1999
86 How to replace failure by a list of successes – P Wadler - 1985
20 Parsing Permutation Phrases – Arthur Baars, Andres Löh, S. Doaitse Swierstra - 2001
82 The Design of a Pretty-printing Library – John Hughes - 1995
77 FUDGETS - A Graphical User Interface in a Lazy Functional Language – Magnus Carlsson, Thomas Hallgren - 1993