Simple and compositional reification of monadic embedded languages

DOI10.1145/2500365.2500611MaRDI QIDQ5244812zbMATH OpenOpenAlexFDO

Authors Josef Svenningsson, Bo Joel Svensson

Publication date 30 March 2015

Published in Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2500365.2500611

zbMATH Keywords

compilingembedded languagemonadsreification

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• The constrained-monad problem
• Lightweight monadic programming in ML
• Adaptable software: how to build a modular monadic extensible compiler using the state monad and pseudoconstructors over monadic values
• Comprehending monads
• scientific article; zbMATH DE number 2090722

Cited in

(6)

• Combining deep and shallow embedding of domain-specific languages
• Typed quote/antiquote or: compile-time parsing
• scientific article; zbMATH DE number 7533352 (Why is no real title available?)
• The constrained-monad problem
• A language for hierarchical data parallel design-space exploration on GPUs
• scientific article; zbMATH DE number 2219520 (Why is no real title available?)

Describes a project that uses

Uses Software

• Haskell
• Syntactic

This page was built for publication: Simple and compositional reification of monadic embedded languages

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