Hi Takayuki,
Just thought I'd mention another approach to a variadic zipWith, this one
using type families:
http://typesandkinds.wordpress.com/2012/11/26/variable-arity-zipwith/
The current lack of overlap in type families makes things a bit more
complicated, but it can
be solved using the
On 10/12/12 00:11, Nils wrote:
I'm currently working with a C library that needs to use/modify global C
variables, for example:
igraph_bool_t igraphhaskell_initialized = 0;
int igraphhaskell_initialize()
{
if (igraphhaskell_initialized != 0)
{
printf(C: Not
Hi Simon! Is it not necessary to show the type of igraph_bool_t
igraphhaskell_initialized like
int igraph_bool_t igraphhaskell_initialized = 0?
Success!
Vieira
2012/12/11 Simon Marlow marlo...@gmail.com:
On 10/12/12 00:11, Nils wrote:
I'm currently working with a C library that needs to
On Tue, Dec 11, 2012 at 12:57 PM, Francisco Vieira de Souza
vieira.u...@gmail.com wrote:
Hi Simon! Is it not necessary to show the type of igraph_bool_t
igraphhaskell_initialized like
int igraph_bool_t igraphhaskell_initialized = 0?
igraphhaskell_initialized is the name of the variable,
Hey, Petr!
Have you considered licensing your library as BSD? Given the current
way that Haskell programs are compiled, your library is effectively
licensed as GPL and that will scare away many people from using it.
Cheers, =)
On Mon, Dec 10, 2012 at 6:58 PM, Petr P petr@gmail.com wrote:
Dear list,
I would like to learn about internals of GHC and contribute to its development
in the future. I
read a couple of papers that give a very general overview of GHC (chapter from
AoS, papers about
inliner and multicore support) and I'm thinking what direction should I pursue
now. I
I'm in the same boat, with just a little less reading. :)
It seems to be that if we want to encourage participation in GHC
development, the first step is to lower the barrier of entry.
One way to do that would be to have a page (wiki, perhaps) that has a
reading list for learning about GHC. I'd
Hello everybody!
For testing purposes, I punched down a small program which...
+ puts 2^n elements into an unmutable vector (fromList);
+ generates a random index in the vector (using random-mersenne);
+ reads the value at the index i and at i+{-2,-1,1,2} and makes product
of these values
One way to do that would be to have a page (wiki, perhaps) that has a
reading list for learning about GHC.
Well, I think that GHC wiki has really decent commentary. I'm just not sure if
reading it will be
enough to get started (probably not). So guidance would be appreciated :)
Janek
Eric Rochester eroch...@gmail.com wrote:
Another idea is to have a list of open tasks grouped by how difficult
they will be and how much knowledge of Haskell and GHC will be
required. This is somewhat at odds with the earlier suggestion to have
domains in codebase, with separate de facto
Am 10.12.2012 16:56, schrieb Ertugrul Söylemez:
Nathan Hüsken nathan.hues...@posteo.de wrote:
I put a pseudo C++ example below the mail. I use the terms model and
view for the game logic and rendering respectively.
The example is a little different. Asteroids explode when they
collide. The
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
somewhat smaller kernel arrays. Should I use Haskell and call
On Mon, Dec 10, 2012 at 7:23 PM, Takayuki Muranushi muranu...@gmail.com wrote:
Repeated thanks to you, Adam! Your code is brilliantly simple.
Sadly, I cannot reproduce the behaviors in your comments on my ghci
(7.6.1) .
Can we guess why? The version of packages we are using?
Mines are
On Tue, Dec 11, 2012 at 5:57 AM, Francisco Vieira de Souza
vieira.u...@gmail.com wrote:
Hi Simon! Is it not necessary to show the type of igraph_bool_t
igraphhaskell_initialized like
int igraph_bool_t igraphhaskell_initialized = 0?
igraph_bool_t uses the _t suffix convention for typedefs
Great, I'm in!
Are there any changes in time/date?
On Mon, Dec 3, 2012 at 7:13 PM, Serguey Zefirov sergu...@gmail.com wrote:
I would like to announce MskHUG December meeting and invite everyone
interested.
The meeting will take place December 13th, 20:00 to 23:30 in the nice
conference
Hello All
I am trying to transform this C++ code in Haskell. In case any one
interested this is solution of SPOJ
http://www.spoj.com/problems/DIEHARD/problem.
#includecstdio
#includeiostream
#includecstring
using namespace std;
int memo[1100][1100] ;
int recurse( int h , int a , int cnt , bool
This array is for dynamic programming.
You can diagonalize it into a list and use technique similar to the
Fibonacci numbers.
The resulting solution should be purely declarative.
2012/12/11 mukesh tiwari mukeshtiwari.ii...@gmail.com:
Hello All
I am trying to transform this C++ code in
If you're trying to memoize a recursive algorithm with a global array of
previous states, you could use the marvellous MemoTrie package [1]. It lets
you write your algorithm recursively, while getting all the benefits of
memoization! Here's an example with the fibonacci function:
fib :: Int -
Hi,
Am Dienstag, den 11.12.2012, 15:25 +0100 schrieb Richard Janis Beckert:
I would be very happy for some input on this, because I am pretty new to
Haskell and I don't really know how to do proper profiling.
by looking at the core (-ddump-simpl) I found a few issues.
neighProd vs l i =
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 don't
recommend that.
Remember that a map is
Using the GPL (or a strong copyleft free license) strengthens the free
software community of which I thought the Haskell community is a part (or
at least intersects substantially).
I'm not sure why people are recommending not to use it.
Let me counter with my recommendation against switching to
On Tue, Dec 11, 2012 at 8:26 PM, Ramana Kumar ramana.ku...@cl.cam.ac.ukwrote:
Using the GPL (or a strong copyleft free license) strengthens the free
software community of which I thought the Haskell community is a part (or
at least intersects substantially).
Haskell libraries are mostly BSD
On Tue, Dec 11, 2012 at 5:35 PM, Brandon Allbery allber...@gmail.comwrote:
(Oddly enough, GPL is not the only open source license.)
There was no implication to the contrary. It was stated that BSD is a
*weaker* license - this is true in the sense that it has fewer requirements
(in particular,
On Wed, Dec 12, 2012 at 2:26 AM, Ramana Kumar ramana.ku...@cl.cam.ac.ukwrote:
Using the GPL (or a strong copyleft free license) strengthens the free
software community of which I thought the Haskell community is a part (or
at least intersects substantially).
I don't think it strengthens the
Note: IANAL
On Tue, 2012-12-11 at 17:45 -0800, David Thomas wrote:
On Tue, Dec 11, 2012 at 5:35 PM, Brandon Allbery allber...@gmail.comwrote:
(Oddly enough, GPL is not the only open source license.)
There was no implication to the contrary. It was stated that BSD is a
*weaker* license -
Right. Like, if Linus hadn't bogged down the Linux kernel with the GPL
license, it might have wound up as popular as BSD!
Both dynamics go on, and the question is which is more likely to dominate
in a given case (and cumulatively).
On Tue, Dec 11, 2012 at 5:50 PM, Jonathan Fischer Friberg
As a matter of fact, BSD is far more popular on the desktop than GPL. And
has a huge share of the mobile market. Witness: OS X, iOS.
And none of this has anything to do with Haskell. Petr can release *his*
code with any license he wants. Some licenses fit into *this* ecosystem
better than
... and OS X and iOS are clearly a win for the FLOSS community?
On Tue, Dec 11, 2012 at 6:07 PM, Alexander Solla alex.so...@gmail.comwrote:
As a matter of fact, BSD is far more popular on the desktop than GPL. And
has a huge share of the mobile market. Witness: OS X, iOS.
And none of this
On 12 December 2012 12:57, Nicolas Trangez nico...@incubaid.com wrote:
Note: IANAL
On Tue, 2012-12-11 at 17:45 -0800, David Thomas wrote:
On Tue, Dec 11, 2012 at 5:35 PM, Brandon Allbery allber...@gmail.comwrote:
(Oddly enough, GPL is not the only open source license.)
There was no
I wonder if this discussion has been had before in the Haskell community.
If so, pointers to archives could be of interest.
I'm glad to see that there are others who apparently share my concern about
the fact that people are actively recommending that new libraries be
licensed without copyleft.
I am pleased to announce the release of version 0.6 of diagrams [1], a
full-featured framework and embedded domain-specific language for
declarative drawing. Check out the gallery [2] for examples of what it
can do! [3,4]
[1] http://projects.haskell.org/diagrams
[2]
David Thomas davidleotho...@gmail.com wrote:
... and OS X and iOS are clearly a win for the FLOSS community?
Yes. The parts of it that are willing to use BSD-licensed software, anyway.
Apple does release sources to some of their toys. They released all of OS X
below the GUI level, for
Dear Brent and co-authors of diagrams,
this is a very nice thing, thank you very much!
I was recently missing a tool that was able to output simple PNG diagrams
from the input of lists of point coordinates. My solution was very ad-hoc
and suited to my background: I am only familiar with the
Hi,
I noticed that you're not required to export the types mentioned in
the default method signature. For example, you could have:
default hashWithSalt :: (Generic a, GHashable (Rep a)) = Int - a - Int
hashWithSalt salt = ghashWithSalt salt . from
and not export the GHashable class.
On 12/11/12 8:58 AM, Janek S. wrote:
Dear list,
I would like to learn about internals of GHC and contribute to its development
in the future. I
read a couple of papers that give a very general overview of GHC (chapter from
AoS, papers about
inliner and multicore support) and I'm thinking what
On 12/11/12 9:29 AM, Janek S. wrote:
One way to do that would be to have a page (wiki, perhaps) that has a
reading list for learning about GHC.
Well, I think that GHC wiki has really decent commentary. I'm just not sure if
reading it will be
enough to get started (probably not). So guidance
On 12/11/12 9:30 PM, Ramana Kumar wrote:
I wonder if this discussion has been had before in the Haskell community.
If so, pointers to archives could be of interest.
Indeed, the discussion has been had more than once. Alas, I'm too bogged
for time to look up the archives at the moment.
I'm
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 certainly worth being aware of.
It sounds (and I'd very
Hi Trevor (and cafe),
I've been playing more and more with accelerate, and I find it quite
annoying that there are no loops. It makes implementing many algorithms
much harder than it should be.
For example, I would love to submit a patch to fix issue #52 [0] on github
by implementing MWC64X [1],
On Tue, Dec 11, 2012 at 6:10 AM, Eric Rochester eroch...@gmail.com wrote:
I'm in the same boat, with just a little less reading. :)
It seems to be that if we want to encourage participation in GHC
development, the first step is to lower the barrier of entry.
One way to do that would be to
40 matches
Mail list logo
