Dear Group,
I have a simple question, that as far as I can tell, has never really
been well answered. I would like to generate TAGS files for haskell
source. Reading the http://www.haskell.org/haskellwiki/Tags page
suggests using :etags in GHCI or hasktags, or gasbag. Of the three,
hasktags
Hallo List,
I can't understand how pragma SPECIALIZE works in the presence of
constraints.
I have 2 modules, one which defines a general search framework, and one
which implements it in a concrete context. The general module defines
functions like:
{-# SPECIALIZE pvQSearch :: Node (Game
Would it be an accurate summary of this thread that people are asking
for (not including quibbles about naming and a few types):
class Ord a = Enum a where
succ :: a - a
pred :: a - a
fromEnum :: a - Int(eger)
toEnum :: Int(eger) - a
-- No instance for Float/Double
class Ord a =
On 26 September 2011 01:37, Nicu Ionita nicu.ion...@acons.at wrote:
1. how can the compiler (here ghc) know which function to expose as the
correct generic search function? There must be two search functions
generated, one generic and its specialization.
Yes, exactly. If you have:
{-#
On Sunday 25 September 2011, 19:20:52, Chris Smith wrote:
Would it be an accurate summary of this thread that people are asking
for (not including quibbles about naming and a few types):
Not quite, I'm afraid.
class Ord a = Enum a where
succ :: a - a
pred :: a - a
fromEnum ::
Don't mix range and arithmetic sequences. I want arithmetic sequences for
Double, Float and Rational, but not range.
(For Float and Double one could implement range [all values between the
given bounds, in increasing order, would be the desired/expected semantics
for that, I think?],
On Sunday 25 September 2011, 23:13:47, Chris Smith wrote:
Don't mix range and arithmetic sequences. I want arithmetic sequences
for Double, Float and Rational, but not range.
(For Float and Double one could implement range [all values between
the given bounds, in increasing order, would be
Hi,
As a weekend hack, I just realized that Haskell has this wonderful
DoRec syntax that among other things seems to be able to let the user
express context-free grammars together with their processing rules in
normal Haskell code, without template Haskell or anything like that,
just like parser
New versions of the package flexiwrap (supplying flexible wrappers for instance
selection) and related packages have been released to Hackage.
flexiwrap-0.1.0
data-type-0.1.0
function-combine-0.1.0
flexiwrap-smallcheck-0.0.1
flexiwrap version 0.1.0 supports instances of many
