In Control.Arrow we have:
|leftApp ::ArrowApply a = a b c - a (Either b d) (Either c d)|
Any instance of |ArrowApply| can be made into an instance of
|ArrowChoice| by defining |left = leftApp|.
So why isn't |ArrowChoice| a parent of |ArrowApply|?
Best regards,
Petr
On Thu, Jun 20, 2013 at 09:02:48AM +0200, Petr Pudlák wrote:
In Control.Arrow we have:
leftApp :: ArrowApply a = a b c - a (Either b d) (Either c d)
Any instance of ArrowApply can be made into an instance of ArrowChoice by
defining left = leftApp.
So why isn't ArrowChoice a
Here is the example with better rendering and additional information as
well as some identifies issues to be solved.
http://haskell-web.blogspot.com.es/2013/06/the-promising-land-of-monadic-formlets.html
And I made strong statements there.
What do you think? If you have questions or want to be
Have you tried dataToPatQ and dataToExpQ?
http://hackage.haskell.org/packages/archive/template-haskell/latest/doc/html/Language-Haskell-TH-Quote.html
Geoff
On 06/19/2013 11:23 PM, Brian Lewis wrote:
I want to use TH to generate functions like
foo :: c - h
foo ... = ...
foo ... = ...
...
I am pleased to announce the first public release of haskell-names, a
name resolution library for haskell-src-exts AST.
Namely, it can do the following:
* for a module, compute its interface, i.e. the set of entities
exported by the module, together with their original names.
* for each
Hi there,
I've just released the first version of [cascading], library for
writing/generating Cascading Style Sheets (CSS) in Haskell. The API
design is inspired by many other projects, including blaze-html, HSP and
Yesod's Lucius.
[cascading]: http://hackage.haskell.org/package/cascading
Ertugrul Söylemez e...@ertes.de wrote:
vendors $ borderRadius $= (3mm :: PropValue)
Typo: vendors $ border-radius $= (3mm :: PropValue)
Greets,
Ertugrul
--
Not to be or to be and (not to be or to be and (not to be or to be and
(not to be or to be and ... that is the list
Hi.
On 19 June 2013 23:23, Brian Lewis br...@lorf.org wrote:
The problem is, I don't know how to generate the function's clauses.
foo 0 = ... seems to be a LitP pattern. But foo True = ... seems to
be a ConP pattern. The appropriate pattern depends on type c.
I've used haskell-src-meta for