article

Monads and composable continuations

Author:

Philip WadlerAuthors Info & Claims

Lisp and Symbolic Computation, Volume 7, Issue 1

Pages 39 - 56

https://doi.org/10.1007/BF01019944

Published: 01 January 1994 Publication History

Abstract

No abstract available.

Cited By

View all

Wadler P(2021)GATE: Gradual Effect TypesLeveraging Applications of Formal Methods, Verification and Validation10.1007/978-3-030-89159-6_21(335-345)Online publication date: 17-Oct-2021
https://dl.acm.org/doi/10.1007/978-3-030-89159-6_21
Elliott P(2018)Applicatives for Anaphora and PresuppositionNew Frontiers in Artificial Intelligence10.1007/978-3-030-31605-1_19(256-269)Online publication date: 12-Nov-2018
https://dl.acm.org/doi/10.1007/978-3-030-31605-1_19
Forster YKammar OLindley SPretnar M(2017)On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited controlProceedings of the ACM on Programming Languages10.1145/31102571:ICFP(1-29)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3110257
Show More Cited By

Index Terms

Monads and composable continuations
1. Mathematics of computing
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics

Recommendations

Coproducts of Monads on Set
LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science

Coproducts of monads on $\Set$ have arisen in both the study of computational effects and universal algebra. We describe coproducts of consistent monads on $\Set$ by an initial algebra formula, and prove also the converse: if the coproduct exists, so do ...
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous

We revisit the connection between three notions of computation: Moggi s monads, Hughes s arrows and McBride and Paterson s idioms (also called applicative functors). We show that idioms are equivalent to arrows that satisfy the type isomorphism A B 1 (A ...
Interaction Laws of Monads and Comonads
LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science

We introduce and study functor-functor and monad-comonad interaction laws as mathematical objects to describe interaction of effectful computations with behaviors of effect-performing machines. Monad-comonad interaction laws are monoid objects of the ...

Comments

Information & Contributors

Information

Published In

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 January 1994

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wadler P(2021)GATE: Gradual Effect TypesLeveraging Applications of Formal Methods, Verification and Validation10.1007/978-3-030-89159-6_21(335-345)Online publication date: 17-Oct-2021
Elliott P(2018)Applicatives for Anaphora and PresuppositionNew Frontiers in Artificial Intelligence10.1007/978-3-030-31605-1_19(256-269)Online publication date: 12-Nov-2018
Forster YKammar OLindley SPretnar M(2017)On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited controlProceedings of the ACM on Programming Languages10.1145/31102571:ICFP(1-29)Online publication date: 29-Aug-2017
Ahman DHriţcu CMaillard KMartínez GPlotkin GProtzenko JRastogi ASwamy N(2017)Dijkstra monads for freeACM SIGPLAN Notices10.1145/3093333.300987852:1(515-529)Online publication date: 1-Jan-2017
Ahman DHriţcu CMaillard KMartínez GPlotkin GProtzenko JRastogi ASwamy NCastagna GGordon A(2017)Dijkstra monads for freeProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009878(515-529)Online publication date: 1-Jan-2017
Castagna GGordon A(2017)Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming LanguagesundefinedOnline publication date: 1-Jan-2017
Bracker JNilsson H(2016)Supermonads: one notion to bind them allACM SIGPLAN Notices10.1145/3241625.297601251:12(158-169)Online publication date: 8-Sep-2016
Bracker JNilsson HMainland G(2016)Supermonads: one notion to bind them allProceedings of the 9th International Symposium on Haskell10.1145/2976002.2976012(158-169)Online publication date: 8-Sep-2016
Bracker JNilsson HLämmel R(2015)Polymonad programming in HaskellProceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages10.1145/2897336.2897340(1-12)Online publication date: 14-Sep-2015
Biernacki DDanvy OMillikin K(2015)A Dynamic Continuation-Passing Style for Dynamic Delimited ContinuationsACM Transactions on Programming Languages and Systems10.1145/279407838:1(1-25)Online publication date: 16-Oct-2015
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Coproducts of Monads on Set

Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous

Interaction Laws of Monads and Comonads

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations