Hey Benjamin,
At this time no it doesn't, it only supports Linux ( no Mac support either
), but I have plans to add in Windows support if I get good feedback on it
people want more from it :D
Regards,
Michael
On Tue, Apr 28, 2009 at 4:19 AM, Benjamin L.Russell
dekudekup...@yahoo.comwrote:
On
A new version of the OpenGL package has bee uploaded to Hackage. This is
mainly a bug fix release, containing the following changes:
* Minor tweaks for recent Cabal versions.
* Removal of old GHC build system relics.
* Handle invalid framebuffer operation error.
* Terminate GLSL
A new version of the GLUT package has been uploaded to Hackage. This is a
feature release, adding all the shiny new features of the upcoming freeglut
2.6.0 C library plus a few older bits and pieces which had been missing:
* Minor tweaks for recent Cabal versions
* Removal of old GHC build
A new version of the OpenAL package has been uploaded to Hackage. This is a
bug fix only release:
* Minor tweaks for recent Cabal versions
* Removal of old GHC build system relics.
* Use the correct calling convention on Windows.
Cheers,
S.
A new version of the ALUT package has been uploaded to Hackage. This is a bug
fix only release, containing only tiny changes:
* Minor tweaks for recent Cabal versions
* Removal of old GHC build system relics.
Cheers,
S.
___
Haskell mailing
The new uu-parsinglib package is the first version of the new parsing
combinator library package from Utrecht University.
Features:
- online result construction
- much simpler internals than the combinators in the uulib package,
because of the availabilty of GADT's and other extensions
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#3195: runghc failing sometimes
+---
Reporter: juhpetersen | Owner:
Type: bug | Status: new
Priority: normal | Component: Runtime System
Version:
#3196: libHSffi_p.a should not be created when profiled libs are disabled
-+--
Reporter: juhpetersen | Owner:
Type: bug | Status: new
Priority: normal
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#2770: Missing check that C compiler is C99 compatible
-+--
Reporter: jputcu|Owner:
Type: bug | Status: closed
Priority: normal|Milestone: 6.12.1
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#2971: readFile /proc/mounts hangs on an amd64 machine
-+--
Reporter: dsf |Owner: igloo
Type: merge | Status: closed
Priority: high |Milestone:
#2965: GHC on OS X does not compile 64-bit
+---
Reporter: Axman6 |Owner: thoughtpolice
Type: feature request | Status: new
Priority: normal |Milestone:
Am Samstag, 25. April 2009 14:48:03 schrieb Sven Panne:
Currently I am unable to make inter-module links (of the form
'Foo.Bar.baz') work with the Haddock shipped with GHC 6.10.2. [...]
Until a few moments ago, I wasn't aware of the fact that Haddock has a trac
for itself nowadays, so I guess
2009/4/28 Sven Panne sven.pa...@aedion.de:
Am Samstag, 25. April 2009 14:48:03 schrieb Sven Panne:
Currently I am unable to make inter-module links (of the form
'Foo.Bar.baz') work with the Haddock shipped with GHC 6.10.2. [...]
Until a few moments ago, I wasn't aware of the fact that Haddock
#3197: disambiguating type family instances with qualified names not possible
-+--
Reporter: claus | Owner:
Type: bug | Status: new
#3198: inliner fails to kick in for Double (*)
-+--
Reporter: JulesBean | Owner:
Type: bug | Status: new
Priority: normal|
#3199: System.Environment provides no access to argv[0]
-+--
Reporter: guest | Owner:
Type: bug | Status: new
Priority: normal|
#3200: System.Environment.withProgName strips everything before the last slash
-+--
Reporter: guest | Owner:
Type: bug | Status: new
Priority:
#3199: System.Environment provides no access to argv[0]
--+-
Reporter: guest | Owner:
Type: bug | Status: new
Priority: normal|
#3199: System.Environment provides no access to argv[0]
--+-
Reporter: guest | Owner:
Type: bug | Status: new
Priority: normal|
#3198: inliner fails to kick in for Double (*)
--+-
Reporter: JulesBean | Owner:
Type: bug | Status: new
Priority: normal|
Thanks Simon,
sorry for not noticing your reply amidst the flow of g-h-b ticket reports
before now. As there is no need to sail that close to the wind of
playing with the delicate linking loading orders of the CRT and
base DLLs like kernel32, my suggestion would be simply to avoid
it. You don't
#3198: inliner fails to kick in for Double (*)
--+-
Reporter: JulesBean | Owner:
Type: bug | Status: new
Priority: normal|
Thanks for your comments.
Check whether it is GC-bound by using +RTS -sstderr.
Well yes, it does a lot of GC (there's no way for the compiler
to optimize away the list of primes) because that was the point
of the example: to confirm (or disprove)
that GC hurts parallelism (at the moment).
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Apr 28, 2009, at 01:24 , Scott Michel wrote:
I've been hacking along on a NetBeans Haskell plugin (*) Looking at
Parser.y.pp, because both Eclipse and NetBeans work with antlr, it
seems like there are interesting cases in which chimeric
2009/4/28 Scott Michel scooter@gmail.com:
This got me to thinking that either ghc has issues or I have some
fundamental misunderstanding of Haskell syntax. Or, maybe I should use
someone else's grammar.
GHC's parser is over-generous by design. See
On Tue, Apr 28, 2009 at 1:09 PM, Max Bolingbroke
batterseapo...@hotmail.com wrote:
2009/4/28 Scott Michel scooter@gmail.com:
This got me to thinking that either ghc has issues or I have some
fundamental misunderstanding of Haskell syntax. Or, maybe I should use
someone else's grammar.
2009/4/28 Thomas Hartman tphya...@gmail.com
I suppose this means that the points-free/pattern binding-style
version is a bit less work for ghc to execute (fewer reductions),
whereas the version with lambda bound variables is easier to debug.
I don't think there is any (significant) difference
On 22:19 Mon 27 Apr , Martijn van Steenbergen wrote:
Tillmann Rendel wrote:
Achim Schneider wrote:
In other words:
1) Explain Pointed
2) Explain Functor
3) Explain Applicative
4) Explain Monad
Why Pointed first? Functor seems more useful and more basic.
They are in order of power:
Steffen Schuldenzucker wrote:
Uhm, isn't it:
class (Functor f) = Pointed f where
pure :: a - f a -- singleton, return, unit etc.
Got it from: The Typeclassopedia by Brent Yorgey (forgot the URL, sorry)
Yes, but also: http://thread.gmane.org/gmane.comp.lang.haskell.cafe/54685
So maybe
Implementing exactly Haskell's rule for indentation is incredibly hard.
In fact, no known Haskell compiler gets it right.
But if you make a slightly simpler one, it's easy. The simple one is
the one based only on indentation.
There are different ways you can do this.
For instance, you can
On Mon, Apr 27, 2009 at 4:19 PM, Martijn van Steenbergen
mart...@van.steenbergen.nl wrote:
They are in order of power: every monad is an applicative; every
applicative is a functor; every functor is pointed.
Though I can't think of any non-functor pointiness at the moment.
Martijn.
On
Jason Dusek jason.du...@gmail.com wrote:
2009/04/21 Manlio Perillo manlio_peri...@libero.it:
Luke Palmer ha scritto:
And many other permutations, with differing degrees of
laziness and parametericity.
As long as you stricly read a string from the socket, this is
ok. But you can not
On 04:33 Tue 28 Apr , Matthew Gruen wrote:
On the other hand, here's an un-pure-able and un-point-able functor:
instance Functor ((,) m) where
--fmap :: (n - n') - (m, n) - (m, n')
fmap f (m, n) = (m, f n)
n - (m, n) is not a function you can write in general
Bas van Gijzel wrote:
Hello everyone,
I'm doing a bachelor project focused on comparing parsers. One of the
parser libraries I'm using is Parsec (2) and I'm going to implement a
very small subset of haskell with it, with as most important feature
the off-side rule (indentation based parsing)
I'm not sure what you're asking by define type Random [Int]? Your
type Random a will allow a to be any type, e.g. [Int] is perfectly fine.
If what you're asking is how do you get from Random Int to Random
[Int], the usual answer would be to use
replicateM :: Monad m = Int - m a - m [a]
On Mon, Apr 27, 2009 at 11:00 PM, siki ga...@karamaan.com wrote:
I'm not sure if this is possible at all. I'd like to do something like this:
class A a where
foo :: a - Double
foo a = 5.0
class (A a) = B a where
foo a = 7.0
I probably don't understand the question properly,
Hello fellow haskellers. This message is a valid literate haskell
file. I ran it with ghc 6.10.1
module TraverseAccum where
import Control.Applicative
import Data.Traversable
A year ago, I read Why Attribute Grammars Matter. In it we found a
function on lists wich combined three traversals
If I for some data type wants to derive, in this case Data and
Typeable for use with syb code, but the problem is the same regardless
what I want to derive.
data family Something
data Tree = Leaf Something | Fork Something Tree Tree
deriving (Data, Typeable)
The problem is I
2009/4/28 Tuve Nordius t...@student.chalmers.se:
If I for some data type wants to derive, in this case Data and Typeable for
use with syb code, but the problem is the same regardless what I want to
derive.
data family Something
data Tree = Leaf Something | Fork Something Tree Tree
PS: In a meta interpreter, lexical scope seems to be actually easier
to implement than dynamic scope.
Depends on whether your meta-language is lexically or
dynamically scoped.
Stefan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hey,
Thanks for the help thusfar. These are interesting suggestions, and I think
the occam-pi compiler would help a bit as example. I'll force myself to
learn some more about the state monad, but I haven't found really good
examples except in Real World Haskell until now so I hope I'll manage.
Christian Maeder schrieb:
Putting commas in the front, better indicates the continuation, but the
extra space following the open bracket ( looks a bit odd. (Surely one
could also leave a space before the closing bracket, although I wouldn't
like spaces around all brackets.)
The
As Lennart said, the complete offside rule as found in Haskell is
almost impossible to get right. This is mainly due to the way in which
it is formulated: in terms of error correction. This makes it very
difficult to build a parser for such rules which have error correction
built into
Hello,
Is there anyway when defining a dat type record struct to indicate
default values for some of the fields?
Regards, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, Apr 28, 2009 at 4:09 PM, Vasili I. Galchin vigalc...@gmail.comwrote:
Hello,
Is there anyway when defining a dat type record struct to indicate
default values for some of the
fields?
The usual pattern is to use a default record, and specialize it:
data Foo = Foo { bar :: Int,
Standard ML's answer to that kind of issue is type sharing.
Does type sharing help with making modules retroactively compatible?
It would be as if one could write modules parameterised by types,
instead of declaring them locally, and being able to share a type
parameter over several imports:
I've stumbled upon a structure that is like a weaker version of a monad,
one that supports return and but not =. Has anyone seen this
before, and if so, does it have a standard name?
Mike
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Michael Vanier wrote:
I've stumbled upon a structure that is like a weaker version of a
monad, one that supports return and but not =. Has anyone seen
this before, and if so, does it have a standard name?
Mike
___
Haskell-Cafe mailing list
On Tue, Apr 28, 2009 at 3:54 PM, Michael Vanier mvanie...@gmail.com wrote:
I've stumbled upon a structure that is like a weaker version of a monad,
one that supports return and but not =. Has anyone seen this before,
and if so, does it have a standard name?
That's similar to Applicative,
On Tue, Apr 28, 2009 at 4:54 PM, Michael Vanier mvanie...@gmail.com wrote:
I've stumbled upon a structure that is like a weaker version of a monad,
one that supports return and but not =. Has anyone seen this before,
and if so, does it have a standard name?
That is a strange structure.
Tony Morris wrote:
Michael Vanier wrote:
I've stumbled upon a structure that is like a weaker version of a
monad, one that supports return and but not =. Has anyone seen
this before, and if so, does it have a standard name?
Mike
___
I suspect your structure doesn't exist.
A Kleisli algebra (a - m b) has a full subalgebra (() - m ()), but (()
- m b) is not an algebra (it is not closed).
I'm guessing that the largest proper subset of (a - m b) is just
(() - m ()).
Dan
Tony Morris wrote:
Michael Vanier wrote:
I've
On Tue, Apr 28, 2009 at 5:33 PM, Michael Vanier mvanie...@gmail.com wrote:
Tony Morris wrote:
Michael Vanier wrote:
I've stumbled upon a structure that is like a weaker version of a
monad, one that supports return and but not =. Has anyone seen
this before, and if so, does it have a
Luke Palmer wrote:
On Tue, Apr 28, 2009 at 5:33 PM, Michael Vanier mvanie...@gmail.com
mailto:mvanie...@gmail.com wrote:
Tony Morris wrote:
Michael Vanier wrote:
I've stumbled upon a structure that is like a weaker version of a
monad, one that supports return and but
Michael Vanier wrote:
Luke Palmer wrote:
Michael Vanier wrote:
Are you sure it supports
() :: m a - m b - m b
and not
mplus :: m a - m a - m a ?
Yeah, you're right. It's basically a monad where the type a is
fixed to be (), so you just have
()
Hi guys,
I'm sorry, I asked this before ...
What is the flag you have to pass during ghc --make
in order to produce an exe on Windows that doesn't open a DOS window.
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi,
My Prelude docs must be out of date because chr and ord don't seem to be there.
How do I access these functions?
Michael
===
[mich...@localhost ~]$ ghci
GHCi, version 6.10.1: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ... linking ... done.
Loading
Michael, those functions are not in the Prelude, they're in Data.Char.
On Tue, Apr 28, 2009 at 8:08 PM, michael rice nowg...@yahoo.com wrote:
Hi,
My Prelude docs must be out of date because chr and ord don't seem to be
there. How do I access these functions?
Michael
===
On Mon, Apr 27, 2009 at 04:34:27PM +1200, Richard O'Keefe wrote:
(5) A generator that generates native code to
be called through FFI.
It may be interesting to see the LLVM package, it's pretty much
straightforward to use it with numerical calculations.
--
Felipe.
Thank guys,
Now what am I misunderstanding in the code below?
I would think that
*Main comb (Just 65) foo
and
*Main comb (lookup 'A' lst) foo
would return the same result
Just 'A'
Michael
===Haskell code=
import Data.Char
lst = [('A',65),('B',66),('C',67),('D',68)]
On Apr 28, 2009, at 23:32 , michael rice wrote:
Thank guys,
Now what am I misunderstanding in the code below?
lst = [('A',65),('B',66),('C',67),('D',68)]
You didn't give a type for lst, so it defaulted to [(Char,Integer)].
This is a manifestation of the Monomorphism Restriction, invoked
Yep, that fixed it..
Thanks, Brandon.
Michael
--- On Tue, 4/28/09, Brandon S. Allbery KF8NH allb...@ece.cmu.edu wrote:
From: Brandon S. Allbery KF8NH allb...@ece.cmu.edu
Subject: Re: [Haskell-cafe] chr/ord?
To: michael rice nowg...@yahoo.com
Cc: Brandon S. Allbery KF8NH allb...@ece.cmu.edu,
2009/4/28 Bas van Gijzel neneko...@gmail.com
I'm doing a bachelor project focused on comparing parsers. One of the
parser libraries I'm using is Parsec (2) and I'm going to implement a very
small subset of haskell with it, with as most important feature the off-side
rule (indentation based
-optl-mwindows is the magic incantation to use. --sigbjorn
On 4/28/2009 17:37, Gü?nther Schmidt wrote:
Hi guys,
I'm sorry, I asked this before ...
What is the flag you have to pass during ghc --make
in order to produce an exe on Windows that doesn't open a DOS window.
Günther
Keith Battocchi wrote:
Thanks for explicitly writing out the unification steps; this makes it
perfectly clear where things are going wrong. I was hoping to be able to
have
b' ~ b, l' b' ~ (l b, l b), and z' b' ~ (z b, z b). I guess it makes sense
that these types can't be inferred - is
70 matches
Mail list logo
