Monadic parsing in Haskell

DOI10.1017/S0956796898003050MaRDI QIDQ4236886zbMATH OpenOpenAlexFDO

Authors Graham Hutton, Erik Meijer

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)

Recommendations

• Combinator Parsing: A Short Tutorial
• Combinator Parsers: From Toys to Tools
• Higher-order functions for parsing
• Generalising monads to arrows
• Total parser combinators

Cited in

(16)

• Double applicative functors
• Functional programming concepts and straight-line programs in computer algebra
• Shortcut fusion rules for the derivation of circular and higher-order programs
• On the semantics of parsing actions
• Tackling the awkward squad: Monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell
• Dependent types and fibred computational effects
• Merging hierarchically-structured documents in workflow systems
• A New Method for Dependent Parsing
• Even higher-order functions for parsing or Why would anyone ever want to use a sixth-order function?
• Combinator Parsers: From Toys to Tools
• Attribute grammars as recursion schemes over cyclic representations of zippers
• Combinator Parsing: A Short Tutorial
• Program extraction applied to monadic parsing
• Prolog's control constructs in a functional setting -- axioms and implementation
• Applicative programming with effects
• The Naproche-ZF theorem prover (short paper)

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Monadic parsing in Haskell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4236886)