Finally tagless observable recursion for an abstract grammar model

DOI10.1017/S0956796812000226zbMATH Open1273.68074OpenAlexW2043894777MaRDI QIDQ5300699FDOQ5300699

Authors: Dominique Devriese, Frank Piessens 

Publication date: 28 June 2013

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

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

Recommendations

• Total parser combinators
• Dependently Typed Grammars
• Simple, functional, sound and complete parsing for all context-free grammars
• Combinator Parsing: A Short Tutorial
• Combinator Parsers: From Toys to Tools

zbMATH Keywords

abstract grammarfinally tagless

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18)

Cites Work

• Generalising monads to arrows
• Greibach normal form transformation revisited.
• Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
• What is a purely functional language?

This page was built for publication: Finally tagless observable recursion for an abstract grammar model

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