#1692: GLUT timedCallback fires twice
---+
Reporter: [EMAIL PROTECTED] |Owner: [EMAIL PROTECTED]
Type: bug | Status: new
Priority: normal
#1725: 6.8.0.20070917 Release candidate library haddock is broken
---+
Reporter: guest |Owner:
Type: bug | Status: closed
Priority: normal |
#1286: GHC infelicity list has not been updated since the switch to UTF-8
sources
---+
Reporter: Regidor |Owner: igloo
Type: bug | Status: closed
#1618: It it not possible to manage the output codification.
+---
Reporter: guest|Owner:
Type: feature request | Status: closed
Priority: normal |
#1730: type families GHC impossible happened
+---
Reporter: guest|Owner:
Type: bug | Status: new
Priority: normal |Milestone:
#1729: panic on type family
+---
Reporter: jpbernardy |Owner:
Type: bug | Status: new
Priority: normal |Milestone:
#1727: Precedence and associativity rules ignored when mixing infix type and
data
constructors in a single expression
--+-
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug|
#1723: type unsafety with type family + GADT
+---
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status: new
Priority: normal
#1700: GHC 6.8-20070913 (+extralibs) won't install after building
--+-
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug| Status: new
Priority:
#1680: Attempting to do foreign import with unboxed tuple return type causes GHC
panic
---+
Reporter: sorear |Owner:
Type: bug | Status: new
Priority:
#1483: vista: GHCi not loading 80% of the time
+---
Reporter: guest|Owner: simonmar
Type: bug | Status: reopened
Priority: high |Milestone: 6.8.1
Component: GHCi
#1700: GHC 6.8-20070913 (+extralibs) won't install after building
--+-
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug| Status: new
Priority:
#1700: GHC 6.8-20070913 (+extralibs) won't install after building
--+-
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug| Status: closed
Priority:
#1732: Proposal: Rename haskell@ to haskell-announce@
--+-
Reporter: neil | Owner:
Type: task | Status: new
Priority: normal | Milestone: Not GHC
Component: None
#1731: Proposal: Rename haskell@ to haskell-announce@
--+-
Reporter: neil | Owner:
Type: task | Status: new
Priority: normal | Milestone: Not GHC
Component: None
#1731: Proposal: Rename haskell@ to haskell-announce@
+---
Reporter: neil |Owner:
Type: task | Status: closed
Priority: normal |Milestone: Not GHC
Component:
#1692: GLUT timedCallback fires twice
---+
Reporter: [EMAIL PROTECTED] |Owner: [EMAIL PROTECTED]
Type: bug | Status: new
Priority: normal
Hi,
GHC version: win32 6.6.1
App was compiled with ghc -make -prof -auto-all files
... and run with app.exe appSpecificOptions +RTS -hc
The result is that app.exe.hp contains the sample items
in the format like
(651)/createAndRunWindows/... 180
The question is where can I find the full
John Lask wrote:
:
| The following code causes a C stack overflow in hugs (version 20051031)
| but not in ghc (version 6.6)
| The point of the exercise is to process a very large file lazily,
| returning the consumed and unconsumed parts (i.e. basic parser
combinators).
:
| sqnc p
Hi all.
When I was playing with Haskell and reading stuff about it, I noticed
that there is a lot of information in a form of research papers and a
lot of mathematics involved. I must confess that I quite like this
academic approach.
Well, I thought that while I am still at university I could
Tomas Caithaml wrote:
Any other suggestions?
Lattice theory. Actually just the part about continuous partial orders
and least fixed points suffice. It is hard to find a math course on
lattice theory that spends time on continuous partial orders; it is
easier to find a CS course on
Albert Y. C. Lai wrote:
Tomas Caithaml wrote:
Any other suggestions?
Lattice theory. Actually just the part about continuous partial
orders and least fixed points suffice. It is hard to find a math
course on lattice theory that spends time on continuous partial
orders; it is easier to find
On 23/09/2007, Albert Y. C. Lai [EMAIL PROTECTED] wrote:
Tomas Caithaml wrote:
Any other suggestions?
I don't think topology is much needed for Haskell. Whatever little is
needed manifests as lattice theory already. Topology has other uses in
CS, but take note that topological spaces
Mathematical logic would be a good thing to study if you haven't
already, especially if you can take something as specific as
intuitionistic / constructive / substructural logic. The Curry-Howard
correspondence lurks underneath a lot of Haskell intuitions and
techniques.
-- Fritz
On
fruehr:
Mathematical logic would be a good thing to study if you haven't
already, especially if you can take something as specific as
intuitionistic / constructive / substructural logic. The Curry-Howard
correspondence lurks underneath a lot of Haskell intuitions and
techniques.
---
Haskell Weekly News
http://sequence.complete.org/hwn/20070923
Issue 65 - September 23, 2007
---
Welcome to issue 65 of HWN, a newsletter covering
Hello,
This is the first release of hS3, a Haskell interface to Amazon's
Simple Storage Service. One week from conception to this release, it
is still rough around the edges, but the basic functionality does
work.
Get it from Hackage:
Hello Tomas,
Monday, September 24, 2007, 1:24:45 AM, you wrote:
Any other suggestions?
discrete mathematics and information theory
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
___
Haskell mailing list
Peter Verswyvelen wrote:
http://www.haskell.org/ghc/docs/2.10/users_guide/user_146.html
http://www.haskell.org/ghc/docs/2.10/users_guide/user_146.htmlseems
to confirm that?
Ouch.
Would it be possible to somehow prevent this behavious? (E.g., by
somehow annotating each black hole with
I'm not sure, but since it would require the detection of an evaluation
that does not terminate, it comes down to the halting problem, which is
not generally solvable. Maybe the experts can confirm my intuition?
Andrew Coppin wrote:
Peter Verswyvelen wrote:
If we're discussing bad versions of reverse, don't forget this one:
rev [] = []
rev (x:xs) =
case rev xs of
[] - [x]
y:ys - y : rev (x : rev ys)
It's different from most versions of reverse because it doesn't use any
auxiliarry functions.
It's also extremely inefficient.
--
Hi
I'm not sure, but since it would require the detection of an evaluation
that does not terminate, it comes down to the halting problem, which is
not generally solvable. Maybe the experts can confirm my intuition?
I think your intuition is off. This isn't the problem of detecting
that a
I agree. This situation is totally detectable.
On 9/23/07, Neil Mitchell [EMAIL PROTECTED] wrote:
Hi
I'm not sure, but since it would require the detection of an evaluation
that does not terminate, it comes down to the halting problem, which is
not generally solvable. Maybe the experts
On 9/17/07, Peter Verswyvelen [EMAIL PROTECTED] wrote:
Maybe this is a stupid question, but I don't find something similar in
Haskell.
I find mod and rem, which work on integers. But I'm looking for a function
similar to C's fmod.
Of course I can write it myself, but I guess it must
On Friday 21 September 2007 20:19, Ronald Guida wrote:
John Wicket wrote:
yea, that is probably what I need. Can you post in a step-by-step way.
Here is a set of instructions for what I had to do to get FreeGLUT
working with GHCi [...].
Oh dear, a long a sad story... :-(
[...] Although
Hello Lennart,
Sunday, September 23, 2007, 2:05:46 PM, you wrote:
i bet that general case contains too much conditions to check. program
may be unblocked by other thread, by OS signal, by I/O operation
completion, by C thread. how for example RTS can check that we have
started I/O operation with
On Thursday 20 September 2007 16:33, David Menendez wrote:
Does RPM, etc., deal with the fact that Haskell library installations
are specific to a particular platform?
It depends what you mean with deal: If it is only making sure that a given
binary library RPM matches the installed Haskell
On 9/23/07, Lennart Augustsson [EMAIL PROTECTED] wrote:
If we're discussing bad versions of reverse, don't forget this one:
rev [] = []
rev (x:xs) =
case rev xs of
[] - [x]
y:ys - y : rev (x : rev ys)
It's different from most versions of reverse because it doesn't use any
But this was a very particular case when a thread starts evaluating a node
and then comes back to the same node again.
The general case is (of course) undecidable.
On 9/23/07, Bulat Ziganshin [EMAIL PROTECTED] wrote:
Hello Lennart,
Sunday, September 23, 2007, 2:05:46 PM, you wrote:
i bet
Neil Mitchell wrote:
I think your intuition is off. This isn't the problem of detecting
Oh well, that happens when I try to help people when I don't really know
what I'm talking about ;-)
I though it was impossible to detect a deadlock (and a blackhole is
something like a deadlock no?)
Hello Lennart,
Sunday, September 23, 2007, 8:30:43 PM, you wrote:
and GHC stops executing this thread - wise solution. but it can't
decide whether some signal handlers/backcalls are established and so
whther are program definitely will never finish or not
But this was a very particular case
Well, my goal when I first wrote it was to see if I could write reverse
without calling any other functions.
I did realize that it was really bad. :)
-- Lennart
On 9/23/07, Felipe Almeida Lessa [EMAIL PROTECTED] wrote:
On 9/23/07, Lennart Augustsson [EMAIL PROTECTED] wrote:
If we're
On 9/23/07, Sven Panne [EMAIL PROTECTED] wrote:
On Thursday 20 September 2007 16:33, David Menendez wrote:
Does RPM, etc., deal with the fact that Haskell library installations
are specific to a particular platform?
It depends what you mean with deal: If it is only making sure that a given
Hello David,
Sunday, September 23, 2007, 10:28:41 PM, you wrote:
Let's say I have more than one Haskell implementation on my computer,
e.g. GHC 6.6, GHC 6.7, and Hugs. (In MacPorts, these are the ghc,
ghc-devel, and hugs packages, respectively.)
Let's further say that I want to install the
Bulat Ziganshin wrote:
Hello David,
Sunday, September 23, 2007, 10:28:41 PM, you wrote:
Let's say I have more than one Haskell implementation on my computer,
e.g. GHC 6.6, GHC 6.7, and Hugs. (In MacPorts, these are the ghc,
ghc-devel, and hugs packages, respectively.)
Let's further say
(redirecting to haskell-cafe)
Tom Pledger wrote:
| sqnc p ts = let ( r, ts' ) = p ts in case r of
| Nothing - ([],ts')
| Just x - let (r',ts'') = (sqnc p ts') in
(x:r', ts'' )
:
I don't know how ghc is avoiding the stack
Peter Verswyvelen wrote:
I though it was impossible to detect a deadlock (and a black hole is
something like a deadlock no?) *before* it occurred, but in this
case, we're talking about detecting it *when* it occurs, no? And
then raising an error instead of just blocking?
Generally, it's not
Hi
The haskell-cafe@ mailing list is more appropriate for messages such
as this. haskell@ is just for announcements (it should be called
haskell-annouce@ !)
* Lambda calculus - the basis of functional languages
* Category theory - where all these mysterious things like monads,
arrows, and
Hi
I've just replied to another first poster with wrong list. Its
entirely not their fault, but its also probably a bit off-putting that
your very first post gets a (very polite) you got it wrong message.
To steal the reasons and explanations from Ian:
-
pretty much what
Sven Panne wrote:
On Friday 21 September 2007 20:19, Ronald Guida wrote:
John Wicket wrote:
yea, that is probably what I need. Can you post in a
step-by-step way.
Here is a set of instructions for what I had to do to get FreeGLUT
working with GHCi [...].
Oh dear, a long a sad
Neil Mitchell wrote:
* Rename haskell@ to haskell-announce@, and redirect mails from haskell@
to haskell-announce@ for some period.
I agree. Unless... do some people subscribe to haskell@ (not
haskell-cafe@) and like the existing stuff that's sent there (not all
announcements... I'm not
Hi
I agree. Unless... do some people subscribe to haskell@ (not
haskell-cafe@) and like the existing stuff that's sent there (not all
announcements... I'm not sure if I'd call e.g. Oleg's occasional
demonstrations announcements even)?
There are four things sent to the haskell list@
1)
On 23/09/2007, Neil Mitchell [EMAIL PROTECTED] wrote:
Hi
The haskell-cafe@ mailing list is more appropriate for messages such
as this. haskell@ is just for announcements (it should be called
haskell-annouce@ !)
* Lambda calculus - the basis of functional languages
* Category theory -
Miguel Mitrofanov wrote:
A deadlock happens whenever two (or more) threads are blocked on each
other. Deadlocks can be extremely hard to detect, especially if they
occur intermittently.
Isn't that so much different from garbage collection? Replace
thread with chunk of data, and waits for
On Sun, 2007-09-23 at 20:03 -0400, Cale Gibbard wrote:
On 23/09/2007, Neil Mitchell [EMAIL PROTECTED] wrote:
Hi
The haskell-cafe@ mailing list is more appropriate for messages such
as this. haskell@ is just for announcements (it should be called
haskell-annouce@ !)
* Lambda
On 9/23/07, Isaac Dupree [EMAIL PROTECTED] wrote:
Bulat Ziganshin wrote:
Hello David,
Sunday, September 23, 2007, 10:28:41 PM, you wrote:
Let's say I have more than one Haskell implementation on my computer,
e.g. GHC 6.6, GHC 6.7, and Hugs. (In MacPorts, these are the ghc,
---
Haskell Weekly News
http://sequence.complete.org/hwn/20070923
Issue 65 - September 23, 2007
---
Welcome to issue 65 of HWN, a newsletter covering
Wow, what an interesting bunch of reads. I still haven't tried the options
yet as I dont work with windows too much. What was the consensus? on the
steps to follow. I will try finding a freeglut dll and then changing the
name to opengl32.dll and see if that works.
On 9/23/07, Ronald Guida
I am still in an imperative way of thinking. In this example here; how
would I call putStrLn and then set the function with a value. Eg:
aa :: String - IO ()
aa instr = do
putStrLn abc
putStrLn abc
return 123
--- The error I am getting.
Couldn't match expected type `()' against
John Wicket wrote:
I am still in an imperative way of thinking. In this example here; how
would I call putStrLn and then set the function with a value. Eg:
aa :: String - IO ()
aa instr = do
putStrLn abc
putStrLn abc
return 123
--- The error I am getting.
Couldn't match expected
Sorry, I was actually trying to use this as an example for something more
complicated I am trying to do. In this example, why would the inferred type
be IO ()
aa :: String - String
aa instr = do
putStrLn abc
putStrLn abc
return Az
Couldn't match expected type `[t]' against inferred type
61 matches
Mail list logo
