e
code access and binary installers, see
http://timber-lang.org/
Or simply grab the timberc package at http://hackage.haskell.org/.
*** A dedicated Timber mailing list hosted at haskell.org is now also
available.
*** See link at http://timber-lang.org/ for subscription info.
The Timber Tea
ments. For more info, language documentation, source code
access and binary installers, see
http://timber-lang.org/
Or simply grab the timberc package at http://hackage.haskell.org/.
The Timber Team
through Johan Nordlander
___
Haskell mailing
The MacOS X binaries on the Hugs download page have recently been
updated to comply with 10.2. Just download and reinstall, and you
should be fine.
Unfortunately, I wasn't aware that these new binaries are incompatible
with system versions prior to 10.2. The best thing would of course
h
> At The University of Western Australia, we use Hugs 98 on Macintoshes
> to teach Foundations of Computer Science to approximately 300
> first-year students
> (http://undergraduate.cs.uwa.edu.au/courses/230.123). Currently we
> use Hugs 98 on MacOS 8.6. We're likely to change to MacOS X for 2003,
--
__ __ __ __ ___
_
|| || || || || || ||__ Hugs 98: Based on the Haskell 98
standard
||___|| ||__|| ||__|| __|| Copyright (c) 1994-2001
||---||
On Wednesday, October 10, 2001, at 05:09 PM, Hal Daume III wrote:
> That sounds wonderful! Is it available now? And could it deal with
> A.B.M if M is in /A/B? If not available now, how much longer? :)
>
The new version of Hugs that supports this extension isn't yet
released, but you can e
On Wednesday, October 10, 2001, at 12:29 PM, Hal Daume III wrote:
> So, barring this, I'm curious how other people handle this issue.
>
> I have multiple projects. Call them A, B, C. They are in directories:
> ~/projects/A
> ~/projects/B
> ~/projects/C
> repsectively.
>
> Say I'm creatin
Hi Howard,
As you've probably experienced, compiling Hugs under MacOS X is
failry straightforward, and the current CVS version of Hugs
actually compiles right out of the box. To download a copy, go
to cvs.haskell.org and follow the instructions. The next
official Hugs release (which is slig
Hi Ashley,
Hugs currently restricts the way constrained existential types
may be formed, for entirely internal, technical reasons. We're
currently looking over the implementation to see if it's
possible to lift the restriction without rewriting substantial
parts of the type checker.
-- Joha
Sigbjorn Finne wrote:
>
> Peter Thiemann [EMAIL PROTECTED] writes:
> >
> > I have a little question about the following two modules. Suppose you
> > want to write your own variant of the prelude that redefines a couple
> > of names but leaves all the rest unchanged. The Haskell report says
> > th
ld be sent to [EMAIL PROTECTED]
Send email to [EMAIL PROTECTED] to subscribe to the
hugs-bugs list.
The home page and download site for Hugs is at
http://www.haskell.org/hugs/
Enjoy,
Johan Nordlander
[Hugs maintainer]
___
Haskell mailing list
[E
- Recursive generator syntax.
- Macintosh and Windows binaries.
- Several bug-fixes.
For more information and dowload options, please visit
http://www.cs.chalmers.se/~nordland/ohaskell/
Bug reports and comments should be sent to [EMAIL PROTECTED]
Enjoy,
Johan Nordlander
PS
Please don'
g list. Bug reports should be sent to [EMAIL PROTECTED]
Send email to [EMAIL PROTECTED] to subscribe to the
hugs-bugs list.
The home page and download site for Hugs is at
http://www.haskell.org/hugs/
Enjoy,
Johan Nordlander
PS
Please don't confuse this release with today's concurre
Ashley Yakeley wrote:
>
> At 2001-01-16 14:04, Tom Pledger wrote:
>
> >The subtyping (struct Derived < Base ...) makes the two instances
> >overlap, with 'instance TheValue Derived' being strictly more specific
> >than 'instance TheValue Base'. If the system preferred the less
> >specific one,
Magnus Carlsson wrote:
>
> You can use overloading for the definition of theValue instead:
>
> class TheValue a where theValue :: a -> Maybe Int
>
> instance TheValue Basewhere theValue _ = Nothing
> instance TheValue Derived where theValue x = Just (x.value)
>
... or rather, you wi
Ashley Yakeley wrote:
>
> How do you do OOP-style polymorphic functions in O'Haskell? My first
> attempt looked something like this:
>
> struct Base
>
> struct Derived < Base =
> value :: Int
>
> theValue :: Base -> Maybe Int
> theValue x = Just (x.value) -- problem line
> theValue _ = No
Ashley Yakeley writes:
> At 2000-11-24 02:02, Bernd =?iso-8859-2?Q?Holzm=FCller?= wrote:
>
>> When I got to know Haskell, I was expecting a construct for union types
>> like:
>>
>> data B = ...
>> data C = ...
>> type A = B | C | D -- A accepts values of either B or C or D (cf. the
>> "Either a
Jeffrey Straszhiem <[EMAIL PROTECTED]>:
> I think the FP community as a whole has realized that, while all
> computation can be expressed in a "pure" functional way, not
> everything we want to do with a computer can be so. After all, a web
> server (the example in your paper) does far more than
Although I must have missed the original posting, I felt I'd like to add my
comments to Paul's reply.
"S. Alexander Jacobson" <[EMAIL PROTECTED]> writes:
>> Can someone give a brief comparison of the FRP approach with
>> O'Haskell? Both frameworks seem to revolve around asynchronous
>> interacti
Marcin 'Qrczak' Kowalczyk wrote:
>
> [...]
>
> In general I don't quite like the fact that records are getting more
> anonymous. Magical instances of basic classes? How inelegant.
>
> If I want the record type to have an identity, it will have to be
> wrapped in a newtype, so I must think at the
Adrian Hey writes:
> Hmm, I obviously don't understand what 'referential transparency' means.
> I must say I'm puzzled by statements like this. If the presence of
> mutable variables (and MVars in Concurrent Haskell) preserve referential
> transparency, then why _don't_ we have referential transp
Adrian Hey writes:
> Is referential transparency really such a sacred cow? Sometimes
> side effects are useful IMHO e.g. for IO. (Though the Cleaners regard
> IO as being referentially transparent for technical reasons which I
> don't quite understand.)
>
> I've been looking at Concurrent Haskell
Theo Norvell writes:
>
>On Tue, 5 Oct 1999, Kevin Atkinson wrote:
>
>> In case you have not figured out a couple of months ago I posted the
>> beginnings of a generic container and algorithm collection for
>> Haskell.
>
> This is exactly the sort of thing that OOP tends to be rather bad at.
> How
Alastair Reid wrote:
> [discussion of Dynamic library, etc deleted]
>
> [...]
>
> If Haskell supported extensible datatypes, it would be easy to define a
> hierarchy of exception values. For example, the attached pseudocode
> creates a hierarchy like this:
>
> IOError
> Win32Error
>
>
>Havoc Pennington wrote:
>>
>> On Mon, 27 Sep 1999, Antony Courtney wrote:
>> >
>> > First, it is possible to write applications in Haskell using event loops
>> > and mutable state. Most of the simple toolkit bindings (such as
>> > TclHaskell, which is really a binding to Tk) do this.
>> >
>>
well as the full
distribution (which also includes Yet Another Typed Interface
to Tk) can be found at
http://www.cs.chalmers.se/~nordland/ohaskell/
Feedback, comments, suggestions and bug reports are of course
most welcome!
-- Johan
=======
Apologies - the ftp address in my previous message should read
ftp://ftp.cs.chalmers.se/pub/users/nordland/Hugs
-- Johan Nordlander
capable of running on both
PPC and 68k Macs.
-- Johan Nordlander
28 matches
Mail list logo
