On 18-Aug-2005, Keean Schupke [EMAIL PROTECTED] wrote:
I was wondering if anyone has any comments on my
implementation of unify? For example can the algorithm be simplified
from my nieve attempt? Most importantly is it correct?
type Subst = [(Vname,Term)]
data Term = Func Fname
On 20-Jul-2005, David Barton [EMAIL PROTECTED] wrote:
I can contribute some experience from commercial standardization efforts.
ANSI, IEEE, and ISO standards require re-ballotting every five years,
otherwise the standards lapse. Reballotting may or may not be accompanied
by changes in the
On 31-May-2005, Daniel Fischer [EMAIL PROTECTED] wrote:
Am Freitag, 27. Mai 2005 02:06 schrieb Shiqi Cao:
I tried to port some code from ghc 6.2 to ghc 6.4, but I got the
following error
PrelExts.lhs:41:25:
Ambiguous occurrence `map'
It could refer to either `GHC.Base.map',
On 29-Oct-2004, Ben Rudiak-Gould [EMAIL PROTECTED] wrote:
Jon Fairbairn wrote:
On 2004-10-29 at 00:03BST Ben Rudiak-Gould wrote:
Not much better, though: in my experience this particular
exception leaves ghci in a very peculiar state, and it's
usually necessary to quit and restart it
On 08-Oct-2004, Andre Pang [EMAIL PROTECTED] wrote:
I believe that Marcin wishes to prove the same point that I want to:
namely, Clean encourages use of strictness by making it easier to use
(via language annotations). At the risk of sounding ignorant and
arrogant, I think the Haskell
On 28-Sep-2004, John Goerzen [EMAIL PROTECTED] wrote:
As I'm investigating Haskell, it's occured to me that most of the
Haskell tutorials out there have omitted something that was quite
prominent in the OCaml material I had read: making functions properly
tail-recursive.
The OCaml compiler
On 10-Sep-2004, Cale Gibbard [EMAIL PROTECTED] wrote:
Just in case it's not what you're referring to,
http://www.haskell.org/ghc/docs/latest/html/libraries/index.html
together with the Haskell report
http://www.haskell.org/onlinereport/
generally does the trick for me.
Occasionally,
On 03-Sep-2004, David Roundy [EMAIL PROTECTED] wrote:
I was wondering if the list diff operator \\ takes advantage of situations
where the list data type is in class Ord, besides being in Eq.
No, it cannot, at least not in the general case.
The interface for \\ says that it only depends on the
On 03-Aug-2004, Evan LaForge [EMAIL PROTECTED] wrote:
In response to the mysterious head exceptions thread, isn't there a way to
compile with profiling and then get the rts to give a traceback on exception?
There is, but it doesn't really work properly, due to
- lazy evaluation
On 22-Jun-2004, Simon Peyton-Jones [EMAIL PROTECTED] wrote:
My own view is that this is fine -- IORefs shouldn't be in your inner
loop, so an extra word in each is no big deal.
I find that attitude rather extraordinary and I do not agree.
For some applications, IORefs may well be a major
.
Note that this class has already been the subject of extensive analysis
of its exception safety, and indeed the only reason that auto_ptr
was introduced in the first place was in an attempt to help guarantee
exception safety!
--
Fergus Henderson [EMAIL PROTECTED] | I have always known
The infamous monomorphism restriction (Haskell Report section 4.5.5)
strikes again.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne | of excellence is a lethal habit
WWW: http://www.cs.mu.oz.au/~fjh | -- the last words of T. S
.
This is a _much_ easier kind of analysis. IMHO it is probably also
much easier than trying to analyze space usage of Haskell programs.
badly written cache-like data structures, etc.
Those can be a problem in any language.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known
, none if there is no recursion between modules).
In other words, GHC doesn't support separate compilation of
Haskell 98 -- it supports separate compilation of a closely related
but distinct language which we can call Haskell 98 + GHC hi-boot files.
--
Fergus Henderson [EMAIL PROTECTED] | I have
of them inlined?
A compiler could do that to improve performance on some architectures,
e.g. by allowing the function to be called via a short jump instruction
rather than a long jump instruction.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University
-of-memory case, anyway -- so most of the
time you'd still need Monads.)
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne | of excellence is a lethal habit
WWW: http://www.cs.mu.oz.au/~fjh | -- the last words of T. S. Garp
;
MR_Word MR_closure_hidden_args[MR_VARIABLE_SIZED];
} MR_Closure;
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne | of excellence is a lethal habit
WWW: http://www.cs.mu.oz.au/~fjh | -- the last words of T
/mailing-lists/mercury-developers/m
ercury-developers.0111/0082.html
[3] http://www.cs.mu.oz.au/research/mercury/mailing-lists/mercury-developers/m
ercury-developers.0111/0097.html.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne
Peyton Jones, Alastair
Reid, Tony Hoare, Simon Marlow, Fergus Henderson. Proc Programming
Languages Design and Implementation (PLDI'99), Atlanta.
... and the main reason why Haskell 98 didn't incorporate this is because,
well, 98 was before 99 ;-).
In other words, it wasn't well understood
of the overloaded name Foo,
the Haskell compiler will infer from the context which is
intended.
--
Fergus Henderson [EMAIL PROTECTED] | ... it seems to me that 15 years of
The University of Melbourne | email is plenty for one lifetime.
WWW: http://www.cs.mu.oz.au/~fjh | -- Prof. Donald E. Knuth
a significant
disincentive to using that syntax.
--
Fergus Henderson [EMAIL PROTECTED] | ... it seems to me that 15 years of
The University of Melbourne | email is plenty for one lifetime.
WWW: http://www.cs.mu.oz.au/~fjh | -- Prof. Donald E. Knuth
companion, but it's not listed there AFAICT.)
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
| of excellence is a lethal habit
WWW: http://www.cs.mu.oz.au/~fjh | -- the last words of T. S. Garp
well.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
| of excellence is a lethal habit
WWW: http://www.cs.mu.oz.au/~fjh | -- the last words of T. S. Garp.
___
Haskell-Cafe
(n:l) = d /= n - b d /= b - n nodiag b (d+1) l
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pursuit
| of excellence is a lethal habit"
WWW: http://www.cs.mu.oz.au/~fjh | -- the last words of
On 21-Feb-2001, Marcin 'Qrczak' Kowalczyk [EMAIL PROTECTED] wrote:
Wed, 21 Feb 2001 12:55:37 +1100, Fergus Henderson [EMAIL PROTECTED] pisze:
The documentation in the Haskell report does not say what
`fromInteger' should do for `Int', but the Hugs behaviour definitely
seems preferable
.
(10) the vast majority of the prelude changes desirable to support
will have to do with the numeric hierarchy
s/numeric hierarchy/class hierarchy/
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pu
is not changed, compilers can at least warn
about that case.
class (Num a, Additive b) = Powerful a b where
(^) :: a - b - a
I don't like the name. Plain `Pow' would be better, IMHO.
Apart from those two points, I quite like this proposal,
at least at first glance.
--
Fergus Henderson
On 11-Feb-2001, Brian Boutel [EMAIL PROTECTED] wrote:
Fergus Henderson wrote:
On 09-Feb-2001, Brian Boutel [EMAIL PROTECTED] wrote:
Patrik Jansson wrote:
The fact that equality can be trivially defined as bottom does not imply
that it should be a superclass of Num, it only
On 08-Feb-2001, Dylan Thurston [EMAIL PROTECTED] wrote:
On Thu, Feb 08, 2001 at 09:41:56PM +1100, Fergus Henderson wrote:
One point that needs to be resolved is the interaction with default methods.
Consider
class foo a where
f :: ...
f
ents anyway, because it is not immediately
visible in the definitions.
Yes. Much better to make it part of the language, so that the compiler
can check it.
(now any method definition
can be omitted even if it has no default!),
Yeah, that one really sucks.
--
Fergus Henderson [EMAIL PROTECTED] |
.
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pursuit
| of excellence is a lethal habit"
WWW: http://www.cs.mu.oz.au/~fjh | -- the last words of T. S. Garp.
___
Haskell-Cafe mailing l
).
That lets you downcast to specific ground types, but it doesn't
let you downcast to a type class constrained type variable.
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pursuit
| of excellence is a lethal habit"
On 30-Jan-2001, Ashley Yakeley [EMAIL PROTECTED] wrote:
At 2001-01-30 02:37, Fergus Henderson wrote:
class BaseClass s where
downcast_to_derived :: s - Maybe Derived
Exactly what I was trying to avoid, since now every base class needs to
know about every derived class. This isn't
Num a) = Maybe Char
*** Expression : get (Any 42)
Main get (Any (42 :: Int))
Nothing
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pursuit
| of excellence is a lethal habit"
WWW: http://www.cs.mu.oz.au/~fjh |
You need to make sure that the files are mounted as binary
rather than as text, or vice versa. Try the cygwin `mount' command.
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pursuit
| of excellence is a lethal h
ke
Sather and Eiffel which have been around for many years, not to
mention Pizza and Generic Java. This has lead C# to copy some of
Java's other flaws, such as the awful array type.
C# has plenty of flaws. Please criticize it for its real flaws,
not the imagined ones.
--
Fergus Henderson [EMAIL PR
found it?
I had a brief look when I saw Ketil's original article and came to the
same conclusion that you did.
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pursuit
WWW: http://www.cs.mu.oz.au/~fjh | of excellence is a lethal habit"
PGP: finger [EMAIL
37 matches
Mail list logo
