Brian Hulley writes:
> The main problem for me is just the fact that the legal system in
> itself is, as Charles Dickens wrote in "The Old Curiosity Shop"
> (Chapter 37):
>
> ... an edged tool of uncertain
> application, very expensive in the working,
> and rather remarkable for its pr
On Sat, 17 Apr 2010, Brian Hulley wrote:
see the patent 6,368,227. The search site is here:
http://patft.uspto.gov/netahtml/PTO/srchnum.htm
Best regards.
Jerzy Karczmarczuk
...
It's really almost not fair to cite that particular patent, since, if I
recall the story correctly (I may be wrong
Thanks! That's great news. Yes, all seems fine now. :-)
It was a very interesting bug to isolate. At one point I was in the
situation where compiling with -O2 fixed the problem and -O0 didn't,
seemingly consistently.
By the way, I got two warnings while compiling:
* Warning: Fields of `Types.
On Sat, Apr 17, 2010 at 12:00 AM, Jason Dagit wrote:
>
> Myself and others posted "simpler" programs that had similar bad behavior,
> including the space leak (depending on optimizations flags). I realize it's
> tedious to retest all those versions, but do you think you could check with
> one of
On 17/04/2010, at 11:00, Conal Elliott wrote:
> I'm unsure now, but I think I tried making Basis a data type (not syn) and
> ran into the problem I mentioned above. The Basis *synonyms* also have
> HasTrie instances, which is crucially important. If we switch to (injective)
> data types, then
Hello Jason,
Saturday, April 17, 2010, 2:00:04 AM, you wrote:
> Well, I think Bulat correctly characterized the non-termination
> aspect. I didn't think the cooperative aspect of threading applied
> with the threaded RTS, so I'm not 100% sure I believe his
> characterization, but otherwise it s
On Sat, Apr 17, 2010 at 8:22 AM, Jason Dagit wrote:
> ...
> One place where lazy accumulators is bad are the left folds. There is the
> lazy foldl and the version which is strict in the accumulator, foldl'. Try
> summing big lists of integers, let's use ghci and limit the heap to 1 meg:
> ghci
I have not been following the details of this, I'm afraid, but I notice this:
> forever' m = do _ <- m
> forever' m
When I define that version of forever, the space leak goes away.
What was the old version of forever that led to the leak?
If you can boil down the leak to a simpl
On Mon, Apr 12, 2010 at 10:27 PM, Mark Snyder wrote:
> So in this line of thought, where we have the operations and the control
> operators, I guess my original question wasn't aware of the distinction, and
> was looking for a name for all of them combined. In Haskell (specifically
> in the mtl),
* On Wednesday, April 14 2010, Jesper Louis Andersen wrote:
>> newtype Process a b c = Process (ReaderT a (StateT b IO) c)
>> deriving (Functor, Monad, MonadIO, MonadState b, MonadReader a)
>
>Note that the automatic derivations of *MonadState b* and *MonadReader a* makes
>GHC spit our some mkUs
Am Samstag 17 April 2010 14:41:28 schrieb Simon Peyton-Jones:
> I have not been following the details of this, I'm afraid, but I notice
this:
> > forever' m = do _ <- m
> > forever' m
>
> When I define that version of forever, the space leak goes away.
>
> What was the old version
The attached patch for the process package adds support for creating and
interrupting process groups on Unix and Win32 systems. Currently we have to
use a nasty hack in Leksah that only works on Unix systems (and even then not
very well). On Win32 Leksah's background build feature is dreadful
Hello,
I'm trying to make two simple classe which would help me to transform
unserializable datatypes to serializable ones.
The classes are:
class (Binary b) => Binarizable a b | a -> b where
toBinary :: a -> b
class (Binarizable a b, Monad m) => Unbinarizable a b m | a -> b where
fromBinary
On Apr 15, 2010, at 08:49 , Ivan Lazar Miljenovic wrote:
Why are people suddenly using the term "morally" when they mean "why
doesn't this do what I think it should"? None of its definitions seem
to match what you mean:
That depends on how cynical you are about religion. :)
--
brandon s. al
Oh! I'd completely forgotten about this idea. Looking at Data.LinearMap in
vector-space, I see a comment about exactly this ambiguity, as well as the
start of a new module that wraps a data type around the linear map
representation. I don't recall whether I got stuck or just distracted.
On Sat,
Hi all, I was wondering if someone knows how to do the following:
Im looking to typecheck a string using the GHC Api, where I run into
problems is that I need to construct a Target, but the TargetId only seem to
reference physical files.
Ofcourse I can write the string to a file and typech
Am Samstag 17 April 2010 19:14:02 schrieb Limestraël:
> Hello,
>
> Well, here comes the trouble:
> GameStructs.hs:16:9:
> Functional dependencies conflict between instance declarations:
> instance (Binary a) => Binarizable a a
> -- Defined at MagBots/GameStructs.hs:16:9-37
>
Jesper Louis Andersen wrote:
> * Change all use of CML to STM:
> Overall, it looks like this change improved the code. There are still some
> need for cleanup after the bomb was thrown, but it does look like it will
> turn out positively. If CML put you off the track for hacking on
>
Hi, all,
I've beeing working with some people who do programming for
wireless devices. 100% of their code uses C, and I would like to
show them nice things they could do with funcional programming
(not necessarily Haskell. I believe, say, Standard ML could be
also very nice.)
I'm new to this, so
Yes! Sorry, I forgot a bit:
Binary types are automatically made instances of Binarizable/Unbinarizable
(that's my line 16):
instance (Binary a) => Binarizable a a where
toBinary = id
instance (Binary a, Monad m) => Unbinarizable a a m where
fromBinary = return
To me, the functional dependen
Daniel Fischer wrote:
> Am Samstag 17 April 2010 14:41:28 schrieb Simon Peyton-Jones:
> > I have not been following the details of this, I'm afraid, but I notice
> this:
> > > forever' m = do _ <- m
> > > forever' m
> >
> > When I define that version of forever, the space leak goes
Ivan Lazar Miljenovic wrote:
Brian Hulley writes:
The main problem for me is just the fact that the legal system in
itself is, as Charles Dickens wrote in "The Old Curiosity Shop"
(Chapter 37):
... an edged tool of uncertain
application, very expensive in the working,
and rather re
Hello Bertram,
Sunday, April 18, 2010, 12:11:05 AM, you wrote:
> always a = -- let act = a >> act in act
> do
> _ <- a
> always a
>
> hinting at the real problem: 'always' actually creates a long chain of
> actions instead of tying the knot.
can you explain it d
Am Samstag 17 April 2010 22:01:23 schrieb Limestraël:
> Yes! Sorry, I forgot a bit:
> Binary types are automatically made instances of
> Binarizable/Unbinarizable (that's my line 16):
>
> instance (Binary a) => Binarizable a a where
> toBinary = id
>
> instance (Binary a, Monad m) => Unbinarizabl
On Sat, Apr 17, 2010 at 4:01 PM, Limestraël wrote:
> I would have undestood the error if GameObject was also an instance of
> Binary (then the two instances would match), but it's not the case...
As Daniel Fischer has mentioned, presumably a Binary instance could
later be written for GameObject;
Hello Maurício
> I'm new to this, so the only problems I see are finding a compiler
> that targets the platform (ARM7, for instance, or others) and
> uploading the compiled firmware to the device.
You might find that the extra RAM requirements for a non-C language
becomes a problem - especially
Hi all,
I was finally able to solve this by deleting the user package.conf.d
completely. I think there was some problem with the package.cache file, It must
have gotten corrupted somehow.
Cheers,
Phyx
-Original Message-
From: Ivan Lazar Miljenovic [mailto:ivan.miljeno...@gmail.com]
Se
On Fri, 16 Apr 2010, jerzy.karczmarc...@info.unicaen.fr wrote:
Somebody finally decided to ridiculise the system. If you want a good laugh,
see the patent 6,368,227. The search site is here:
As I recall some (patent?) laywer was simply teaching his kid how the
patent process worked, so the wo
Ok, so I am heading to a headache...
Daniel Fischer mentioned a solution using Type Families. As I read, those
are meant to replace the FunDeps, I will try this solution...
2010/4/17 Casey McCann
> On Sat, Apr 17, 2010 at 4:01 PM, Limestraël wrote:
> > I would have undestood the error if GameO
Hello all,
I can't seem to find it documented anywhere as to the default directories
that cabal puts its information in (its certainly not in ~/.cabal ), as
I'm finding that even when I try to do a "reinstall" of the haskell
platform, cabal thinks that all the libraries i removed are still there.
On Sat, Apr 17, 2010 at 9:05 PM, Stephan Maka wrote:
>
>> * Introduce RTS benchmarks:
>> See http://jlouis.github.com/combinatorrent where we plot SVG-based
>> sparklines for various key RTS parameters over time (works best in Opera
>> or
>> Chrome). A slow-changing regression has a m
Ryan Ingram schrieb:
It's used in the implementation of "fail" for those monads.
class Monad m where
...
fail :: String -> m a
fail = error -- default implementation
which is then used to desugar do-notation when pattern matching fails:
do
Left x <- something
retu
On Sat, Apr 17, 2010 at 5:30 PM, Carter Schonwald
wrote:
> Hello all,
> I can't seem to find it documented anywhere as to the default directories
> that cabal puts its information in (its certainly not in ~/.cabal ), as
> I'm finding that even when I try to do a "reinstall" of the haskell
> plat
Hi Everyone,
I am trying to get cabal-install to work on a system in which /tmp is
mounted noexec. Is there any way to configure it to use another directory?
I would be happy to patch the source and rebuild if need be.
Thanks in advance,
Chris
___
Bas van Dijk schrieb:
I don't know why the heap and stack overflow problems go away. So lets
look at the core output of the latter program:
$ ghc-core -- -O2 FoldlProfile.hs
$wsum :: [Int] -> Int#
$wsum = \ (w_s1rS :: [Int]) -> $wfoldl_f 0 w_s1rS
$wfoldl_f :: Int# -> [Int] -> Int#
$wfoldl_f =
On Fri, Apr 16, 2010 at 11:19 PM, Roman Leshchinskiy
wrote:
> That said, it would be quite possible to provide something like the following:
>
> fold_inplace :: Vector v a => (v a -> b -> v a) -> v a -> [b] -> v a
as far as i understand there would be two ways of writing such a
function : 1) to
Am Sonntag 18 April 2010 00:02:52 schrieb Chris Dornan:
> Hi Everyone,
>
>
>
> I am trying to get cabal-install to work on a system in which /tmp is
> mounted noexec. Is there any way to configure it to use another
> directory?
>
cabal-install gets its temporary directory via
System.Directory.get
Murray Gross wrote:
On Sat, 17 Apr 2010, Brian Hulley wrote:
see the patent 6,368,227. The search site is here:
http://patft.uspto.gov/netahtml/PTO/srchnum.htm
Best regards.
Jerzy Karczmarczuk
...
It's really almost not fair to cite that particular patent, since, if I
recall the story correct
rocon...@theorem.ca wrote:
As ski noted on #haskell we probably want to extend this to work on
Compact types and not just Finite types
instance (Compact a, Eq b) => Eq (a -> b) where ...
For example (Int -> Bool) is a perfectly fine Compact set that isn't
finite and (Int -> Bool) -> Int has a
Ketil Malde wrote:
Do we also want to modify equality for lazy bytestrings, where equality
is currently independent of chunk segmentation? (I.e.
toChunks s1 == toChunks s2 ==> s1 == s2
but not vice versa.)
Why is toChunks exposed?
--
Ashley Yakeley
_
I wrote:
class Compact a where
After reading Luke Palmer's message I'm thinking this might not be the
best name.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Daniel Fischer writes:
> cabal-install gets its temporary directory via
> System.Directory.getTemporaryDirectory, so you can specify some other
> directory via the TMPDIR environment variable (TMP on windows).
Except I think Chris wants to be able to specify a directory, since
other application
Carter Schonwald writes:
> I can't seem to find it documented anywhere as to the default directories
> that cabal puts its information in (its certainly not in ~/.cabal ), as
> I'm finding that even when I try to do a "reinstall" of the haskell
> platform, cabal thinks that all the libraries i r
On Sunday 18. April 2010 00.49.28 Ivan Lazar Miljenovic wrote:
> Except I think Chris wants to be able to specify a directory, since
> other applications would probably want to keep using /tmp for TMPDIR.
alias cabal="TMPDIR=/foo cabal"
--
Erlend Hamberg
“Everything will be ok in the end. If it'
Am Samstag 17 April 2010 22:11:05 schrieb Bertram Felgenhauer:
> Daniel Fischer wrote:
> > Am Samstag 17 April 2010 14:41:28 schrieb Simon Peyton-Jones:
> > > I have not been following the details of this, I'm afraid, but I
> > > notice
> >
> > this:
> > > > forever' m = do _ <- m
> > > >
Thanks Daniel and Erlend,
I now have cabal-install working.
Chris
-Original Message-
From: daniel.is.fisc...@web.de [mailto:daniel.is.fisc...@web.de]
Sent: 17 April 2010 5:4 PM
To: haskell-cafe@haskell.org
Cc: Chris Dornan
Subject: Re: [Haskell-cafe] redirecting cabal-install from /tmp
On Sat, Apr 17, 2010 at 9:50 PM, Daniel Fischer
wrote:
>
> {-# LANGUAGE OverlappingInstances, [...]
>
but with caution:
using OverlappingInstances is the haskell equivalent of
buying a new car with high safety rating and replacing the air bags
with poison gas, pouring lubricating oil all over t
Erlend Hamberg writes:
> On Sunday 18. April 2010 00.49.28 Ivan Lazar Miljenovic wrote:
>> Except I think Chris wants to be able to specify a directory, since
>> other applications would probably want to keep using /tmp for TMPDIR.
>
> alias cabal="TMPDIR=/foo cabal"
Ooohhh, forgot you can do th
Bulat Ziganshin wrote:
> Hello Bertram,
>
> Sunday, April 18, 2010, 12:11:05 AM, you wrote:
>
> > always a = -- let act = a >> act in act
> > do
> > _ <- a
> > always a
> >
>
> > hinting at the real problem: 'always' actually creates a long chain of
> > actions i
I'm pleased to announce Agata (Agata Generates Algebraic Types Automatically)!
Avoiding excessive details, usage is best described by a small example:
{-#LANGUAGE TemplateHaskell #-}
import Test.QuickCheck
import Test.AgataTH
data X a b = X [Either a b] deriving Show
data Y = Y deriving Show
dat
Am Sonntag 18 April 2010 01:23:07 schrieb Ben Millwood:
> On Sat, Apr 17, 2010 at 9:50 PM, Daniel Fischer
>
> wrote:
> > {-# LANGUAGE OverlappingInstances, [...]
>
> but with caution:
>
> using OverlappingInstances is the haskell equivalent of
> buying a new car with high safety rating and replac
leather:
>
> 2. What is the difference between "Haskell" and the "Haskell Platform"? I see
> one or the other in various places. To get from www.haskell.org to downloading
> the Mac software, I go through "Download Haskell," "Get the Haskell Platform >
> Mac," and "Download Haskell for Mac OS X (i
rl:
> On 14/04/2010, at 09:05, Xiao-Yong Jin wrote:
>
> > I want to use 'mapM' on Data.Vector.Vector, but it looks
> > like the only 'mapM' defined is in
> > Data.Vector.Fusion.Stream.Monadic. I'm able to use 'stream'
> > and 'liftStream' to convert a 'Vector' to a monadic stream,
> > on which I
Daniel Fischer wrote:
> Except that with optimisations turned on, GHC ties the knot for you (at
> least if always isn't exported).
> Without -fno-state-hack, the knot is tied so tightly that
> always (return ()) is never descheduled (and there's no leak).
Yes, I was concentrating on -O2, without
Am Sonntag 18 April 2010 02:05:30 schrieb Bertram Felgenhauer:
> Which is
>
> always = \a_aeO -> let k_sYz = always a_aeO
> in a_aeO >> k_sYz
>
> specialised to IO, and with (>>) inlined.
>
> Where is the knot?
Nowhere. Got confused by all the a_aAe and `cast` (GHC.Typ
Hi Everyone,
Just to report that I now have Haskell Platform built for CentOS 5.2 with a
/tmp mounted noexec.
Looking back, the first main hurdle was getting GHC built for CentOS 5.2
(which uses Linux 2.6.9/glibc 2.5), but the procedure was pretty straight
forward:
. Keep tryin
chris:
>
> With that in place, AFAIK, the Haskell Platform built from source with the
> various configure scripts giving me enough hints to ‘yum install’ all the
> required CentOS packages.
>
Great work!
Is there a website documenting this effort? Or better yet: a binary package I
can add to th
On Sun, Apr 18, 2010 at 12:45 AM, Daniel Fischer
wrote:
> Am Sonntag 18 April 2010 01:23:07 schrieb Ben Millwood:
>> On Sat, Apr 17, 2010 at 9:50 PM, Daniel Fischer
>>
>> wrote:
>> > {-# LANGUAGE OverlappingInstances, [...]
>>
>> but with caution:
>>
>> using OverlappingInstances is the haskell
the deleting .ghc/ solves that problem, but another problem i've had is that
when trying to build gtk2hs, I'm unable to find the package.conf file that
apparently needs to be modfied, and only a package.conf.d folder are
these somehow the same thing or where is it hidden/what am i overlooking
Maurício CA writes:
> I've beeing working with some people who do programming for
> wireless devices. 100% of their code uses C, and I would like to
> show them nice things they could do with funcional programming
> (not necessarily Haskell. I believe, say, Standard ML could be
> also very nice.
On Sat, Apr 17, 2010 at 08:21:06PM -0700, Jeffrey Scofield wrote:
> As a side comment, I haven't noticed any reaction in the
> Haskell/iPhone community about Apple's recent policy change.
I've seen some reaction in other language communities, and I'm sure you
can imagine what it's like. Understand
Darrin Chandler wrote:
On Sat, Apr 17, 2010 at 08:21:06PM -0700, Jeffrey Scofield wrote:
As a side comment, I haven't noticed any reaction in the
Haskell/iPhone community about Apple's recent policy change.
I've seen some reaction in other language communities, and I'm sure you
can imagine wha
"Chris Dornan" writes:
> . Keep trying generic binary Linux ghc packages until one that works
> is found (in this case ghc-6.8.3);
>
> . With ghc-6.8.3 installed, download the src tar ball for the next
> ghc release (6.10.1) and build and install that;
>
I wonder, could you have g
Daniel Fischer writes:
> Wow. Makes me wonder what quicksilver says about IncoherentInstances.
Not quicksilver, but according to lambdabot:
@quote incoherent
sproingie says: * enables IncoherentInstances and ends up
with Sarah Palin in his living room
--
Ivan Lazar Miljenovic
iva
Jeffrey Scofield writes:
> As a side comment, I haven't noticed any reaction in the
> Haskell/iPhone community about Apple's recent policy change.
>From the Haskell reddit:
http://www.reddit.com/r/haskell/comments/bouxy/more_on_the_iphone_applications_must_be/
http://www.reddit.com/r/haskell/com
Carter Schonwald writes:
> the deleting .ghc/ solves that problem, but another problem i've had is that
> when trying to build gtk2hs, I'm unable to find the package.conf file that
> apparently needs to be modfied, and only a package.conf.d folder are
> these somehow the same thing or where
I don't know whether I could have gotten away with it but was happy to go
through all the intermediate stages: it seemed the safer bet.
The building of a complete GHC bundle from source is such a major
undertaking that I really didn't want to build it with an old compiler and
lose all of the testi
Wow, very cool! This is so helpful I'm surprised it isn't part of
QuickCheck. Why isn't it?
Regards,
Duane Johnson
On Apr 17, 2010, at 6:43 PM, Jonas Almström Duregård wrote:
{-#LANGUAGE TemplateHaskell #-}
import Test.QuickCheck
import Test.AgataTH
data X a b = X [Either a b] deriving Sh
Our best bet is to compile to ARM native code and then use the NDK to
talk to the Java APIs.
Cheers.
~Liam
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
69 matches
Mail list logo
