Dnia środa, 12 grudnia 2012, wren ng thornton napisał:
Other than that, it's hard to say. What part of the compiler are you
(most) interested in hacking on? The type system? The compilation down
to C-- and LLVM? The concurrency and parallelism? Debugging, testing,
and fuzzing? ...
At the
2012/12/12 David Thomas davidleotho...@gmail.com
IANAL, but reviewing what others have written, it sounds like it may be
possible to maintain *some* distinction between LGPL and GPL in Haskell,
but it's a different distinction than with an LGPL shared library, so even
if applicable it's
Emil Hedevang emilhedevang at gmail.com writes:
Hi Haskell Cafe,
I need to perform very large numerical computations requiring tens of GB of
memory. The computations consist essentially of generation of random numbers
and discrete convolutions of large arrays of random numbers with
Hi Johan,
The error message is not ideal, but it does say that adding a Generic (Foo
a)
instance might solve the problem.
I generally do not export classes like GHashable because they are closed;
users
should never need to provide more instances themselves. Also, exporting the
class
won't make
I asked that on SO: http://programmers.stackexchange.com/q/179084/61231
So far the best answer is wxWidget's license (LGPL + linking exception)
which at least has been approved by OSI (although FSF approval would have
been better).
Best regards,
Petr
2012/12/12 Ivan Lazar Miljenovic
Hi A.M. and Dominic,
I have been following the development of Repa for some time, mostly reading
blogs and papers about it, not actually writing any code. It's some quite
cool stuff the developers are doing.
A discrete convolution is a stencil computation. There are (to my
knowledge) essentially
Hello,
This is just for your information.
Haskell Advent Calendar is going on in Japanese Haskell Community:
http://partake.in/events/45a01d39-af5e-42f1-91c7-e8fcc91db244
One article is evaluated lazily but other articles are in time. :-)
--Kazu
Hello,
I'm a beginner in Haskell, so forgive me if this is a basic question, but
I'd like to know if it's possible to have a predicate as part of a data
type, so that when the data type is created, it can only be done if it
satisfies the predicate else a type error is thrown.
For instance, a
On 12 December 2012 21:57, Navid Hallajian navi...@gmail.com wrote:
Hello,
I'm a beginner in Haskell, so forgive me if this is a basic question, but
I'd like to know if it's possible to have a predicate as part of a data
type, so that when the data type is created, it can only be done if it
Hi,
Am Mittwoch, den 12.12.2012, 02:50 +0100 schrieb Jonathan Fischer
Friberg:
On Wed, Dec 12, 2012 at 2:26 AM, Ramana Kumar
ramana.ku...@cl.cam.ac.uk wrote:
Using the GPL (or a strong copyleft free license) strengthens
the free software community of which I thought the
Navid Hallajian navi...@gmail.com wrote:
I'm a beginner in Haskell, so forgive me if this is a basic question,
but I'd like to know if it's possible to have a predicate as part of a
data type, so that when the data type is created, it can only be done
if it satisfies the predicate else a type
On Wed, 12 Dec 2012 10:06:23 +0100 Petr P petr@gmail.com wrote:
2012/12/12 David Thomas davidleotho...@gmail.com
Yet another solution would be
what David Thomas suggest: To provide the source code to your users,
but don't allow them to use the code for anything but relinking the
program
Hey! Thanks a lot for your reply!
Disclaimer: I am compiling GHC 7.6.1-rc1 while testing this, so my
measurements might be unreliable. Best try it out yourself.
Also, this blind-stab-optimization is /not/ best practice, I just
enjoyed fiddling around.
What /is/ best practice in regards to
Hi Cafe,
I am faced with unpleasant problem. The lawyer of my company checked
sources of containers package and found out that it refers to some
GPL-library.
Here is quote:
The algorithm is derived from Jorg Arndt's FXT library
in file Data/IntMap/Base.hs
The problem is that FXT library is GPL
Strictly speaking this is correct, and probably there's no one who would
miss the gotcha on the list, but for the sake of completeness:
You can release the source only to people who you have provided the
program, but *they* have the ability to redistribute it under the terms of
the GPL. As
2012/12/12 Dmitry Kulagin dmitry.kula...@gmail.com:
Hi Cafe,
I am faced with unpleasant problem. The lawyer of my company checked sources
of containers package and found out that it refers to some GPL-library.
Here is quote:
The algorithm is derived from Jorg Arndt's FXT library
in file
Right. If either of the following hold, you should be able to carry on as
you were (but double check with your lawyer):
1) The algorithm is borrowed but the code was not copied. In this case,
copyright doesn't cover it, and the GPL is inapplicable. (Patents could
conceivably be an issue, but no
Since we've already heard from the aggressive (L)GPL side of this debate,
I think it's time for someone to provide the opposite opinion.
I write code to help users. However, as a library designer, my users are
programmers just like me. Writing my Haskell libraries with restrictions
like the
+1
Very similar to my point (see original thread), but put in a better way. :)
As an interesting coincidence, this exact thing happened to someone
just now. (thread containers license issue)
Jonathan
On Wed, Dec 12, 2012 at 5:00 PM, Clark Gaebel cgae...@uwaterloo.ca wrote:
Since we've already
I think this is a potential problem, but, obviously, IANAL. [1]
According to the GPL:
To “propagate” a work means to do anything with it that, without
permission, would make you directly or secondarily liable for infringement
under applicable copyright law, except executing it on a computer or
I'm not sure what your point is.
Re-implementing an algorithm is not a copyright infringement (nor is a
propagation of the original work). Algorithms are not covered by
copyright.
2012/12/12 Clark Gaebel cgae...@uwaterloo.ca:
I think this is a potential problem, but, obviously, IANAL. [1]
It's not an algorithm. The source code of containers is derived from the
source code of another library.
- Clark
On Wed, Dec 12, 2012 at 11:27 AM, Vo Minh Thu not...@gmail.com wrote:
I'm not sure what your point is.
Re-implementing an algorithm is not a copyright infringement (nor is a
The problem is that FXT library is GPL and thus containers package can not
be considered as BSD3. And it means that it can not be used in my case
(closed source software).
Is this logic actually correct and containers should be considered as GPL?
The package is widely used by other packages
2012/12/12 Niklas Larsson metanik...@gmail.com:
The problem is that FXT library is GPL and thus containers package can not
be considered as BSD3. And it means that it can not be used in my case
(closed source software).
Is this logic actually correct and containers should be considered as
Ah, that's more than we'd been told. If that is the case, then containers
is in violation of the GPL (unless they got permission to copy that code,
separately), and either must obtain such permission, be relicensed,
remove/replace that code.
On Wed, Dec 12, 2012 at 8:29 AM, Clark Gaebel
2012/12/12 David Thomas davidleotho...@gmail.com:
Ah, that's more than we'd been told. If that is the case, then containers
is in violation of the GPL (unless they got permission to copy that code,
separately), and either must obtain such permission, be relicensed,
remove/replace that code.
This may be overconfident - how does copyright law deal with translations
in literature? Still, it certainly makes infringement less likely, and the
earlier explicit statement that code was copied likely the result of
confusion.
On Dec 12, 2012 8:33 AM, Niklas Larsson metanik...@gmail.com wrote:
Just for reference:
In Data/IntMap/Base.hs
highestBitMask :: Nat - Nat
highestBitMask x0
= case (x0 .|. shiftRL x0 1) of
x1 - case (x1 .|. shiftRL x1 2) of
x2 - case (x2 .|. shiftRL x2 4) of
x3 - case (x3 .|. shiftRL x3 8) of
x4 - case (x4 .|. shiftRL x4 16) of
#if
Hi,
i got the following error using yesod devel it happened after adding the
file which seems to have invalid content (not true). What should i do?
Andras Gyomrey
Yesod devel server. Press ENTER to quit
yesod: ./Handler/Model/Season.hs: hGetContents: invalid argument (invalid byte
sequence)
***
In the recent months there was a lot of dicussion about cabal, dependency hell
and alike. After
reading some of these discussions there is a question I just have to ask:
Why not create a package manager (like rpm or apt) for Haskell software?
I've been using Linux for years. Software for Linux
On Wed, 12 Dec 2012, Janek S. wrote:
In the recent months there was a lot of dicussion about cabal, dependency
hell and alike. After reading some of these discussions there is a question
I just have to ask:
Why not create a package manager (like rpm or apt) for Haskell software?
I've been
On 12/12/2012 06:01 PM, Janek S. wrote:
In the recent months there was a lot of dicussion about cabal, dependency
hell and alike. After
reading some of these discussions there is a question I just have to ask:
Why not create a package manager (like rpm or apt) for Haskell software?
I've
Niklas Larsson metanik...@gmail.com wrote:
2012/12/12 Niklas Larsson metanik...@gmail.com:
There is no copied code from FXT (which can be said with certainty as
FXT is a C library), hence the there can be copyright issue.
Gah, I should proofread! NO copyright issue, of course.
Um, no.
On Tue, Dec 11, 2012 at 9:31 PM, dag.odenh...@gmail.com
dag.odenh...@gmail.com wrote:
The practice seems to be to not export it, but maybe it would be a better
practice to export it. That way it can work without DefaultSignatures too,
and if you use the generic-deriving package it could work
Hi. I'm new here, so this may not be a good suggestion.
Janek, did you mean something like Rubygems (http://rubygems.org)? It
manages the download, installation and manipulation of Ruby packages,
called gems. A gem can contain executable programs or libraries (just
like traditional packages, like
Janek S. fremenz...@poczta.onet.pl wrote:
In the recent months there was a lot of dicussion about cabal,
dependency hell and alike. After reading some of these discussions
there is a question I just have to ask:
Why not create a package manager (like rpm or apt) for Haskell
software?
There
When deciding what license to use, I think one should also think about
the role of their library. For example, containers is quite central
to the Haskell community and not easily replaceable. The tie-knot
library, OTOH, may be rewritten from scratch or even just skipped
(just tie the knot
On Wed, Dec 12, 2012 at 11:25 PM, Ertugrul Söylemez e...@ertes.de wrote:
Janek S. fremenz...@poczta.onet.pl wrote:
In the recent months there was a lot of dicussion about cabal,
dependency hell and alike. After reading some of these discussions
there is a question I just have to ask:
I just did a quick derivation from
http://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2 to get
the highest bit mask, and did not reference FXT nor the containers
implementation. Here is my code:
highestBitMask :: Word64 - Word64
highestBitMask x1 = let x2 = x1 .|. x1 `shiftR` 1
Rustom Mody rustompm...@gmail.com wrote:
On Wed, Dec 12, 2012 at 11:25 PM, Ertugrul Söylemez e...@ertes.de
wrote:
Janek S. fremenz...@poczta.onet.pl wrote:
In the recent months there was a lot of dicussion about cabal,
dependency hell and alike. After reading some of these
On Wed, Dec 12, 2012 at 10:40 AM, Clark Gaebel cgae...@uwaterloo.ca wrote:
I just did a quick derivation from
http://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2 to get
the highest bit mask, and did not reference FXT nor the containers
implementation. Here is my code:
Emil, there is an actively maintained set of FFTW bindings on hackage,
would that help you?
cheers
-Carter
On Wed, Dec 12, 2012 at 5:03 AM, Emil Hedevang emilhedev...@gmail.comwrote:
Hi A.M. and Dominic,
I have been following the development of Repa for some time, mostly
reading blogs and
On Wed, Dec 12, 2012 at 12:51 PM, Andre Cunha andrecunha@gmail.comwrote:
Janek, did you mean something like Rubygems (http://rubygems.org)? It
manages the download, installation and manipulation of Ruby packages,
called gems. A gem can contain executable programs or libraries (just
like
Hey All,
I noticed that the really cool HaNS work
(a mostly pure HS + bits of C networking stack)
seems to have languished for quite some time, and the absence of a publicly
visible repo certainly doesnt help!
accordingly, i've taken the most recent code snapshot from the galois
archive repo and
2012/12/12 Johan Tibell johan.tib...@gmail.com:
On Wed, Dec 12, 2012 at 10:40 AM, Clark Gaebel cgae...@uwaterloo.ca wrote:
I just did a quick derivation from
http://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2 to get
the highest bit mask, and did not reference FXT nor the
Possibly. I tend to trust GHC's strictness analyzer until proven otherwise,
though. Feel free to optimize as necessary.
- Clark
On Wed, Dec 12, 2012 at 3:06 PM, Vo Minh Thu not...@gmail.com wrote:
2012/12/12 Johan Tibell johan.tib...@gmail.com:
On Wed, Dec 12, 2012 at 10:40 AM, Clark
Clark, Johan, thank you! That looks like perfect solution to the problem.
12.12.2012, в 22:56, Johan Tibell johan.tib...@gmail.com написал(а):
On Wed, Dec 12, 2012 at 10:40 AM, Clark Gaebel cgae...@uwaterloo.ca wrote:
I just did a quick derivation from
wooops,
seems theres a galois repo on github here https://github.com/GaloisInc/HaNS
On Wed, Dec 12, 2012 at 3:04 PM, Carter Schonwald
carter.schonw...@gmail.com wrote:
Hey All,
I noticed that the really cool HaNS work
(a mostly pure HS + bits of C networking stack)
seems to have
I found a nice idiom for a graph algorithm where the pairs of nodes
representing links could be merged into node lists by something like:
ns = nub $ map fst g--head nodes
ne = nub $ map snd g -- tail nodes
And found a nicer approach:
(ns,ne) = (nub***nub) unzip g
Or perhaps:
http://hackage.haskell.org/packages/archive/categories/0.59/doc/html/Control-Categorical-Bifunctor.html
On Wed, Dec 12, 2012 at 3:54 PM, Gregory Guthrie guth...@mum.edu wrote:
I found a nice idiom for a graph algorithm where the pairs of nodes
representing links could be merged into node
Also,
http://hackage.haskell.org/packages/archive/bifunctors/3.0/doc/html/Data-Bifunctor.html
On Wed, Dec 12, 2012 at 4:12 PM, Clark Gaebel cgae...@uwaterloo.ca wrote:
http://hackage.haskell.org/packages/archive/categories/0.59/doc/html/Control-Categorical-Bifunctor.html
On Wed, Dec 12,
Yes, thanks, I've seen this; why can't cabal find the package?
Is the fact that it is filed under archive an indicator?!
I have tried Control.Bifunctor, and also Control.Categorical.Bifunctor, and
Data.Bifunctor.
Certainly it is an easy thing to define myself, but I'm both trying to be
On Thu, Dec 13, 2012 at 5:36 AM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
A GPLed containers forces the library user to somehow get a way of
complying to the license.
The language here needs some clarification: the GPL (or other free copyleft
license) only forces someone to do
On Wed, Dec 12, 2012 at 12:09 PM, Clark Gaebel cgae...@uwaterloo.ca wrote:
Possibly. I tend to trust GHC's strictness analyzer until proven otherwise,
though. Feel free to optimize as necessary.
The GHC strictness analyzer will have no troubles with this. Since the
return type is Word64,
On Wed, Dec 12, 2012 at 4:58 PM, Ramana Kumar ramana.ku...@cl.cam.ac.ukwrote:
Using it has the advantage of offering a reason to push those on the fence
about whether to make their software free.
As has already been pointed out, definitions of free differ.
--
brandon s allbery kf8nh
Control.Categorical.Bifunctor and Data.Bifunctor are the module names
not the packages.
The corresponding packages are categories and bifunctors respectively.
2012/12/12 Gregory Guthrie guth...@mum.edu:
Yes, thanks, I've seen this; why can't cabal find the package?
Is the fact that it is filed
On Wed, Dec 12, 2012 at 12:24 PM, Andras Gyomrey lgand...@gmail.com wrote:
Hi,
i got the following error using yesod devel it happened after adding the
file which seems to have invalid content (not true). What should i do?
The first bit of your error message indeed indicates
On 12/12/2012 01:26 AM, Ertugrul Söylemez wrote:
Nathan Hüsken nathan.hues...@posteo.de wrote:
Actually it is very scalable, as the same map is passed to every
object. It can even live in the underlying monad, which means that
you could even use a mutable vector, if you wish; however, I
Check out Control.Lens on hackage.
On 13/12/12 07:54, Gregory Guthrie wrote:
I found a nice idiom for a graph algorithm where the pairs of nodes
representing links could be merged into node lists by something like:
ns = nub $ map fst g--head nodes
ne = nub $ map snd g --
On Wed, Dec 12, 2012 at 12:18 PM, Dmitry Kulagin
dmitry.kula...@gmail.com wrote:
Clark, Johan, thank you! That looks like perfect solution to the problem.
Clean-room reimplementation merged and released as 0.5.2.0.
___
Haskell-Cafe mailing list
Crisis averted!
=)
On Wed, Dec 12, 2012 at 11:15 PM, Johan Tibell johan.tib...@gmail.com wrote:
On Wed, Dec 12, 2012 at 12:18 PM, Dmitry Kulagin
dmitry.kula...@gmail.com wrote:
Clark, Johan, thank you! That looks like perfect solution to the problem.
Clean-room reimplementation merged and
On 12/12/2012 08:15 PM, Johan Tibell wrote:
On Wed, Dec 12, 2012 at 12:18 PM, Dmitry Kulagin
dmitry.kula...@gmail.com wrote:
Clark, Johan, thank you! That looks like perfect solution to the problem.
Clean-room reimplementation merged and released as 0.5.2.0.
Not even a little bit
On Wed, Dec 12, 2012 at 5:38 PM, Michael Orlitzky mich...@orlitzky.com wrote:
On 12/12/2012 08:15 PM, Johan Tibell wrote:
On Wed, Dec 12, 2012 at 12:18 PM, Dmitry Kulagin
dmitry.kula...@gmail.com wrote:
Clark, Johan, thank you! That looks like perfect solution to the problem.
Clean-room
63 matches
Mail list logo
