The constrained-monad problem

DOI10.1145/2500365.2500602MaRDI QIDQ5244810zbMATH OpenOpenAlexFDO

Authors Neil Sculthorpe, Jan Bracker, George Giorgidze, Andy Gill

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 http://irep.ntu.ac.uk/id/eprint/27906/1/PubSub5461_Sculthorpe.pdf

zbMATH Keywords

class constraintsdeep embeddingsHaskellmonads

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Simple and compositional reification of monadic embedded languages
• Composing monads using coproducts
• Deconstraining DSLs
• scientific article; zbMATH DE number 1630114
• Haskell type constraints unleashed

Cited in

(7)

• Combining deep and shallow embedding of domain-specific languages
• Deconstraining DSLs
• Simple and compositional reification of monadic embedded languages
• A language for hierarchical data parallel design-space exploration on GPUs
• Programming monads operationally with Unimo
• Smart Choices and the Selection Monad
• Domain-specific tensor languages

Describes a project that uses

Uses Software

• Haskell
• MonadPrompt
• rmonad

This page was built for publication: The constrained-monad problem

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