Lightweight monadic programming in ML

DOI10.1145/2034773.2034778MaRDI QIDQ5176958zbMATH OpenOpenAlexFDO

Authors

Publication date 5 March 2015

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

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

zbMATH Keywords

coercioncoherencemonadrewritingtype

Mathematics Subject Classification ID

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

Recommendations

• Polymonadic programming
• Modular Monad Transformers
• scientific article; zbMATH DE number 2090722
• Unifying theories of programming with monads
• Monadification of functional programs

Cited in

(7)

• Monadification of functional programs
• A (co)algebraic theory of succinct automata
• Eliom: A Core ML Language for Tierless Web Programming
• Generating reversible circuits from higher-order functional programs
• Polymonadic programming
• Doo bee doo bee doo
• Simple and compositional reification of monadic embedded languages

This page was built for publication: Lightweight monadic programming in ML

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