#5267: Arrow command combinators
+---
Reporter: peteg | Owner:
Type: bug| Status: new
Priority: normal
#5272: Performance regression
---+
Reporter: augustss | Owner:
Type: bug | Status: closed
Priority: normal| Milestone:
#5275: Data.Typeable not backwards compatible
-+--
Reporter: augustss |Owner:
Type: bug | Status: new
Priority: normal|Milestone:
#5269: RTS flag decoding broken
-+--
Reporter: augustss | Owner:
Type: bug | Status: new
Priority: normal| Component: Runtime
#4211: LLVM: Stack alignment on OSX
+---
Reporter: dterei |Owner: dterei
Type: task | Status: new
Priority: normal |Milestone: 7.2.1
#3910: +RTS options introduce a security problem for, e.g., setuid binaries
--+-
Reporter: andersk | Owner: simonmar
Type: bug | Status: closed
#4459: Polymorphic Data.Dynamic
-+--
Reporter: vivian|Owner: vivian
Type: feature request | Status: new
Priority: normal
#5271: Compilation speed regression
-+--
Reporter: augustss |Owner:
Type: bug | Status: infoneeded
Priority: normal
#5269: RTS flag decoding broken
-+--
Reporter: augustss| Owner:
Type: bug | Status: closed
Priority: normal | Milestone:
#5262: Compiling with -O makes some expressions too lazy and causes space leaks
-+--
Reporter: michal.palka |Owner: simonmar
Type: bug
#5276: Multithreaded build failure
--+-
Reporter: daniel.is.fischer |Owner: benl
Type: bug| Status: new
Priority: normal |Milestone:
#5250: SEGFAULT in FFI to C++ library
-+--
Reporter: acowley | Owner: simonmar
Type: bug | Status: closed
Priority: high| Milestone: 7.2.1
#5271: Compilation speed regression
-+--
Reporter: augustss |Owner:
Type: bug | Status: infoneeded
Priority: normal
#5272: Performance regression
---+
Reporter: augustss | Owner:
Type: bug | Status: closed
Priority: normal| Milestone:
#5270: Installing ghc ruins PATH on Windows
-+--
Reporter: augustss |Owner:
Type: bug | Status: infoneeded
Priority: normal|Milestone:
#5281: Bad compiler warning
-+--
Reporter: augustss | Owner:
Type: bug | Status: new
Priority: normal| Component: Compiler
#4102: Bit manipulation built-ins
-+--
Reporter: uzytkownik|Owner:
Type: feature request | Status: new
Priority: normal|Milestone: 7.4.1
#4211: LLVM: Stack alignment on OSX
+---
Reporter: dterei |Owner: dterei
Type: task | Status: new
Priority: normal |Milestone: 7.2.1
#5282: Bizarre results from -P profiler on OS X
---+
Reporter: bos | Owner:
Type: bug | Status: new
Priority: normal
#4310: Deferred equalities and forall types
-+--
Reporter: simonpj |Owner: simonpj
Type: bug | Status: new
Priority: normal|Milestone:
#4370: Bring back monad comprehensions
--+-
Reporter: simonpj | Owner: nsch
Type: feature request | Status: closed
Priority: normal | Milestone:
#5283: Arrow command combinators: addTickHsExpr explodes in GHCi
-+--
Reporter: peteg | Owner:
Type: bug | Status: new
Priority:
#4102: Bit manipulation built-ins
-+--
Reporter: uzytkownik|Owner:
Type: feature request | Status: new
Priority: normal|Milestone: 7.4.1
#4459: Polymorphic Data.Dynamic
-+--
Reporter: vivian|Owner: vivian
Type: feature request | Status: new
Priority: normal
I asked this question on StackOverflow and someone suggested using
StateT. Unfortunately I don't think I can really carry around the
state I'd like to:
http://stackoverflow.com/questions/6495320/hoopl-how-can-i-combine-the-checkingfuelmonad-with-a-state-monad
On Fri, Jun 24, 2011 at 5:56
v0.2 of the `RandProc` library has been released to HackageDB.
http://hackage.haskell.org/package/randproc
Changes in this release:
* Improved several severe performance bottlenecks. (The `goodDie`
space can now actually be checked, without exhausting
memory/time.)
*
ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation
January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12)
Call For Papers
http://www.program-transformation.org/PEPM12
The PEPM Symposium/Workshop series aims to bring together researchers and
For example, section 3.13 ends with the note:
case x of { (a,_) | let b = not a in b :: Bool - a }
... Programmers are advised, therefore, to avoid guards that
end with a type signature.
I would support changing a type signature to an expression type
signature in this note
At Mon, 27 Jun 2011 15:02:33 +0100,
Paterson, Ross wrote:
There is no a priori reason why b should depend on a in a pair of
bindings such as these:
a = const (\x - x) b
b = const (a :: Int - Int) (a :: Bool - Bool)
There is: section 3.16 says that in an expression type
That is so cool! Thank you.
To anyone who's interested: Try it. It's enlightening.
Tom
On 6/26/11, Don Stewart don...@gmail.com wrote:
Yes, via the -hpc tracing mechanism.
When executed HPC generates a highlighted log of your source, and
expressions that aren't evaluated will be marked up
Tony Morris wrote:
I recently set out to write a library that required a decent time
library. Having only had a flirt with Data.Time previously, I assumed
it would be robust like many other haskell libraries. I don't know
about consensus, but I have been massively let down. I won't go in to
On 06/26/2011 04:16 PM, michael rice wrote:
MathWorks has the function seqperiod(x) to return the period of sequence
x. Is there an equivalent function in Haskell?
Could you specify what exactly the function is supposed to do? I am
pretty sure that a function like
seqPeriod :: (Eq a) =
From: David Place d...@vidplace.com
Hi:
I've been studying iteratee IO. Is there a function in the iteratee
package that is analogous to Data.Enumerator.List.concatMap?
Iteratee's 'Data.Iteratee.Iteratee.convStream', or the more general
'Data.Iteratee.Iteratee.unfoldConvStream', would
Forwarding to -cafe
Original Message
Subject:Re: [Haskell-cafe] Period of a sequence
Date: Mon, 27 Jun 2011 04:46:10 -0700 (PDT)
From: michael rice nowg...@yahoo.com
To: Steffen Schuldenzucker sschuldenzuc...@uni-bonn.de
Hi Steffen,
Repeating decimals.
5/7
Michael,
On 06/27/2011 01:51 PM, Steffen Schuldenzucker wrote:
Forwarding to -cafe
Original Message
Subject: Re: [Haskell-cafe] Period of a sequence
Date: Mon, 27 Jun 2011 04:46:10 -0700 (PDT)
From: michael rice nowg...@yahoo.com
To: Steffen Schuldenzucker
On 2011-June-27 Monday 10:15:28 Yitzchak Gale wrote:
The biggest shortcoming, in my opinion, is that the documentation
assumes that the reader is very familiar with the Haskell type
system, and with viewing type signatures and instance lists as an
integral and central part of the
I've attached some code I wrote a while ago for playing with repeating
decimal expansions, perhaps you'll find some of it useful.
-Brent
On Mon, Jun 27, 2011 at 02:21:55PM +0200, Steffen Schuldenzucker wrote:
Michael,
On 06/27/2011 01:51 PM, Steffen Schuldenzucker wrote:
Forwarding to
On Mon, 27 Jun 2011 11:15:28 +0300
Yitzchak Gale g...@sefer.org wrote:
The biggest shortcoming, in my opinion, is that the documentation
assumes that the reader is very familiar with the Haskell type
system, and with viewing type signatures and instance lists as an
integral and central part
Thanks, all.
I have an evaluation copy of Mathematica and have been looking for problems to
feed it.
Michael
--- On Mon, 6/27/11, Brent Yorgey byor...@seas.upenn.edu wrote:
From: Brent Yorgey byor...@seas.upenn.edu
Subject: Re: [Haskell-cafe] Fwd: Re: Period of a sequence
To:
Yes, how can i miss that...
It's working now, but still it works only for the first element of the
list. It prints the result only for the first string. Now when it's
operational, i have just to modify it to be working for all of the
elements of the list.
If i run the program right now, the
so think about the high level design for a second, and let that guide the
types. then the types should guide the code.
p, which I assume is the top level evaluation, is supposed to take a list of
strings, and produce a list of integers (the result of evaluating the
expression), right? So it
Yeah, that really helped me :))
Finally i got the results i wanted :
Main p [2*34/3,2+3,2*(6/2)]
[22,5,6]
There is only one more question i have about this. I have already
written 2 error captures, but they don't really apply to the task i
have. Here are my error captures:
sent from wrong account - message follows:
I've found most of the time library to be quite useful, but the parsing to be
worthless (I've tried to get someone to prove me wrong already, and would be
happy if someone could on this thread!).
Specifically, the formatTime function, if it ever
Well, if you are at all familiar with (or wanted to learn about) the Maybe
type, I would suggest you use that. A brief synopsis:
data Maybe a = Nothing | Just a
Which means that a Maybe Int is either Nothing or or Just an int.
If you were to got this path, then your p function should have
I'm running OS X 10.6.7, XCode 3.2.5. When I try to install The Haskell
Platform 2011.2.0.1 for Mac OS X 10.6 (Snow Leopard) it goes all the way
through to running package scripts, then says installation failed
I did two separate downloads, and tried the first installation two time,
the second
Tom Murphy amin...@gmail.com wrote:
The title is self-explanatory. I'd like to store information from
an algebraic data type in an SQL database, but the type signature of
toSql (toSql
:: Data.Convertible.Base.Convertible a SqlValue = a - SqlValue)
doesn't make sense to me.
How
I asked this question on StackOverflow and someone suggested using
StateT. Unfortunately I don't think I can really carry around the
state I'd like to:
http://stackoverflow.com/questions/6495320/hoopl-how-can-i-combine-the-checkingfuelmonad-with-a-state-monad
On Fri, Jun 24, 2011 at 5:56
On 2011-06-27 13:51, Steffen Schuldenzucker wrote:
Could you specify what exactly the function is supposed to do? I am
pretty sure that a function like
seqPeriod :: (Eq a) = [a] - Maybe Integer -- Nothing iff non-periodic
cannot be written.
What about sequences that can be specified in terms
On 27/06/2011, at 8:32 PM, Steffen Schuldenzucker wrote:
On 06/26/2011 04:16 PM, michael rice wrote:
MathWorks has the function seqperiod(x) to return the period of sequence
x. Is there an equivalent function in Haskell?
Could you specify what exactly the function is supposed to do?
Hey Café.
I've been playing with Enumerators, Iteratees and Enumeratees today after
having spent a few days writing a server application using lazy IO, then
reading slides from Oleg's DEFUN8 talk notes, and I quote: Lazy IO in
serious, server-side programming is unprofessional, I can talk a lot
On Mon, Jun 27, 2011 at 4:25 PM, Twan van Laarhoven twa...@gmail.comwrote:
On 2011-06-27 13:51, Steffen Schuldenzucker wrote:
Could you specify what exactly the function is supposed to do? I am
pretty sure that a function like
seqPeriod :: (Eq a) = [a] - Maybe Integer -- Nothing iff
On Thu, Jun 23, 2011 at 05:15:43PM +0300, Vesa Kaihlavirta wrote:
Hello to all Haskellites,
There's finally an upgraded haskell-platform and corresponding
packages in extra/ -- reason for the delay was partly lack of
brainpower (I had some time, but didn't have the energy to work with
On Mon, Jun 27, 2011 at 12:51:18AM +0200, Peter Simons wrote:
Hi Magnus,
Isn't this still the same workflow you had when you wrote [1]?
no, it's not.
Since I'm curious, what improvements have you made to the tools that
address the inadequacy you reported back then?
Have they just been
Ok, so once again I have tried to compile/install leksah (
http://hackage.haskell.org/package/leksah) with Haskell when using
cabal2arch, and just after the package is 'built' (but not yet finalized) I
get this error message
Configuring leksah-0.10.0.4...
Preprocessing library leksah-0.10.0.4...
54 matches
Mail list logo
