KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
Going back to at least the late 1990s there have been people wishing for the integration of restricted monads into Haskell in a friendly way. For example, without restricted monads you can't make an efficient monad out of Set , Map or probability distributions . Here's a SO question from a few years ago where someone else ran afoul of this problem. There are various workarounds that people have come up with, including: Creating a new type class for every possible restriction. Using Template Haskell . Using Constraint Kinds . None of these approaches seem to be "canonical" however. I found a comment from Don Stewart on this blog post , in 2007, where he intimated that we were "quite close" to having restricted monads with Indexed types . What is the current status? Is there now a 'canonical' way to do restricted monads? Or we are still living with workarounds?
Tags (comma-separated)
Save Edits
Cancel