It is clear, that current 'core' Haskell packages bear some weight of
legacy and back-compatibility, and accumulates garbage/problems over
time. Some of the garbage can be dropped and some was here for so long,
that it can't be dropped without major buzz.
For example, we have *Monad*
with same precedence)
a == b $ c = parse error (no ordering known between == and $)
a $ b + c = a $ (b+c)
I think this is a much cleaner way to solve the problem and I hope
something like it makes it into a future version of Haskell.
-- ryan
On Sun, Aug 12, 2012 at 11:46 AM, Евгений
During development some toy base library I found impossible to use
Numeric literals. Quick search showed, that one need both fromInteger in
scope (reasonable) and, as I understand, access to Integer type from
'base' package ('base' for clarity later). It is perfectly reasonable if
we assume
On 08/14/2012 02:52 PM, Ryan Ingram wrote:
On Tue, Aug 14, 2012 at 1:04 AM, Евгений Пермяков permea...@gmail.com
mailto:permea...@gmail.com wrote:
Your idea looks _much_ better from code clarity point of view, but
it's unclear to me, how to deal with it internally and in error
fixity declaration has form *infix(l|r)? [Digit]* in haskell. I'm pretty
sure, that this is not enough for complicated cases. Ideally, fixity
declarations should have form *infix(l|r)? [Digit](\.(+|-)[Digit])** ,
with implied infinitely long repeated (.0) tail. This will allow fine
tuning of
Can someone tell me if there are any primitives, that used to detect
machine type overflows, in ghc haskell ? I perfectly understand, that I
can build something based on preconditioning of variables, but this will
kill any performance, if needed.
On 07/31/2012 12:04 AM, Artyom Kazak wrote:
Евгений Пермяков permea...@gmail.com писал в своём письме Mon, 30
Jul 2012 09:47:48 +0300:
Can someone tell me if there are any primitives, that used to detect
machine type overflows, in ghc haskell ? I perfectly understand, that
I can build
return $ rr rv
On 07/26/2012 12:48 PM, Ross Paterson wrote:
On Wed, Jul 25, 2012 at 09:22:23PM +0100, Евгений Пермяков wrote:
So, it seems for me, that Applicative API should be extended with
typeclass for making choice what actions to execute depending on result
of some test (pattern
, Евгений Пермяков wrote:
class Applicative f = Actuative f where
-- | select computation conditionally . Side effects of only one two
alternative take place
select :: f (Either a b) -- ^ selector
- f (a - c) -- ^ first alternative
- f (b - c) -- ^ second
Let assume, that some computation takes argument and produces value
Either a b. This computation may be represented in for different forms
computePure :: a - Either b c
computeMonad :: a - m (Either b c)
computeApplicative :: app a - app (Either b c)
computeArrow :: arr a (Either b c)
When I try cabal-install lambdabot (gentoo linux/amd64, ghc installed with
portage), it runs fine until compiler tries to link readline package (some
template haskell?). The problem caused by dirty trick, used in gentoo: the
/usr/lib64/libreadline is a fake with script, redirecting ld to /lib64 .
11 matches
Mail list logo
