Simon Peyton-Jones wrote:
> In Haskell,
> case e of { y->b }
> is equivalent to
> let y=e in b
Actually, it's equivalent to
(\ y -> b) e
since the let could be polymorphic.
> That is, case is not strict unless the patterns
> make it so. You may think it's curious but that's
| Are you suggesting that some combination
| of GHC flags will allow us to
| achieve demodulization?
No, it won't. But GHC does actually do a lot
of what you want. There is a lot of tricky stuff
associated with establishing the correct name space,
and GHC does that. You could suck in a Haske
| 1) In Figure 3 (Semantics of Case Expressions, Part 1) clause c reads:
|
| case v of { p | g1 -> e1 ; ...
| | gn -> en where { decls }
| _ -> e' }
|
| = case e' of
| { y -> -- (where y is a completely new variable)
| case v of {
|p
Erlang users and other interested parties are invited to the Sixth EUC
(Erlang/OTP User Conference) which will take place in Älvsjö, Stockholm,
on the 3rd of October. The conference in particular is aimed for
- Applications developers using Erlang and OTP (Open Telecom Platform).
- Researcher
Editor Combinators
==
http://ist.unibw-muenchen.de/EdComb/
Editor combinators allow to assemble structure editors compositionally
instead of generating them from language descriptions,
just as parsing combinators allow to asse
Tue, 20 Jun 2000 17:28:25 -0400 (EDT), Patricia Johann <[EMAIL PROTECTED]>
pisze:
> For our research, it would be helpful to have a "demodulizer" for Haskell
> --- that is, a program that can translate a Haskell program consisting of
> several modules into a single module.
I think an opposite t
Associate Professorships and Assistant Research
Professorships within the Internet Technology Programme
at the IT University of Copenhagen. Deadline: 31 August 2000.
(www.it-c.dk)
Applications are invited for three associate professorships and
assistant research professorships within the Interne
