es, Sigbjorn Finne?
>
> Is there a URL for the results ?
google would give you: http://icfpcontest.cse.ogi.edu/
see also: http://merd.net/pixel/language-study/icfp-figures.html
(shameless advertising)
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
"Don Syme" <[EMAIL PROTECTED]> writes:
> One point is that in the absence of extensive purity annotations to imperative
> libraries you will need to use monads for operations that shouldn't need them.
> Having to add the annotations certainly counts as a complication in comparison
> to what many
Jorge Adriano <[EMAIL PROTECTED]> writes:
> > > the python string notation (str % tuple) would fit really well too...
> > > putStrLn "hello %s, you got %d right" % ("oliver", 5)
> >
> > Might be nice.
>
> What would be the type of putStrLn then?
some solutions to this:
- cayenne http://www
Hal Daume III <[EMAIL PROTECTED]> writes:
> I'd like to be able to define something like
>
> instance Eq a => Coll (-> Bool) a where
> empty= \_ -> False
> single x = \y -> if x == y then True else False
> union a b = \x -> a x || b x
> insert s x = \y -> x == y || s y
I don't know
Ashley Yakeley <[EMAIL PROTECTED]> writes:
[...]
> -- which of these types are the same?
> f1 = MkFoo undefined :: Foo Succ;
> f2 = MkFoo undefined :: Foo Succ';
> f3 = MkFoo undefined :: Foo Succ'';
> f4 = MkFoo undefined :: Foo (Add (Succ Zero));
yeah, why not! Have them all be the
Lennart Augustsson <[EMAIL PROTECTED]> writes:
> Just because many applications use this doesn't make it safe or good.
> Presumably you are testing for the existence of the file to do something
> to it (read, create, delete...). It's better to do the operation you want to
> do and have it fail i
"Andre W B Furtado" <[EMAIL PROTECTED]> writes:
> Is is possible to declare a generic type without using "data" or "newtype"?
> For example, I woud like that "pair" is a type synonym for "(t,t)" where t
> is a generic type, but just saying:
>
> > type pair = (t,t)
>
> won't work: i get a parse
Richard Uhtenwoldt <[EMAIL PROTECTED]> writes:
[...]
> My reason for posting is to
> bring attention to how something similar is done in the language merd,
> whose designer posts here under the name pixel, and which
> is actually implemented I think.
not re
George Russell <[EMAIL PROTECTED]> writes:
> (1) succ & pred. These appear for float to correspond to adding or subtracting
> 1.0. (I am finding this out by testing with ghci; it's not specified where
> it should be, in section 6.3.4 of the standard). Because of rounding errors,
"Marcin 'Qrczak' Kowalczyk" <[EMAIL PROTECTED]> writes:
> Fri, 14 Sep 2001 02:09:21 -0700, Julian Seward (Intl Vendor)
><[EMAIL PROTECTED]> pisze:
>
> > The lack of any way to interface to C++ is a problem, IMO.
> > I would love to be able to write Haskell programs using Qt
> > and ultimately t
-> False
> Just _ -> True
>
> What's the most general type for `f'?
> The type `f :: Maybe a -> Bool' is less general than
> e.g. `f :: Union { Maybe a, ... } -> Bool',
> but you certainly don't want to infer the latter type.
no
nd also mercury, ocaml)
cu Pixel.
12 matches
Mail list logo
