#780: internal error: mallocBytesRWX:
--+-
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug| Status: closed
Priority: normal |Milestone:
On Wed, Oct 26, 2005 at 06:57:50PM +, Wilhelm B. Kloke wrote:
I am able to make the unregisterised .hc-bundle available on the net
for other users wanting to install ghc on freebsd-amd64.
I would be very grateful if you could make it available.
Or is ist better to generate a new
Hello Caio,
Tuesday, May 30, 2006, 5:29:46 AM, you wrote:
I'm Caio Marcelo and my project for this Summer of Code is Fast
Mutable Collection Types for Haskell, I'll be implementing a lot of
APIs for data collections (like Map and Arrays) using Judy library as
backend.
my comments to your
Bulat Ziganshin wrote:
the Judy library itself:
http://judy.sf.net
http://mesh.dl.sourceforge.net/sourceforge/judy/Judy-1.0.3.tar.gz
I wonder if the authors of the library could be persuaded to make it
available under an Open Source license, because currently it is under the
very limiting
Brian Hulley [EMAIL PROTECTED] wrote:
http://judy.sf.net
I wonder if the authors of the library could be persuaded to make it
available under an Open Source license, because currently it is under
the very limiting restrictions imposed by LGPL...
You have a very non-standard definition
On Tue, 2006-05-30 at 14:16 +0100, Brian Hulley wrote:
Bulat Ziganshin wrote:
the Judy library itself:
http://judy.sf.net
http://mesh.dl.sourceforge.net/sourceforge/judy/Judy-1.0.3.tar.gz
I wonder if the authors of the library could be persuaded to make it
available under an Open
Malcolm Wallace wrote:
Brian Hulley [EMAIL PROTECTED] wrote:
http://judy.sf.net
I wonder if the authors of the library could be persuaded to make it
available under an Open Source license, because currently it is under
the very limiting restrictions imposed by LGPL...
You have a very
Brian Hulley wrote:
Malcolm Wallace wrote:
Brian Hulley [EMAIL PROTECTED] wrote:
If what you really mean by open source is the ability to take code
and into make non-open modifications to it (as BSD permits), then
that is far more demanding than what most people mean by the term.
Well the
Duncan Coutts wrote:
I know some people take issue with using the LGPL for Haskell libraries
because of the linking problems. While it's easy to swap over a LGPL
C .so module it's rather harder for Haskell since there's no stable ABI.
However this is easy to overcome by adding an explicit
On Tue, May 30, 2006 at 04:23:51PM +0100, Simon Marlow wrote:
Duncan Coutts wrote:
I know some people take issue with using the LGPL for Haskell libraries
because of the linking problems. While it's easy to swap over a LGPL
C .so module it's rather harder for Haskell since there's no stable
Fellow Haskellers,
I am pleased to announce the simultaneous release of Shellac 0.3 and Lambda
Shell 0.3. Because I actually never got around to announcing the 0.2
releases, the following change lists are compared to versions 0.1.
Shellac is a library for creating read-eval-print style shells.
Thank you Bjorn!
I'll take a look but it sounds like exactly what I'm looking for!
On May 30, 2006, at 2:35 AM, Bjorn Bringert wrote:
Hi Joel,
the attached example is a simple RPC library. It uses show and read
for serialization, and some type class tricks to allow functions
with
Hi,
does anybody know of a library for writing LDIF files? If
not, I may create one, and would be grateful for
suggestions. Is it worth integrating with John Goerzen's
LDAP binding, for example?
--
Thanks,
Feri.
___
Haskell-Cafe mailing list
On Mon, May 29, 2006 at 07:49:20PM -0700, [EMAIL PROTECTED] wrote:
David Roundy wrote:
I want the return type d to be a phantom type of some sort (although
I'm not clear on the distinction between phantom and existential
types).
Well, they are, in a sense, dual to each other. [...]
On 5/30/06, Thorkil Naur [EMAIL PROTECTED] wrote:
Hello,
It seems that what you need is the technique of evaluating an expression in
reverse polish notation by using a stack. This technique is well known in
subjects related to compiler construction.
Basically, the expression (list of operands
Hello,
Both my Hugs and my GHCi report a type error when presented with this. A
possible repaired version looks like this:
calc :: String - Float
calc = g . foldl f [] . words
where
f (x:y:zs) + = y+x:zs
f (x:y:zs) - = y-x:zs
f (x:y:zs) * = y*x:zs
f (x:y:zs) / =
Mathew Mills wrote:
With Haskell's lovely strong static typing, it is a crying shame we
don't have an editor with immediate feedback, ala Eclipse.
I've started writing an editor for Haskell. (It will be a commercial
product)
The first prototype was in C - now I'm re-writing from scratch in
On Tuesday 30 May 2006 20:59, Brian Hulley wrote:
It is quite a tall order to provide immediate typed feedback of an
edit buffer that will in general be syntactically incomplete but this
is my eventual aim.
One issue in the area of immediate feedback is that Haskell's syntax
is troublesome
hello,
i want to change my input integers
In 23 98
Out 98 23
I think its simple... sorry my first steps in Haskell
thanks for solutions.
--
View this message in context:
http://www.nabble.com/changing+out-t1707014.html#a4634189
Sent from the Haskell - Haskell-Cafe forum at
On 5/30/06, Thorkil Naur [EMAIL PROTECTED] wrote:
Hello,
Both my Hugs and my GHCi report a type error when presented with this. A
possible repaired version looks like this:
calc :: String - Float
calc = g . foldl f [] . words
where
f (x:y:zs) + = y+x:zs
f (x:y:zs) - =
Hi,
i want to change my input integers
In 23 98
Out 98 23
Can you explain what the bigger goal behind this is? It really depends
on exactly what you want to do, if you want a function that takes a
pair of integers and flips the pair, that's easy enough:
f (x,y) = (y,x)
But I guess you have
Benjamin Franksen wrote:
On Tuesday 30 May 2006 20:59, Brian Hulley wrote:
It is quite a tall order to provide immediate typed feedback of an
edit buffer that will in general be syntactically incomplete but this
is my eventual aim.
One issue in the area of immediate feedback is that Haskell's
On 2006 mei 30, at 17:33, Brian Hulley wrote:
But the buffer will nearly always be incomplete as you're editing it.
I was kind of hoping that the syntax of Haskell could be changed so
that for
any sequence of characters there would be a unique parse that had a
minimum
number of gaps
Aditya Siram wrote:
] I am trying to write a function 'applyArguments' which takes a
] function and a list and recursively uses element each in the list as
] an argument to the function. I want to do this for any function taking
] any number of arguments.
]
] applyArgument f (arg) = f arg
]
On Tue, May 30, 2006 at 10:33:05PM +0100, Brian Hulley wrote:
I was kind of hoping that the syntax of Haskell could be changed so that
for any sequence of characters there would be a unique parse that had a
minimum number of gaps inserted by the editor to create a complete parse
tree, and
Well, my thesis (many moons ago I assure you) was on syntax
directed editors. I came to the conclusion that letting the user
do what they want is a requirement, but that "heuristics" and
other "smarts" were to be avoided on the grounds that at least
for my implementation they were more
On Wednesday 31 May 2006 11:32, George Beshers wrote:
Well, my thesis (many moons ago I assure you) was on syntax
directed editors. I came to the conclusion that letting the user
do what they want is a requirement, but that heuristics and
other smarts were to be avoided on the grounds that at
On Wed, May 31, 2006 at 12:19:40PM +1200, Daniel McAllansmith wrote:
On Wednesday 31 May 2006 11:32, George Beshers wrote:
Well, my thesis (many moons ago I assure you) was on syntax
directed editors. I came to the conclusion that letting the user
do what they want is a requirement, but
Hello Nuno,
Monday, May 29, 2006, 10:53:30 PM, you wrote:
I have this type which represents polish expressions (floorplan
representation):
data PeAux a = Folha Char | Nodo Char (PeAux a) (PeAux a) deriving Show
The reverse polish expression are the result of doing a post order
visit to
Hello Matthew,
Monday, May 29, 2006, 10:54:36 PM, you wrote:
If possible I'd like to memory manage on the Haskell side. All of the
calls to BLAS and LAPACK that I'm aware of assume that
all arrays are allocated outside of the C or Fortran that implement the
matrix algorithms. They never
30 matches
Mail list logo
