Thu, 08 Feb 2001 09:41:55 +0300, S.D.Mechveliani <[EMAIL PROTECTED]> pisze:
> If s is an element of a certain domain, then one can use the
> construction
> cast s x
>
> to convert various data x to corresponding canonical values in the
> domain defined by s.
Defining
Thu, 8 Feb 2001 13:39:51 +0100 (MET), Bjorn Lisper <[EMAIL PROTECTED]> pisze:
> >I see. So you can transform arbitrary function of type a->b->c
> >to a function of type [a]->b->[c], by applying
> >\f x y -> map (\z -> f z y) x
> >and similarly a->b->c to a->[b]->[c]. But then there are two wa
Thu, 8 Feb 2001 12:46:29 +0100 (MET), Johannes Waldmann
<[EMAIL PROTECTED]> pisze:
> Yes, I see that. However I think that adding type signatures is
> good programming practice anyway, and I wouldn't mind if a future
> Haskell required me to do some explicit typing (for top-level
> definitions,
On Tue, 06 Feb 2001 15:27:54 +
"C.Reinke" <[EMAIL PROTECTED]> wrote:
>
> > Haskell.org has a page "Job Adverts".
> > http://www.haskell.org/jobs.html
>
> [snip]
>
> A Adverts for positions involving Haskell
> - Positions in Academia
> - Positions in Industry
>
> [snip]
Why no
On Thu, Feb 08, 2001 at 02:47:41PM +, Malcolm Wallace wrote:
> We are pleased to announce the release of version 2.02 of 'hmake',
> the intelligent compilation manager for Haskell compilers.
>
> http://www.cs.york.ac.uk/fp/hmake/
> ftp://ftp.cs.york.ac.uk/pub/haskell/hmake/
I have bu
We are pleased to announce the release of version 2.02 of 'hmake',
the intelligent compilation manager for Haskell compilers.
http://www.cs.york.ac.uk/fp/hmake/
ftp://ftp.cs.york.ac.uk/pub/haskell/hmake/
What's new in 2.02?
---
This is mainly a bugfix release.
* Impr
S.D.Mechveliani ([EMAIL PROTECTED]) wrote:
[snip]
: The basic algebra library BAL
: http://www.botik.ru/pub/local/Mechveliani/basAlgPropos/bal-pre-0.01/
:
: suggests class Cast a b where cast :: a -> b -> a
I just want to add that this is almost similar to a
mechanism I've imple
> want to install FranTk so other people can use it. I'm not sure
> this is possible.
sure it is .. and it is rather easy to make it known to ghc
(so that -syslib frantk works). just add these lines to the driver script
(around line 2740, where all the other syslib entries live)
frantk,
Hi Petra,
Since you are a system administrator, I asume that you will also
want to install FranTk so other people can use it. I'm not sure
this is possible. I did manage to get it working for myself localy,
but a "make install" doesn't do anything.
If you are in a hurry, you can use the fixes be
>I see. So you can transform arbitrary function of type a->b->c
>to a function of type [a]->b->[c], by applying
>\f x y -> map (\z -> f z y) x
>and similarly a->b->c to a->[b]->[c]. But then there are two ways of
>transforming a->b->c to [a]->[b]->[[c]] and the order of applying the
>former tr
On 07-Feb-2001, Marcin 'Qrczak' Kowalczyk <[EMAIL PROTECTED]> wrote:
> So why is fmap separate now? Probably because having too much
> overloading causes ambiguities.
Perhaps. But I think there may be other reasons too.
Having fmap separate is useful for beginners and for teaching,
because you
> There is exponential growth of possibilities in compound expressions.
> And I'm afraid that ambiguities would happen in unexpected places and
> it would not be easy to find where to add type signatures. Especially
> as there is less explicit type information than in many other
> statically typed
On 08-Feb-2001, John Meacham <[EMAIL PROTECTED]> wrote:
> A nice advantage of using my mid-level routines is that there are very
> little requirements placed on 'Byte' as a type, this means that as long
> as to the outside world you only read in 8 bit values and spit 8 bit
> values out you can rep
On Thu, 8 Feb 2001, Bjorn Lisper wrote:
> >> Int -> [a] -> Int, since this is the type it will get in the original type
> >> system.
> This is a misunderstanding. the transformation of f l y , where l :: [Int]
> for instance, should depend only on the type of f and not its definition.
> It is th
Since there seems to be general support for the idea of some sort of
Portable Byte IO package, I will work on am implementation of my
proposal for ghc being the platform I am most familiar with. I really
like the simplicity of the hPut and hGet idea and will probably use it
as my mechanism for imp
Hi Faizan,
> "FAIZAN" == FAIZAN RAZA <[EMAIL PROTECTED]> writes:
FAIZAN> Hello Please help me to solve this questions
FAIZAN> Question
FAIZAN> Cartesian Product of three sets, written as X x Y x Z is
FAIZAN> defined as the set of all ordered triples such that the
FAIZA
>> It is quite similar in spirit to the concept of principal type in
>> Hindley-Milner type systems. An expression can have many types but
>> only one "best" (most general) type in that system.
>Now, I'm not any kind of expert on this, but isn't the most general
>HM type one that encompasses the
>> >Also, what is the inferred type of, for example
>> >f x y = x + length y
>> >? It can be
>> >Int -> [a] -> Int
>> >[Int] -> [a] -> [Int]
>> >and neither is more general than the other. And this is a simple
>> >function.
>>
>> Int -> [a] -> Int, since this is the type it will get i
--- Tom Pledger <[EMAIL PROTECTED]> wrote:
> anatoli writes:
> :
> | The same error message is given for
> |
> | > data Foo a = (Eq b) => MkFoo b
>
> Since the type variable a is orphaned, how about reducing it to this?
>
> > data Foo = forall b . Eq b => MkFoo b
This is possible (the sem
19 matches
Mail list logo
