On Sat, Aug 19, 2006 at 09:21:34AM +0100, Brian Hulley wrote:
Therefore I think the desugaring would need to take place in the compiler
so the compiler could avoid exporting the compiler-generated instances when
the fields are not present in the module export list.
I'm not entirely sure I
On Sun, Jun 04, 2006 at 11:21:23AM +0200, Niels Van Och wrote:
[snip]
Now, in a week I have to present this work formally, and I'm a bit
stumped as to how I'm going to do this. I've got about 15-20 minutes,
so I can only discuss the major features. Right now I'm thinking about:
- Short
Hello,
I am using the haskell-src bundle to implement a preprocessor for some
syntactic extensions to haskell. This is all fine and well, but I find
myself also wanting the preprocessor to let through some already existing
extensions, namely:
* implicit parameters
* pattern guards
*
Hi all. I am porting to Haskell a small zlib-based library for .zip files (I
have not seen any released package for it, although it should very useful). The
matters come when I try to address exceptional conditions: all the library
functions return a integer code with OK/SOMEERROR meaning.
Jacinta wrote:
Firstly, I am trying to generate random numbers in Haskell, but although I
have found a 'random' library on www.zvon.org, I don't really know how to
include library functions, and the documentation given doesn't really tell
me the effective difference between all the functions
I want to sequence data structures in an efficient manner, to store them
to files and to send them over the network.
Ideally, I want to be able to write an infinite data structure (at least
one containing loops). If that is not possible I want to be able to read
as lazily as possible, this
Hi,
Alistair writes:
This interface looks pretty similar to the interfacein Hugs The module is
hugs98/libraries/Hugs/Internals.hs:
Yes. You may recall that I had something even closer to the Hugs interface
previously which I called GhcInternals. I modelled that on what Hugs
provides.
I even
Hi all,
I've been following this discussion with some interest.
Last time I looked, hugs, ghc and nhc98 all implemented
I/O differently. No doubt there are even more
alternatives in other Haskell implementations (real or imaginary).
In itself this is probably not too surprising. They are,
I did not mean to include functions that take type constructors as
parameters (so lists are out of my discussion scope). I am only considering
functions that uses type variables that are not restricted by typeclasses.
There is const:
const :: a - b - a
const x _ = x
And of course a
Does this make the use of Monads doubtful? I mean it doesn't seem easy to
have a completely pure language, and the time one starts introducing few
impurities one also starts thinking why not include many others?
I suggest that you read this paper:
A semantics for imprecise exceptions,
Hi,
For the reason that I'm lazy and don't want to have to modify all my functions
which use afact, or call functions which use afact, and don't see why I should
have to -- they were able to call the 'fact' function as a global, and can
refer to a global 'afact' if I define it outside of main
konst writes:
my question is, if i have an expression such as ((Const False) ::
subexp), will subexp be reduced first (according to the definition
'simplify (x :: y) = simplify' ((simplify x) :: (simplify y))') or
will laziness do the right thing, and emit (Const False) without looking
into
Oops,
Thanks to Kevin who pointed out:
when :: (Monad m) = Bool - m () - m ()
when p s = if p then s else return ()
unless :: (Monad m) = Bool - m () - m ()
unless p s= when (not p) s
So now I tend to use:
doIf :: Monad a = Bool - [a b] - a ()
If any of you antipodeans feel like sharing tales of Haskellisation, I can
guarantee you an eager audience of at least 1.
Cheers,
--Ham
Hi folks,
What follows is just my own view of the situation, other people from this department
may think differently:
At Melbourne we moved from Miranda
Lyndon While writes:
So how about it? Can anyone beat 298 for a Haskell programming unit?
For the record, I teach more advanced aspects of FP to (this year) 38
students, too.
Sorry Lyndon, we (melbourne uni) had 767 students sit our first year
subject which teaches Haskell. We teach it
15 matches
Mail list logo
