Combinator Parsing: A Short Tutorial

DOI10.1007/978-3-642-03153-3_6zbMath1250.68083OpenAlexW2142778118MaRDI QIDQ5191092

S. Doaitse Swierstra

Publication date: 28 July 2009

Published in: Language Engineering and Rigorous Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03153-3_6

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (4)

More dependent types for distributed arrays ⋮ On the semantics of parsing actions ⋮ Interleaving Strategies ⋮ From Proposition to Program

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalising monads to arrows
• Monadic parsing in Haskell
• The String-to-String Correction Problem
• FUNCTIONAL PEARL Parsing permutation phrases
• FUNCTIONAL PEARL Parallel Parsing Processes
• Scripting the type inference process
• Applicative programming with effects

This page was built for publication: Combinator Parsing: A Short Tutorial