Finally tagless observable recursion for an abstract grammar model

DOI10.1017/S0956796812000226zbMath1273.68074OpenAlexW2043894777MaRDI QIDQ5300699

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

zbMATH Keywords

abstract grammarfinally tagless

Mathematics Subject Classification ID

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

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