On Mon, 4 Aug 2003, Ashley Yakeley wrote:
> At 2003-08-04 20:00, Ben Rudiak-Gould wrote:
>
> >This is a different lambda calculus, with a different beta rule. You can
> >see the same effect in the type inference rules for implicit parameters:
> >If f has type Int -> String and ?x has type (?x ::
At 2003-08-04 20:00, Ben Rudiak-Gould wrote:
>This is a different lambda calculus, with a different beta rule. You can
>see the same effect in the type inference rules for implicit parameters:
>If f has type Int -> String and ?x has type (?x :: Int) => Int, then f ?x
>has type (?x :: Int) => Strin
At 2003-08-04 18:19, Ben Rudiak-Gould wrote:
> [EMAIL PROTECTED] -> ((\a -> ((a,[EMAIL PROTECTED] -> @x) [EMAIL PROTECTED] =
> 2})) @x)
>
>If we next apply (\a -> ...) to @x, something interesting happens: we
>have to rename to avoid variable capture.
I don't see why, isn't this much the s
At 2003-08-03 14:09, Ben Rudiak-Gould wrote:
>This reduction is incorrect. Auto-lifted parameters on the RHS of an
>application get lifted out
I am interpreting this as "Auto-lifted parameters on the RHS of an
application get lifted out before [EMAIL PROTECTED] 'beta'-reduction can be
done". I
On Sat, Aug 02, 2003 at 10:35:34AM -0300, Andre W B Furtado wrote:
> Does anyone know if Haskell is/was used to develop educative games? Do you
> recommend some papers on the subject?
Oddly enough, I wrote a version of letter invaders (to teach typing) for
haskell using HSHGL and HSX11 the other d
Trouble for implicit parameter defaults: consider
?foo = 0
let x = ?foo in
(x + ?foo) { ?foo = 1 }
This evaluates to 1 when the monomorphism restriction is turned on, and 2
when it's off. This is no worse than the current behavior of implicit
parameters even without def
==
SECOND CALL FOR PAPERS
CLIMA IV
Fourth International Workshop on Computational Logic in Multi-Agent Systems
Ja
Does anyone know if Haskell is/was used to develop educative games? Do you
recommend some papers on the subject?
Thanks a lot,
-- Andre Furtado
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
On Wed, Jul 30, 2003 at 01:06:02PM +0100, Simon Marlow wrote:
>
>=
> The (Interactive) Glasgow Haskell Compiler -- version 6.0.1
>=
>
> We are pleased to announce a
Ben Rudiak-Gould wrote:
[...]
The final straw was:
Prelude> let ?x = 1 in let g = ?x in let ?x = 2 in g
1
Prelude> let ?x = 1 in let g () = ?x in let ?x = 2 in g ()
2
This is insanity. I can't possibly use a language feature which
behaves in
such a non-orthogonal way.
Well, this i
10 matches
Mail list logo
