Recursive monadic bindings

DOI10.1145/351240.351257MaRDI QIDQ2943368zbMATH OpenOpenAlexFDO

Authors Levent Erkök, John Launchbury

Publication date 11 September 2015

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

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• An abstract monadic semantics for value recursion
• Monads in action
• Modular Monad Transformers
• Semantics of value recursion for Monadic Input/Output
• Just do it

Cited in

(7)

• A coinductive calculus for asynchronous side-effecting processes
• Semantics of value recursion for Monadic Input/Output
• Comonadic notions of computation
• A coinductive calculus for asynchronous side-effecting processes
• Compilation of extended recursion in call-by-value functional languages
• Traced Premonoidal Categories
• An abstract monadic semantics for value recursion

This page was built for publication: Recursive monadic bindings

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