Last CFP: WS on Principles of Abstract Machines

1998-05-29 Thread Stephan Diehl
___ My apologies if you receive this more than once! ___ -- LAST CALL FOR PA

Re: Haskore music representation and performance

1998-05-29 Thread Paul Hudak
> Looking at the definition of the Music datatype ... > we can see that phrase attributes can be nested, allowing > one to write something like > m = Phrase [Dyn (Crescendo 1.2)] > ( c 5 wn [] :+: Phrase [Dyn (Diminuendo 1.2)] >(e 5 wn

ANNOUNCE: GHC Version 3.02

1998-05-29 Thread Simon Marlow
The Glasgow Haskell Compiler -- version 3.02 == We are pleased to announce a new release of the Glasgow Haskell Compiler (GHC), version 3.02. The source distribution is freely available via the World-Wide Web and through anon.

FM'99 World Congress on Formal Methods

1998-05-29 Thread Dines Bjorner
May 29, 1998 Version FM'99: World Congress on Formal Methods -- in the Development of Computing Systems --- --

Preliminary Announcement and CFP: COORDINATION 99

1998-05-29 Thread Farhad . Arbab
Advanced apologies in case you receive more than one copy of this.--fa Preliminary Announcement and Call for Papers COORDINATION '99 Third International Conference on Coordinati

Re: order of evalutation of ||

1998-05-29 Thread Martin Norbäck
-BEGIN PGP SIGNED MESSAGE- On Thu, 28 May 1998, S. Alexander Jacobson wrote: > If you have a statement like: > > result= a || b || c > > does Haskell guarantee that a gets evaluated before b? > If it does then I only have to protect against pattern match failure in > one place, a. Ye

Re: Pattern Match Success Changes Types

1998-05-29 Thread Fergus Henderson
On 28-May-1998, Adrian Hey <[EMAIL PROTECTED]> wrote: > > A strong type system is supposed to prevent runtime errors. > > Thus it makes sense to disallow anything that might > > result in an attempt to access an unbound type. > > Yes, but in the cases we've been talking about we know that there w

Re: order of evalutation of ||

1998-05-29 Thread Arjan van Ijzendoorn
Hello Alexander, > If you have a statement like: > > result= a || b || c It is better to speak of 'declarations'. There are no statements in Haskell. > does Haskell guarantee that a gets evaluated before b? Yes, it does. You can think of (||) being defined as: (||) :: Bool -> Bool -> Bool Tr

Re: order of evalutation of ||

1998-05-29 Thread Simon L Peyton Jones
> > If you have a statement like: > > result= a || b || c > > does Haskell guarantee that a gets evaluated before b? > If it does then I only have to protect against pattern match failure in > one place, a. Yes; if a is true, b and c won't be evaluated. That's part of the defn of || Simon

order of evalutation of ||

1998-05-29 Thread Alex Ferguson
S. Alexander Jacobson wonders: > If you have a statement like: > > result= a || b || c > > does Haskell guarantee that a gets evaluated before b? Indeed it does, for see the standard Prelude definition of (||): True || _ = True False || x = x Hope that helps. Slainte, Alex.