- Original Message -
From: Marita Wojdak <[EMAIL PROTECTED]>
To: 1MargieD <[EMAIL PROTECTED]>
Sent: donderdag 1 juni 2000 16:58
Subject: Fw: Fatima 10
>
> God love you,
>
> Marita
> Helpers of Our Lady Queen of Peace
> http://web.frontier.net/cgallagher
> - Original Message -
>From: Peter Douglass <[EMAIL PROTECTED]>
>To: 'Jan Brosius' <[EMAIL PROTECTED]>; Frank Atanassow <[EMAIL PROTECTED]>
>Cc: <[EMAIL PROTECTED]>
>Sent: Friday, May 19, 2000 6:03 PM
>Subject: RE: more detailed explanation about forall in Haskell
I also think it is hopeless , but I still want to try again
*- Original Message -
*From: Frank Atanassow <[EMAIL PROTECTED]>
*To: Jan Brosius <[EMAIL PROTECTED]>
*Cc: Frank Atanassow <[EMAIL PROTECTED]>; <[EMAIL PROTECTED]>
*Sent: Friday, May 19, 2000 12:
|From: Lennart Augustsson <[EMAIL PROTECTED]>
|To: Jan Brosius <[EMAIL PROTECTED]>
|Cc: Frank Atanassow <[EMAIL PROTECTED]>; <[EMAIL PROTECTED]>
|Sent: Friday, May 19, 2000 12:07 PM
|Subject: Re: more detailed explanation about forall in Haskell
> Jan Brosius wrote
>From: Frank Atanassow <[EMAIL PROTECTED]>
>To: Jan Brosius <[EMAIL PROTECTED]>
>Cc: <[EMAIL PROTECTED]>
>Sent: Thursday, May 18, 2000 2:53 PM
>Subject: Re: more detailed explanation about forall in Haskell
> Jan Brosius writes:
> > I must put this in
- Original Message -
From: Jan Brosius <[EMAIL PROTECTED]>
To: Carl R. Witty <[EMAIL PROTECTED]>
Sent: Thursday, May 18, 2000 12:06 PM
Subject: Re: Fw: more detailed explanation about forall in Haskell
> Thanks Carl for letting me see an ugly error that I made . SHAME
Sorry, if in some way I have upset you
Sincerely
Jan Brosius
>From: Frank Atanassow <[EMAIL PROTECTED]>
>To: Frank Atanassow <[EMAIL PROTECTED]>
>Sent: Wednesday, May 17, 2000 1:50 PM
>Subject: Fw: more detailed explanation about forall in Haskell
> Frank Atanass
>>>From: Frank Atanassow <[EMAIL PROTECTED]>
>To: Jan Brosius <[EMAIL PROTECTED]>
>Cc: <[EMAIL PROTECTED]>>
>Sent: Wednesday, May 17, 2000 1:35 PM
>Subject: Fw: more detailed explanation about forall in Haskell
> Jan Brosius writes:
> > &
en another framework than the one proposed in Haskell
Very friendly
Jan Brosius
>- Original Message -
>From: Lars Lundgren <[EMAIL PROTECTED]>
>To: Jan Brosius <[EMAIL PROTECTED]>
>Cc: <[EMAIL PROTECTED]>
>Sent: Wednesday, May 17, 2000 10:56 AM
>Subje
- Original Message -
From: Jan Brosius <[EMAIL PROTECTED]>
To: Richard Uhtenwoldt <[EMAIL PROTECTED]>
Sent: Wednesday, May 17, 2000 1:23 AM
Subject: Re: more detailed explanation about forall in Haskell
>
> - Original Message -
> From: Richard Uhtenwo
>- Original Message -
>From: Marcin 'Qrczak' Kowalczyk <[EMAIL PROTECTED]>
>Sent: Tuesday, May 16, 2000 11:40 PM
>Subject: Re: more detailed explanation about forall in Haskell
> Tue, 16 May 2000 22:37:45 +0200, Jan Brosius <[EMAIL PROTECTED]>
pi
>- Original Message -
>From: Lars Lundgren <[EMAIL PROTECTED]>
>
>Sent: Tuesday, May 16, 2000 1:54 PM
>Subject: Re: more detailed explanation about forall in Haskell
> On Tue, 16 May 2000, Jan Brosius wrote:
>
> > Ok I understand this isomorphism better
>From: Marcin 'Qrczak' Kowalczyk <[EMAIL PROTECTED]>
>To: <[EMAIL PROTECTED]>
>Sent: Tuesday, May 16, 2000 11:42 AM
>Subject: Re: more detailed explanation about forall in Haskell
> Tue, 16 May 2000 10:54:59 +0200, Jan Brosius <[EMAIL PROTECTED]>
ile with your type of runST?
"my" type of runST is nothing else but the official runST .
So, I expect that if s is instantiated to the type RealWorld you will get a
problem,
since is not defined for s = RealWorld because runST will not work with
with s= RealWorld.
So, you should
on all as (the proof has to be supplied
> before a specific a is given; the quantification over a is inside the
> parameter proof). In the second case, the proof can be given after both a
> and b have been given (the proof is inside of both quantifiers).
>
> It is this limitation of
ly from which doubly quantified formula your formula
comes from.
> Thu, 11 May 2000 13:48:56 +0200, Jan Brosius <[EMAIL PROTECTED]>
pisze:
>
> > > Types can be treated as logical formulas, according to the
Curry-Howard
> > > isomorphism.
> >
> > Sorry, never heard
Hi,
is there any way to email written stuff to the Haskell
committee?
Very Friendly
Jan Brosius
>
>
>
> > Jan Brosius writes:
> > > Marcin Kowalczyk wrote at Wed, May 10, 2000 7:54 PM :
> > > > > 2. Next let me point out once and for all that
> > > > > logical quantifiers are used only in logical formula's .
> > > &
Marcin Kowalczyk wrote at Wed, May 10, 2000 7:54 PM :
> Wed, 10 May 2000 16:18:06 +0200, Jan Brosius <[EMAIL PROTECTED]>
pisze:
pisze ? you meant wrote? Please don't use Russian in your reply, I don't
know Russian.
Do You know what pisze in Dutch could mean if spoken out loos
ST.
5. Using `b as defined above we could give
now
the following type signature for newSTRef
newSTRef :: forall a . a -> (`b s. ST s (STRef s
a))
Here `b s. ST s (STRef s a) will mean the type
of ALL ST s (STRef s a) with the EXCEPTION
of any type of the form ST s (STRef s T(s))
- Original Message -
From: Jan Brosius <[EMAIL PROTECTED]>
To: Marcin 'Qrczak' Kowalczyk <[EMAIL PROTECTED]>
Cc: <[EMAIL PROTECTED]>
Sent: Wednesday, May 03, 2000 1:04 PM
Subject: Re: About the abuse of forall in Haskell
>
> > May 03, 2000 12:
I also support the idea's , and It doesn't chande the language it only
structures it, but I am a lightweight in Haskellland.
Sometimes I wonder if the readers are overworked or just plainly arrogant.
Friendly
Jan Brosius
- Original Message -
From: Jan Skibinski <[EMAIL P
> May 03, 2000 12:53 AM Marcin 'Qrczak' Kowalczyk wrote:
> Tue, 2 May 2000 22:47:08 +0200, Jan Brosius <[EMAIL PROTECTED]> pisze:
>
> > First I want to end this with the following observation : if the
> > forall in ( forall s1 . ST s1 T(s) ) reall
the libraries and there is no way to interrogate the
typechecker.
So this question is obsolete.
Fergus , other things might be lethal too,
Friendly
Jan Brosius
as " runST
:: ( `b s . ST s a ) ->
a
even as defining new types with
`b looks mathematically appealing.
Oof . Thanks for reading and sorry for the
typo's
Friendly
Jan Brosius
sense doing.
But perhaps it is not possible in a statically typed language.
More about this will be clear in a forthcoming email that I am now preparing
titled "About the abuse of frall in Haskell"
Friendly
Jan Brosius
> Tue, 2 May 2000 10:14:40 +0200, Jan Brosius <[EMAIL P
> On 29-Apr-2000, Jan Brosius <[EMAIL PROTECTED]> wrote:
> >
> > Is it possible to interrogate the typechecker
> > from within a Haskell program
>
> You can of course invoke a Haskell typechecker (e.g. Hugs) as a separate
process.
>
> Why do you ask? Wh
Hi,
Is it possible to interrogate the typechecker
from within a Haskell program
Friendly
Jan Brosius
r question : is there any way to interrogate the typechecker from
within a Haskell program?
Could this be put on the wishlist?
Friendly
Jan Brosius
hat you mean.
>
> - Using mutable state in a monad you can implement a doubly
> linked list directly.
please show me how to implement using mutable state in
a monad
Friendly
Jan Brosius
Hi,
I wonder if it is possible to simulate a doubly linked list in
Haskell.
Friendly
Jan Brosius
> On 26-Apr-2000, Jan Brosius <[EMAIL PROTECTED]> wrote:
> > Hi,
> >
> > First I give the following primitive operations
> >
> > newVar :: a -> ST s (MutVar s a)
> >
> > readVar :: MutVar s a -> ST s a
> >
> &g
f v = runST
(newVar v `thenST` \w ->
readVar w)
1. What is the type given to newVar v by
the typechecker?
Friendly
Jan Brosius
erty, Buckhannon, West Virginia 4. Lynne
Snyder, Belington, WV 5. Jan Brosius PhD, Rotselaar ,
BELGIUM
PLEASE COPY this email on to a new message, sign the
bottomand forward it to everyone on your distribution
lists. If you receive thislist with more than 300
names on it, please e-ma
Thanks for this workaround, it worked.
This might be a tip to be put on the mailing list, since
other people using Windows NT and Winzip might have the
same problem.
Friendly
Jan Brosius
- Original Message -
From: Simon Peyton-Jones <[EMAIL PROTECTED]>
To: 'Jan Brosi
om a -> a to a -> b
but the reverse is possible.
Also if f was defined as
f :: a -> b
f x = x
wouldn't the typechecker complain?
Friendly
Jan Brosius
ter renaming my variables I get f is of type a -> b -> c
Wrong or right?
Friendly
Jan Brosius
ing of type " is
a transitive relation among types, isn't?
Hoping to get comments
Friendly
Jan Brosius
adVar v is say " MutVar s Bool"
> then readVar v will have type "ST s Bool".
> the article sais " s is free " . So my question is why hasn't readVar v
the
> type " forall s ( ST s Bool) " ?
>
> Thanks
>
> Jan Brosius
>
>
g website
http://www.ptc.spbu.ru/~uwe/lout/lout.html
Friendly
Jan Brosius
>
>
ing. It would be nice if you would like to explain me
what you mean by " hyperstrict"
Friendly
Jan Brosius
>
>
> Cheers
> --
> Christoph Herrmann
> E-mail: [EMAIL PROTECTED]
> WWW: http://brahms.fmi.uni-passau.de/cl/staff/herrmann.html
>
>
- Original Message -
From: Ketil Malde <[EMAIL PROTECTED]>
To: Jan Brosius <[EMAIL PROTECTED]>
Cc: <[EMAIL PROTECTED]>; S.D.Mechveliani <[EMAIL PROTECTED]>
Sent: Tuesday, March 21, 2000 10:14 AM
Subject: Re: speed of compiled Haskell code.
> "Jan Bro
- Original Message -
From: Marcin 'Qrczak' Kowalczyk <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Monday, March 20, 2000 8:58 PM
Subject: Re: Fw: a problem concerning a paper
> Mon, 20 Mar 2000 14:59:26 +0100, Jan Brosius
<[EMAIL PROTECTED]> p
datastructures are ? times slower than C.
Please correct me where I am wrong and fill in the required number for the ?
sign above
Friendly
Jan Brosius
it will turn out.
I am not aware of any other porting efforts. The current focus of
our
development efforts are improving the performance with an X86 native
backend and adding functionality.
###
>But I am not so sure.
>It is easy to mistake with such comparison.
Cheers
Jan Brosius
v is say " MutVar s Bool"
> then readVar v will have type "ST s Bool".
> the article sais " s is free " . So my question is why hasn't readVar v
the
> type " forall s ( ST s Bool) " ?
>
> Thanks
>
> Jan Brosius
>
>
think Lout is the best candidate
Cheers
Jan Brosius
Does anyone know if this below situation is as bad in say SMLNJ or OCAML?
JanBrosius
- Original Message -
From: Jan Kort <[EMAIL PROTECTED]>
To: Simon Marlow <[EMAIL PROTECTED]>
Cc: <[EMAIL PROTECTED]>
Sent: Thursday, March 16, 2000 12:59 PM
Subject: Re: records in Haskell
> Simon Marlo
strictness.
What about Haskell 98 versus (I anticipate) Haskell 2
Thanks
Jan Brosius
Hi,
will Haskell compiled programs be faster by using more strictness
annotations; I especially think of Clean where strictness annotations are
"abundantly" used?
Thanks
Jan
gt;
To: Jan Brosius <[EMAIL PROTECTED]>
Cc: <[EMAIL PROTECTED]>
Sent: Monday, July 19, 1999 6:31 PM
Subject: Re: typing error?
> Jan Brosius wrote:
>
> > I have read the online postscript paper " Lazy Functional State
Threads".
> > I think the typing
Hi,
compared with Ocaml and SML , Haskell is a more sophisticated and more
elegant language. Does anybody know how efficient the Haskell compiler is
with regards to impure functional languages.
Thanks
Jan
Hi,
I have read the online postscript paper " Lazy Functional State Threads".
I think the typing (page 4)
f :: MutVar s a -> Mutvar s a
is wrong, since the definition of f is :
f v = runST ( newVar v 'thenST' \w ->
readVar w)
and since newVar is typed as:
newVar :: a
Keith Wansbrough writes:
>
> The system of second-order lambda calculus, or System F, is the system
> you are looking for. It features rank-2 polymorphism in the sense that
> a polymorphic function may be used at a polymorphic type.
>
> In other words, consider the identity function `id' (usin
Hi,
Is there anyone who can explain to me what is meant by second rank
polymorphism.
I have already read all available online documentation.
In logic one has: forall x forall y = forall y forall x.
Doesn't haskell 98 allow in place updating e.g; for records?
Thanks
Jan
55 matches
Mail list logo
