Gus
Gus
A sort of "infinite" dictionary would allow it to act as a Monad and Applicative.
This will implement #44 A quotation monad allow us to compose functions returning expressions. At the end of the composition we get a single expression, internally containing markers where an...
An attempt to clarify the ideas expressed there.
This will switch to use the internal technique of ~~tupling~~ wrapping in order to avoid flexible types in overloads for the Applicative dispatcher. Right now there are 2 issues: -...
When grouping sequences typically through a `groupBy` operation, all subsequences we get are never empty. This means that using a `NonEmptySeq` should be more appropriate and it will provide additional...
I think at least `Option.ofNullable`should be added. @mausch did a [whole module](http://www.fssnip.net/1A/title/Functions-around-nullable-types) some years ago, I don't think we should add all of them. Remember that Nullable are restricted to...
`ToSeq` Invokable has an overload for IEnumerable which has lower priority than the custom implementation (ToSeq explicitly defined on the type). This cause some inconsistencies, in dictionary like types where...
Roadmap V2.0
I think for V2.0 we can start discussing features here, before moving to a formal project. What comes to my mind at the moment is: 1. Remove subsumption from Applicatives:...
Improve docs
I opened this issue to discuss how can we improve the docs. It's very valuable the input from users, as I have a deep knowledge of the library already, so...
I'm opening this issue as a centralized place to discuss and review the current design of the generic Computation Expressions. The main issue of the current design was highlighted by...