Monadic parsing in Haskell

DOI10.1017/S0956796898003050zbMath0917.68039OpenAlexW1997644097MaRDI QIDQ4236886

Erik Meijer, G. Hutton

Publication date: 8 August 1999

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796898003050

zbMATH Keywords

Haskellrecursive descent parsers

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items

Shortcut fusion rules for the derivation of circular and higher-order programs, On the semantics of parsing actions, A New Method for Dependent Parsing, Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers, Combinator Parsers: From Toys to Tools, Applicative programming with effects, Combinator Parsing: A Short Tutorial, Dependent Types and Fibred Computational Effects, PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION, Functional programming concepts and straight-line programs in computer algebra, Merging Hierarchically-Structured Documents in Workflow Systems

Uses Software

• Haskell