I'm a Haskell newbie but long time open source developer and I've been
following this thread with some interest.
The GPL is not just a license - it is a form of social engineering and social
contract. The idea if I use the GPL is that I am releasing free and open source
software to the communit
On Fri, Mar 5, 2010 at 8:07 AM, Johan Tibell wrote:
> On Fri, Mar 5, 2010 at 4:48 AM, iquiw wrote:
>
>> I think I would use the module system for namespacing rather than using
>> function prefixes. Like so:
>
>
> import Text.Html as E
> import qualified Text.Html.Attribute as A
>
> E.html ! [A.c
On Fri, Mar 5, 2010 at 4:48 AM, iquiw wrote:
> Hi Johan,
>
> On Fri, Mar 5, 2010 at 6:18 AM, Johan Tibell
> wrote:
> > Here's a proposal for a project I'd be willing to mentor:
> > = A high-performance HTML combinator library using Data.Text =
>
> Nice project! I would like to see the project wi
Unix domain sockets are a type of socket created between two programs
on a single Unix system. They are useful in part because over them you
can send so-called ancillary data: file descriptors and credentials
(i.e. a proof of who the process on the other end is). The thing is,
Haskell doesn't have
Simon Marlow wrote:
So it would be pretty easy to provide something like
disableMajorGC, enableMajorGC :: IO ()
Of course leaving it disabled too long could be bad, but that's your
responsibility.
It seems like it'd be preferable to have an interface like:
withMajorGCDisabled :: IO()
Hi Johan,
On Fri, Mar 5, 2010 at 6:18 AM, Johan Tibell wrote:
> Here's a proposal for a project I'd be willing to mentor:
> = A high-performance HTML combinator library using Data.Text =
Nice project! I would like to see the project will be accepted.
Perhaps it's not scope of the project, but i
Call-by value, Call by name, now Call back Later?
:)
On Mar 4, 2010, at 7:39 PM, cas...@istar.ca wrote:
CBV, CBN, CBL
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
_
I assumed that CBL meant Call By Location
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 05/03/2010, at 04:34, stefan kersten wrote:
> i've been hunting down some performance problems in DSP code using vector and
> the single most important transformation seems to be throwing in INLINE
> pragmas
> for any function that uses vector combinators and is to be called from
> higher-leve
On Thu, 2010-03-04 at 11:34 -0600, Tom Tobin wrote:
> After politely pestering them again, I finally heard back from the
> Software Freedom Law Center regarding our GPL questions (quoted
> below).
>
> I exchanged several emails to clarify the particular issues; in short,
> the answers are "No", "N
On Thu, 2010-03-04 at 07:29 -0800, Jason Dagit wrote:
>
>
> On Wed, Mar 3, 2010 at 12:26 PM, Maciej Piechotka
> wrote:
> How do you set up Windows environment? I'd like to develop few
> platform-specific code or rather port it to this platform.
>
> I tried to set
Am 04.03.10 23:19, schrieb Matthias Görgens:
A shining example are Dan Piponis blog posts. Not his fault, mind. All I see
is that there is something powerful. I also notice that the big brains
construct monads in many different ways and thus giving them entirely
different capabilities. An example
CBV, CBN, CBL
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
CBV = Call By Value, essentially strict evaluation
CBN = Call By Name
Call by Need = Call-by-need is a memoized version of call-by-name;
essentially lazy evaluation
CBL = Maybe a new acronym for Call by Need.
___
Haskell-Cafe mailing list
Haskell-
On Thu, Mar 04, 2010 at 07:07:31PM -0500, Stefan Monnier wrote:
> > The thing is that the new X' library can provide the same API while
> > not being very useful (bug, performance, whatever). And in this case,
> > it is trivial to make that new X'. So I don't understand why the
> > answer was no
> The thing is that the new X' library can provide the same API while
> not being very useful (bug, performance, whatever). And in this case,
> it is trivial to make that new X'. So I don't understand why the
> answer was no in the first place.
The law is not a set of mathematical rules. It all
2010/3/5 Michael Vanier :
> CBV = Call By Value, essentially strict evaluation
> CBN = Call By Name, essentially lazy evaluation
> CBL = I don't know.
Commercial Bill of Lading? :p
http://www.google.com.au/search?q=define%3ACBL
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.w
Matthias Görgens wrote:
A shining example are Dan Piponis blog posts. Not his fault, mind. All I see
is that there is something powerful. I also notice that the big brains
construct monads in many different ways and thus giving them entirely
different capabilities. An example of this is some tech
2010/3/4 Matthias Görgens
> > A shining example are Dan Piponis blog posts. Not his fault, mind. All I
> see
> > is that there is something powerful. I also notice that the big brains
> > construct monads in many different ways and thus giving them entirely
> > different capabilities. An example
Hello all,
I'd like to announce the first release of the Web Application Interface
package[1]. The WAI is a common protocol between web server backends and web
applications, allowing application writers to target a single interface and
have their code run on multiple server types.
There are two p
Hello Matthias,
Friday, March 5, 2010, 12:56:48 AM, you wrote:
>> [...] The SFLC holds that a
>> library that depends on a GPL'd library must in turn be GPL'd, even if
>> the library is only distributed as source and not in binary form.
> Was this a general statement
yes. it's soul of GPL idea,
> A shining example are Dan Piponis blog posts. Not his fault, mind. All I see
> is that there is something powerful. I also notice that the big brains
> construct monads in many different ways and thus giving them entirely
> different capabilities. An example of this is some techniques turn CBV to
Jesper Louis Andersen wrote:
On Thu, Mar 4, 2010 at 8:35 PM, Neil Brown wrote:
CML is indeed the library that has the most markedly different behaviour.
In Haskell, the CML package manages to produce timings like this for fairly
simple benchmarks:
%GC time 96.3% (96.0% elapsed)
I k
On Thu, Mar 04, 2010 at 11:34:24AM -0600, Tom Tobin wrote:
> [...] The SFLC holds that a
> library that depends on a GPL'd library must in turn be GPL'd, even if
> the library is only distributed as source and not in binary form.
Was this a general statement or specific to the fact that (at least
Ivan Miljenovic writes:
>> Test: Prelude.undefined
> Are you matching all patterns? When compiling with -Wall does it make
> any complaints?
How would this help? 'Prelude.undefined' happens because somewhere
you're trying to evaluate a value defined with that particular literal,
doesn't it?
On Thu, Mar 4, 2010 at 8:35 PM, Neil Brown wrote:
>
> CML is indeed the library that has the most markedly different behaviour.
> In Haskell, the CML package manages to produce timings like this for fairly
> simple benchmarks:
>
> %GC time 96.3% (96.0% elapsed)
>
> I knew from reading the
On Sun, Jan 31, 2010 at 12:04 PM, Malcolm Wallace <
malcolm.wall...@cs.york.ac.uk> wrote:
> Google has announced that the Summer of Code programme will be running
> again this year. If haskell.org people would like to take part again this
> year, then we need volunteers:
>
> First,
>* suggest
Jesper Louis Andersen wrote:
On Thu, Mar 4, 2010 at 7:16 PM, Neil Brown wrote:
However, one thing I've found is that the libraries have noticeably
different behaviour in terms of the amount of garbage created.
In fact, CML relies on the garbage collector for some implementation
const
2010/3/4 Stefan Monnier :
>> The next question that comes to mind is thus:
>> What if a new library X' released under BSD or MIT license implements
>> the X API (making possible to compile Y against it)? Can such a new
>> library X' be licensed under something else than the GPL (we guess Yes
>> bec
On Thu, Mar 4, 2010 at 7:16 PM, Neil Brown wrote:
> However, one thing I've found is that the libraries have noticeably
> different behaviour in terms of the amount of garbage created.
In fact, CML relies on the garbage collector for some implementation
constructions. John H. Reppys "Concurrent
On Thu, Mar 4, 2010 at 11:10 AM, Don Stewart wrote:
> cjs:
> > On 2010-03-01 19:37 + (Mon), Thomas Schilling wrote:
> >
> > > A possible workaround would be to sprinkle lots of 'rnf's around your
> > > code
> >
> > As I learned rather to my chagrin on a large project, you generally
> > do
cjs:
> On 2010-03-01 19:37 + (Mon), Thomas Schilling wrote:
>
> > A possible workaround would be to sprinkle lots of 'rnf's around your
> > code
>
> As I learned rather to my chagrin on a large project, you generally
> don't want to do that. I spent a couple of days writing instance
> of
> The next question that comes to mind is thus:
> What if a new library X' released under BSD or MIT license implements
> the X API (making possible to compile Y against it)? Can such a new
> library X' be licensed under something else than the GPL (we guess Yes
> because we don't think it is possi
> Note that this is a safety measure for the submitter: If the code is,
> indeed, released to the public, it is (dual licesed) GPL, anyway, even
> if that might not have been the intent.
No. If the submitter did not explicitly release his code under the GPL,
then it is not licensed under the GPL,
Am Donnerstag 04 März 2010 19:25:43 schrieb Nick Bowler:
> I agree that the conversions described by the rules are precisely what
> one really wants. However, this doesn't make them valid rules for
> realToFrac, because they do not do the same thing as realToFrac does.
> They break referential tra
Peter Verswyvelen wrote:
Using GHC 6.12.1 on Windows currently is hard, since one must compile
the latest version of cabal-install, which is a nightmare to do for a
typical windows user
Out of curiosity, why do you need to compile the latest version of
cabal-install? Why can't you use the prec
On 17:45 Thu 04 Mar , Daniel Fischer wrote:
> Am Donnerstag 04 März 2010 16:45:03 schrieb Nick Bowler:
> > On 16:20 Thu 04 Mar , Daniel Fischer wrote:
> > > Yes, without rules, realToFrac = fromRational . toRational.
> >
> >
> >
> > > I think one would have to add {-# RULES #-} pragmas to
bugfact:
> Using GHC 6.12.1 on Windows currently is hard, since one must compile
> the latest version of cabal-install, which is a nightmare to do for a
> typical windows user (install mingw, msys, utils like wget, download
> correct package from hackage, compile them in correct order, etc etc)
>
sk:
> hi,
>
> two questions in one post:
>
> i've been hunting down some performance problems in DSP code using vector and
> the single most important transformation seems to be throwing in INLINE
> pragmas
> for any function that uses vector combinators and is to be called from
> higher-level c
Hi,
I'm looking at benchmarking several different concurrency libraries
against each other. The benchmarks involve things like repeatedly
sending values between two threads. I'm likely to use Criterion for the
task.
However, one thing I've found is that the libraries have noticeably
diffe
Sweet :)
I'm glad that notFollowedBy has been fixed. I've often had to redefine it
because the type was to restrictive.
- Job
On Wed, Mar 3, 2010 at 11:45 PM, Derek Elkins wrote:
> Parsec is a monadic combinator library that is well-documented, simple
> to use, and produces good error messages.
Before taking any action with respect to cabal or hackage, etc., I'd
think people would want to see their explicit response.
On Thu, Mar 4, 2010 at 12:34 PM, Tom Tobin wrote:
> After politely pestering them again, I finally heard back from the
> Software Freedom Law Center regarding our GPL quest
Hi Tom
Hmm, its seems I'm due to eat my hat...
To me though, the judgement makes that insistence that using an API is
making a derivative work. I can't see how that squares up.
Before I eat a hat, I'll wait for the explicit response if you don't mind.
Best wishes
Stephen
__
Interesting. It seems to me that the only solution for the
BSD-oriented haskell community is to practically boycott GPL'd
libraries. From what I understand, this is exactly what the LGPL is
for. I've known the basic idea behind the GPL/LGPL distinction for
quite awhile, but I didn't realize that
2010/3/4 Tom Tobin :
> After politely pestering them again, I finally heard back from the
> Software Freedom Law Center regarding our GPL questions (quoted
> below).
>
> I exchanged several emails to clarify the particular issues; in short,
> the answers are "No", "No", "N/A", and "N/A". The SFLC
Tom Tobin wrote:
> Maybe it would be useful if Cabal had some sort of licensing check
> command that could be run on a .cabal file, and warn an author if any
> libraries it depends on (directly or indirectly) are GPL'd but the
> .cabal itself does not have the license set to GPL.
>
Or are dual-li
By coincidence, today I found a bug in the parsec 3.0.[01]. Probably due
to changes introduced the bug is absent in parsec 3.1.0.
I think it is worth to release 3.0.2 with this bug fixed.
The bug itself is demonstrated in the following code. It gives
Right (False,True) with parsec-3.0.x while sho
After politely pestering them again, I finally heard back from the
Software Freedom Law Center regarding our GPL questions (quoted
below).
I exchanged several emails to clarify the particular issues; in short,
the answers are "No", "No", "N/A", and "N/A". The SFLC holds that a
library that depend
hi,
two questions in one post:
i've been hunting down some performance problems in DSP code using vector and
the single most important transformation seems to be throwing in INLINE pragmas
for any function that uses vector combinators and is to be called from
higher-level code. failing to do so s
On Wed, Mar 03, 2010 at 10:45:12PM -0600, Derek Elkins wrote:
> The main features of this release are:
> - the performance should be much better and comparable to Parsec 2
Great! Will we finally be able to convert everyone to Parsec 3?
Cheers,
--
Felipe.
Sean Leather wrote:
> My question is simple:
>
>*How do you rewrite your code to improve it?*
The short answer is: I don't.
Long answer: In the Haskell community there is a strong bias towards
making your code as generic and abstract as possible. That's not
because it is the recommended
Am Donnerstag 04 März 2010 16:45:03 schrieb Nick Bowler:
> On 16:20 Thu 04 Mar , Daniel Fischer wrote:
> > Yes, without rules, realToFrac = fromRational . toRational.
>
>
>
> > I think one would have to add {-# RULES #-} pragmas to
> > Graphics.Rendering.OpenGL.Raw.Core31.TypesInternal, along
= [x] ++ sortList2 xs
>
>
>
> im breaking a one specific string and putting them to each word. But I need
> to put them to a tuple.
>
> Can someone help me with the code
>
>
>
> Please.
>
>
> __ Information from ESET NOD32 Antivirus, version of virus
Hi,
sortList2 :: String -> String
sortList2 (x:xs)
| x == ',' = ""
| otherwise = [x] ++ sortList2 xs
im breaking a one specific string and putting them to each word. But I need
to put them to a tuple.
Can someone help me with the code
Please.
___
Am Donnerstag 04 März 2010 16:07:51 schrieb Louis Wasserman:
> Actually, looking back, I'm not sure mapM is even the right choice.
> I think foldM would suffice. All we're doing is finding the association
> pair with the minimum key, no? In this case, foldM would do everything
> we need to...and S
On 16:20 Thu 04 Mar , Daniel Fischer wrote:
> Yes, without rules, realToFrac = fromRational . toRational.
> I think one would have to add {-# RULES #-} pragmas to
> Graphics.Rendering.OpenGL.Raw.Core31.TypesInternal, along the lines of
>
> {-# RULES
> "realToFrac/CDouble->GLdouble" realTo
On Wed, Mar 3, 2010 at 12:26 PM, Maciej Piechotka wrote:
> How do you set up Windows environment? I'd like to develop few
> platform-specific code or rather port it to this platform.
>
> I tried to set up environment but I failed (darcs hanging on copy via
> ssh, command line is... well slightly b
Am Donnerstag 04 März 2010 14:55:30 schrieb Peter Verswyvelen:
> I just converted an old HOpenGL application of mine to the new Haskell
> OpenGL using GHC 6.12.1, using realToFrac to convert Double to
> GLdouble.
>
> The performance dropped from over 800 frames per second to 10 frames
> per second.
Actually, looking back, I'm not sure mapM is even the right choice. I think
foldM would suffice. All we're doing is finding the association pair with
the minimum key, no? In this case, foldM would do everything we need
to...and State.Strict would be pretty good at that.
Louis Wasserman
wasserma
I'm pretty sure you don't need mingw and all that. I've bootstrapped
cabal-install on windows a few times now without needing anything more than
ghc (though I haven't done 6.12 yet so I might be totally off base here...)
You can't use the nice bootstrap script, but you can download and build the
d
Am Donnerstag 04 März 2010 04:20:05 schrieb Louis Wasserman:
> James,
>
> Which version of Control.Monad.State are you importing?
>
> If you're just importing vanilla Control.Monad.State, that's actually
> sending you to Control.Monad.State.Lazy.
>
> Using Control.Monad.State.Strict might solve you
I just converted an old HOpenGL application of mine to the new Haskell
OpenGL using GHC 6.12.1, using realToFrac to convert Double to
GLdouble.
The performance dropped from over 800 frames per second to 10 frames
per second... Using unsafeCoerce I got 800 FPS again.
So for all of you using new Op
On Thu, 2010-03-04 at 14:16 +0100, Jonas Almström Duregård wrote:
> If you use putty instead and type
> ssh youru...@yourrepository.com
> Does it connect properly?
>
Yes
> This is from the patch-tag website:
>
> >Problems pushing or pulling
> >darcs failed: Not a repository: myu...@patch-tag.co
Iteratee-parsec is a library which allows to have a parsec (3) parser in
IterateeG monad.
It contains 2 implementations:
- John Lato's on public domain. It is based on monoid and design with
short parsers in mind.
- Mine on MIT. It is based on single-linked mutable list. It seems to be
significant
If you use putty instead and type
ssh youru...@yourrepository.com
Does it connect properly?
This is from the patch-tag website:
>Problems pushing or pulling
>darcs failed: Not a repository: myu...@patch-tag.com:/r/myrepo
>((scp) failed to fetch: myu...@patch-tag.com:/r/myrepo/_darcs/inventory)
>D
On 04/03/2010 07:54, Jonas Almström Duregård wrote:
> I suppose you are already using the Haskell Platform?
>
> I had problems with darcs freezing, and it turned out that the ssh
> client was actually prompting for something. Is the host you are
> connected to in your list of trusted hosts? Also i
Related question probably: why ghc compiles this:
> {-# LANGUAGE RankNTypes, ImpredicativeTypes #-}
> methods :: [(String, forall b. Eq b => b)]
> methods =
> [ ("method1", undefined )
> , ("method2", undefined) ]
> test:: [String]
> test= pmap methods
>where pmap = map fst
But wh
All my code, whether neat or not so neat is still way too concrete, too
direct.
I think the correct answer is one should try to find abstractions and
not code straight down to the point. Which to me is still a really tough
one, I have to admit.
Taking this cue, since you've raised it before, a
On Thu, 2010-03-04 at 09:48 +, Simon Peyton-Jones wrote:
> See
>
> http://trac.haskell.org/haskell-platform/wiki/ReleaseTimetable
>
> The Haskell Platform for GHC 6.12 should be out on March 21st.
>
> Simon
I hope it will be with long double for C ;)
And BTW - why it is called 2009.4.x no
See
http://trac.haskell.org/haskell-platform/wiki/ReleaseTimetable
The Haskell Platform for GHC 6.12 should be out on March 21st.
Simon
| -Original Message-
| From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On
| Behalf Of Peter Verswyvelen
| Sent: 04 M
Nicolas Frisby wrote:
> Each time I find myself needing to use the wrapping functions
> necessary for this embeddings, I grumble. Does anyone have a favorite
> use-pattern for ameliorating these quickly ubiquitous conversions?
>
> For runKleisli, I was considering something like
>
> onKleisli ::
Using GHC 6.12.1 on Windows currently is hard, since one must compile
the latest version of cabal-install, which is a nightmare to do for a
typical windows user (install mingw, msys, utils like wget, download
correct package from hackage, compile them in correct order, etc etc)
What's the status o
On 2010-03-01 15:44 +0100 (Mon), Günther Schmidt wrote:
> Apart from monads there are of course also Applicative Functors,
> Monoids, Arrows and what have you. But in short the Monad thingy seems
> to be the most "powerful" one of them all.
Perhaps not exactly. I build monads left and right,
A fully concurrent GC running on multiple threads/cores might be
great, but I guess this is difficult to implement and introduces a lot
of overhead.
For simple video games, it might work to always do a full GC per
frame, but don't allow it to take more than T milliseconds. In a sense
the GC functi
On 2010-03-02 11:33 +0900 (Tue), Simon Cranshaw wrote:
> I can confirm that without tweaking the RTS settings we were seeing
> over 100ms GC pauses.
Actually, we can't quite confirm that yet. We're seeing large amounts
of time go by in our main trading loop, but I'm still building the
profiling t
On 2010-03-02 14:17 + (Tue), Simon Marlow wrote:
> System.Mem.performGC is your friend, but if you're unlucky it might do a
> major GC and then you'll get more pause than you bargained for.
Anybody calling that is a really poor unlucky sod, because, as far as I
can tell from reading the sou
76 matches
Mail list logo
