===
Vacancy PhD student on Real-life datatype-generic programming
Software Technology,
Utrecht University,
The Netherlands.
===
Within the Software Technology group of the Information and Computing
S
Just a reminder that the deadline for the Haskell Workshop is this
Friday, 15th of June!
More info:
http://www.cse.unsw.edu.au/~keller/haskellws/HaskellWorkshop.html
Cheers,
Gabriele
___
Haskell mailing list
Haskell@haskell.org
http://www.haskel
Michael Speer wrote:
> test x y = ( "World" , x , x ++ " " ++ y )
> main = let ( a , b , c ) = test "Hello" a
> in do
> print $ ( a , b , c )
This works, but in your code you actually wrote
let ( ( a, b, c ), ( d, e, f ), ( g, h, i ) ) = ( foo, bar, baz )
with the right side in
On Tue, Jun 12, 2007 at 05:19:37PM +0200, Wolfgang Jeltsch wrote:
> It is always the *least* fixpoint. For example, (0 *) has the fixpoint _|_
> (because 0 * _|_ = _|_) but every integer is also a fixpoint of it.
0 * 5 = 5 ?
You probably meant (1 *) or (0 +).
Best regards
Tomek
_
From: Wolfgang Jeltsch <[EMAIL PROTECTED]>
It is always the *least* fixpoint. For example, (0 *) has the fixpoint _|_
(because 0 * _|_ = _|_) but every integer is also a fixpoint of it.
However, _|_ is less than all those integers in the sense of âless
definedâ,
and so the
Given your reservation regarding LLVM,
you may be interested in vmgen, developed and used as a part of gforth.
It is also claimed that a JVM built with vmgen had performance comparable
to state of the art JITs.
If I remember the author of both gforth (including vmgen) and the
experimantal JVM,
is
Am Dienstag, 12. Juni 2007 11:51 schrieb David House:
> […]
> Another nice way to think about this is in terms of fixed points. Remember
> that an equation like:
>
> numbers = 1 : map (1 +) numbers
>
> Is equivalent to a version using fix:
>
> numbers = fix (\ns -> 1 : map (1 +) ns)
>
> So numbe
On Jun 12, 2007, at 1:52 AM, Martin Grabmueller wrote:
LLVM is indeed interesting, but has several drawbacks:
- written in C++ (we don't have experience in interfacing Haskell
and C++)
You'd have to write a C wrapper, or generate the LLVM intermediate
language directly from Haskell.
- h
For example
numbers = 1 : map (1 +) numbers
works fine
[snip]
But
infinity = 1 + infinity
doesn't work at all, because the value of infinity depends on it's own
value.
Another nice way to think about this is in terms of fixed points. Remember that
an equation lik
Florian Weimer schrieb:
> * Martin Grabmueller:
>
>> For the future, we'd like to be able to support more architectures,
>> but it's not very high on our priority list. Maybe interest
>> of others could change that...
>
> LLVM as a target could be interesting as well, and would avoid the
> need
10 matches
Mail list logo
