Lightweight monadic programming in ML

DOI10.1145/2034773.2034778zbMath1323.68166OpenAlexW4244177239MaRDI QIDQ5176958

No author found.

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

coherencetyperewritingmonadcoercion

Mathematics Subject Classification ID

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

Related Items (3)

Generating Reversible Circuits from Higher-Order Functional Programs ⋮ A (co)algebraic theory of succinct automata ⋮ Doo bee doo bee doo

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