On Mon, Jun 27, 2005 at 01:08:07PM +0100, Simon Marlow wrote:
On 25 June 2005 21:09, Frederik Eaton wrote:
Skipping Version ( ./Version.hs,
dist/build/./fcq-www.cgi-tmp/Version.o ) Skipping ChangeLog(
./ChangeLog.hs, dist/build/./fcq-www.cgi-tmp/ChangeLog.o ) Compiling
On 28 June 2005 07:37, Frederik Eaton wrote:
On Mon, Jun 27, 2005 at 01:08:07PM +0100, Simon Marlow wrote:
On 25 June 2005 21:09, Frederik Eaton wrote:
Skipping Version ( ./Version.hs,
dist/build/./fcq-www.cgi-tmp/Version.o ) Skipping ChangeLog
( ./ChangeLog.hs,
Bugs item #1225368, was opened at 2005-06-22 08:29
Message generated for change (Comment added) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1225368group_id=8032
Please note that this message will contain a full copy of the comment
Bugs item #1225368, was opened at 2005-06-22 08:29
Message generated for change (Settings changed) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1225368group_id=8032
Please note that this message will contain a full copy of the comment
Good evening,
I just stumbled across a segfault caused when running the
following small program. (During an attempt to implement
single-assignment variables.)
module Main where
import Control.Concurrent
import System.IO.Unsafe (unsafeInterleaveIO)
main = do
v - newEmptyMVar
a -
We've finally digested the results of the GHC survey, and you can find
our analysis here:
http://www.haskell.org/ghc/survey2005-summary.html
There's a lot to take in, but it's an interesting read. Enjoy!
--
The GHC Team.
___
Glasgow-haskell-users
Some people would like features removed (implicit parameters was mentioned a
couple of times). Linear implicit parameters is a clear candidate for removal.
I don't understand the motivation for this. Implicit parameters do weird
things with the monomorphism restriction, but when I'm worried
We've finally digested the results of the GHC survey, and you can find
our analysis here:
http://www.haskell.org/ghc/survey2005-summary.html
There's a lot to take in, but it's an interesting read. Enjoy!
--
The GHC Team.
___
Haskell mailing list
On 28 Jun 2005, at 10:58, Simon Marlow wrote:
We've finally digested the results of the GHC survey, and you can find
our analysis here:
http://www.haskell.org/ghc/survey2005-summary.html
There's a lot to take in, but it's an interesting read. Enjoy!
I feel compelled to point out that for
[With apologies in advance for any duplication. Kevin]
Heriot-Watt University, School of Mathematical Computer Sciences/
University of St Andrews, School of Computer Science
Two Postdoctoral Research Positions in Embedded
Software for Visual Sensing on Autonomous Vehicles
£21,640 - £29,128
On Tue, Jun 28, 2005 at 01:27:39PM +0100, Thomas Davie wrote:
On 28 Jun 2005, at 10:58, Simon Marlow wrote:
We've finally digested the results of the GHC survey, and you can find
our analysis here:
http://www.haskell.org/ghc/survey2005-summary.html
There's a lot to take in, but it's
On Tue, Jun 28, 2005 at 11:30:04AM -0400, Jim Apple wrote:
Some people would like features removed (implicit parameters was
mentioned a couple of times). Linear implicit parameters is a clear
candidate for removal.
I don't understand the motivation for this. Implicit parameters do weird
On 6/27/05, Arjun Guha [EMAIL PROTECTED] wrote:
It's the all-pairs
shortest paths data for a map of the Hyde Park area of Chicago (no real
reason, really).
I wonder: is there really no way to do Floyd-Warshall in Haskell?
--
regards,
radu
http://rgrig.blogspot.com/
Hi Mads,
Since ghc-6.4 there's another feature that is enabled by such explicit
foralls in type signatures, namely scoped type variables. Consider
foo :: Num a = a - a - a
foo x y = x + z where
z = 2 * y
Now since adding type signatures is a good thing, you want to give z
an explicit type
Flavio Botelho wrote:
At many places i have put a Char type instead of an abstract one because some
funcations were not working properly before and i wanted to be able to output
things and so be able to see what was the problem.
(Haskell doesnt seem a 'magic' function to output arbitrary
Re: Bulat's comments
1) adding OO-like features in O'Haskell style. for readers that don't
know it's about adding new variants to ADT types:
type Figure = Circle ...
type Figure |= Box ...
With ADTs you do pattern match on the constructor,
but in OO style guides (see Fowler: Refactoring)
Bulat Ziganshin wrote:
JW interface Figure
JW class Circle implements Figure
JW class Box implements Figure
this don't give ability to create polymorphic collections
You mean in Haskell? I would probably use existential types then.
Something like data EFigure = forall f . Figure f =
On Tue, 28 Jun 2005, Bulat Ziganshin wrote:
you are completely skipped the point that these is just for C++
programmers wanting to program in Haskell and aimed to give them
faster learning path and easy to use instruments
Not to forget to make learning easier for programmers of Perl, Ruby,
you are completely skipped the point that these is just for C++
programmers wanting to program in Haskell and aimed to give them
faster learning path and easy to use instruments
Not to forget to make learning easier for programmers of Perl, Ruby,
Python, Rexx, Tcl, APL, C#, Java, Bash,
On Tue, 28 Jun 2005, robert dockins wrote:
you are completely skipped the point that these is just for C++
programmers wanting to program in Haskell and aimed to give them
faster learning path and easy to use instruments
Not to forget to make learning easier for programmers of Perl, Ruby,
On Tue, 2005-06-28 at 12:11 +0300, Radu Grigore wrote:
On 6/27/05, Arjun Guha [EMAIL PROTECTED] wrote:
It's the all-pairs
shortest paths data for a map of the Hyde Park area of Chicago (no real
reason, really).
I wonder: is there really no way to do Floyd-Warshall in Haskell?
Indeed I
On Sat, 2005-06-25 at 03:39 -0400, Dimitry Golubovsky wrote:
I am pleased to announce the very first alpha release of the (yet
another) FFI binding autogeneration tool.
[...]
http://www.golubovsky.org/repos/hsffig/
I will appreciate any feedback.
You may be interested to know that there
Hi,
On Wednesday 29 June 2005 10:05, Duncan Coutts wrote:
On Tue, 2005-06-28 at 12:11 +0300, Radu Grigore wrote:
On 6/27/05, Arjun Guha [EMAIL PROTECTED] wrote:
It's the all-pairs
shortest paths data for a map of the Hyde Park area of Chicago (no real
reason, really).
I wonder: is
On Tue, 2005-06-28 at 20:13 -0400, Arjun Guha wrote:
As a self-taught Haskell programmer of about a year, I'm really
interested in seeing your colleague's code. I'd like to know what I
did wrong. How about after two weeks? I think that's reasonable!
I'm sure we'll publish our entry
On 6/29/05, Duncan Coutts [EMAIL PROTECTED] wrote:
Indeed I understand from a colleague who implemented an all-pairs
shortest paths algorithm in Haskell over the weekend for a map of the
Hyde Park area of Chicago (no real reason, really!), that it takes about
0.1 seconds to execute (if you
25 matches
Mail list logo
