On 04-May-2006, Malcolm Wallace [EMAIL PROTECTED] wrote:
Manuel M T Chakravarty [EMAIL PROTECTED] wrote:
This leaves me with the opinion that we should really leave this as
pragma and not make it into FFI syntax. It's a hint to some
implementations and irrelevant to others.
Ah well,
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 23-Jun-2004, Ketil Malde ketil+haskell at ii.uib.no wrote:
Thirdly, profiling seems to be incompatible with the use of ghci; there
doesn't seem to be any easy way to build a workspace so that you can
get stack traces and use ghci in that workspace at the same time.
You can compile
On 23-Jun-2004, Hal Daume III [EMAIL PROTECTED] wrote:
On Wed, 23 Jun 2004, Fergus Henderson wrote:
On 23-Jun-2004, MR K P SCHUPKE [EMAIL PROTECTED] wrote:
This may not be the right answer to the question (which is of
course lets write a debugger) - But I have never used a debugger
\begin{gripe}
Seeing as Haskell is apparently such a popular language these days,
I don't suppose a working debugger would be too much to ask for, would it?
Or even just a decent call stack trace when a program terminates with an exception?
In case you're wondering, yes I have already tried
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
dependencies. So I think
it would not help to use the word interface.
--
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
occurs v (LetRec bindings e) =
any (\(vi,ei)-v==vi || occurs v ei) bindings || occurs v e
occurs v (Var v1) = v == v1
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne | of excellence is a lethal habit
WWW: http
On 08-Dec-2003, Christian Maeder [EMAIL PROTECTED] wrote:
Fergus Henderson wrote:
I think the issue here is that in ghc (with -fglasgow-exts),
the a here refers to the same type variable a in the
top of the instance declaration, which has already been
constained, and cannot be constrained
.
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
the constraint is necessary.
Try renaming the type variable as b in the inner declaration:
the following should work both with and without -fglasgow-exts.
showsl :: Show b = List b - ShowS
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University
.
--
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.
___
Haskell mailing list
.
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
() function,
which takes as input an mpf_t and a precision and produces an mpf_t as output.
--
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
.
instance FooBar Int where ...
instance FooBar String where ...
--
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
in which case I think it would behave exactly the same as mkN.
--
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
, 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
).
GNU C++ used to support it, with the signature extension,
but doesn't anymore (support for that extension was dropped).
Of the vaguely mainstream OOP languages, I think only the dynamically-typed
ones support it.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
on the dynamic type of a value.
--
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
},
publisher ={Springer-Verlag},
isbn = {981-4021-54-7},
editor = {J. Edwards},
}
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne
this information part of the `data' declaration.
In most OO languages inheritence relations need to be specified in the
type definition.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne | of excellence is a lethal habit
WWW: http
-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
a
Mercury version of Myer's algorithm: it's in the directory `samples/diff'.
You might find it easier to translate from Mercury to Haskell than from
C to Haskell. (Then again, you might not ;-)
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University
if stdlib.h
is included, because you are stepping on the implementation's namespace.
Furthermore, the definition there is not standard-conforming C code,
since it dereferences a null pointer.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne
. However, systems which don't have 8-bit
bytes are getting very very rare nowadays -- it might well be reasonable
for Haskell, like Posix, to limit itself to only being implementable
on systems where C's `char' is exactly 8 bits.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known
it:
peek addr = do r - peek (castPtr addr)
return (MPI_Rank r)
Likewise for `poke'.
--
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
to implement.
For the Mercury compiler's .Net back-end, there's a --verifiable
option which controls whether the generated IL code is verifiable or not.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne | of excellence is a lethal
uniqueness polymorphism,
whereas Mercury only supports overloading on uniqueness.
--
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
by the individual
items of the list.
I see no reason to disallow duplicates at the subordinate level if
they are permitted otherwise.
Well, disallowing duplicates here may improve error detection,
catching some unintentional typos and cut-and-paste errors.
--
Fergus Henderson [EMAIL
= ()
-- other things
--
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
= hello world
bar x = foo (undefined :: a)-- ... and used here.
which means that this feature can be used in ways that have the
potential to make programs harder to read.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne
/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
errors earlier,
I think it makes good sense to do so.
--
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
.
The whole idea of letting you omit method definitions for methods with
no default and having calls to such methods be run-time errors is IMHO
exceedingly odd in a supposedly strongly typed language, and IMHO ought
to be reconsidered in the next major revision of Haskell.
--
Fergus Henderson
somewhat dated -- a bit like the
register keyword in C.
This is quite different to the kind of macros that would
allow you to extend the language syntax to support things
like arrow notation or views.
--
Fergus Henderson [EMAIL PROTECTED] | ... it seems to me that 15 years of
The University
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
of
evaluation.
--
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.
___
Haskell mailing
internally
promotes the return type from char to int). I can point you to
the exact line of code in the GNU C front-end if you really want.
I think this is required by traditional KR C code, which does things
like calling such functions without declaring them.
--
Fergus Henderson [EMAIL
On 08-Aug-2001, Fergus Henderson [EMAIL PROTECTED] wrote:
Sigbjorn Finne [EMAIL PROTECTED] wrote:
Julian Seward (Intl Vendor) [EMAIL PROTECTED] writes:
| char fooble ( ... )
| {
| return 'z';
| }
|
| on an x86, 'z' will be returned at the lowest 8 bits
is an instance of Real
instance Real r = Random.Random (WrapReal r) where
...
Then you can use the wrapper type whenever you want to get a random number.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
The University of Melbourne
--
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.
___
Haskell mailing list
On 09-Jul-2001, Alexander V. Voinov [EMAIL PROTECTED] wrote:
Hi All,
Fergus Henderson wrote:
Ah, now I think I understand your problem. You want to `random' to
generate random numbers that span all the possible values of the type
within the range [0, 1], or at least a substantial
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
for someone, perhaps Simon P-J., to keep a list of
issues like this which have been left out of Haskell 98 due to backwards
compatibility concerns, so that they don't get forgotten about when it
comes to time for the next version.)
--
Fergus Henderson [EMAIL PROTECTED] | I have always known
revision
compiler and another classic Haskell 98 implementation.
It's all about trade-offs.
--
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
the file back in?
--
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
part of the program at
compile time.
--
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
-checked at compile time.
However, *definitions of* template functions are only type-checked when they
are instantiated.
--
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
in
March 1998.
--
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 mailing
Haskell compilers
to support multiparameter type classes, not to try to shoehorn things
that don't fit into Haskell 98.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
| of excellence is a lethal habit
WWW: http://www.cs.mu.oz.au
://haskell.org
It was posted to the haskell-cafe list,
and is available from the archives of that list:
http://haskell.org/pipermail/haskell-cafe/2001-February/000331.html.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
, where strict backwards compatibility is not required,
unchecked_index should be introduced as a documented new method for the
Ix class.
--
Fergus Henderson [EMAIL PROTECTED] | I have always known that the pursuit
| of excellence is a lethal habit
WWW: http
is still undesirable, and IMHO should be fixed.
--
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 12-Mar-2001, Julian Seward (Intl Vendor) [EMAIL PROTECTED] wrote:
Does any kind person have an IA64 box, running Linux, on which we could
have an account?
You might want to check out SourceForge: http://ia-64.sourceforge.net/.
--
Fergus Henderson [EMAIL PROTECTED] | "I have a
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
lly I would describe the type constructors introduced by type
synonym declarations as "real", but not "first class".
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pursuit
| of excellence is a lethal habit"
W
.
(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
ation algorithm to the
| level of types. Our implementation also provides a stress test for
| today's advanced type systems--it uses nested types, polymorphic
| recursion, higher-order kinds, and rank-2 polymorphism.
|
| http://www.cs.columbia.edu/~cdo/icfp99.ps
--
Fergus Henderson [E
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
to figure out
what was going on.
But I wondered afterwards whether it might be better for
Hugs to use
x `seq` show x
rather than
show x
when evaluating expressions at the Hugs command-line
(with the default +u option).
--
Fergus Henderson
implementation.
I think there might also be some stuff on types for matrices in Chris
Okasaki's work.
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pursuit
| of excellence is a lethal habit"
WWW: http:/
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
256. There is no requirement that Word8
be physically 8 bits, just that it represents an 8-bit quantity.
Indeed, I think ghc uses this technique, representing Word8 as a full
machine word (e.g. 32 bits for x86, of which the topmost 24 are always
zero).
--
Fergus Henderson [EMAIL PROTECTED] | &q
comprehensions.
--
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.
___
Haske
).
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 |
for such examples, the current implementation of the compiler reports
"sorry, not implemented: constraints may only constrain type variables".)
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pursuit
| of excellence is a le
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
or two on that. I hope you'll forgive the
self-citation, but the only one for which I happen to have a reference
on-hand is this one:
A semantics for imprecise exceptions. Simon Peyton-Jones,
Alastair Reid, Tony Hoare, Simon Marlow, and Fergus Henderson.
Proceedings
.
:- interface.
:- instance enum(t).
:- end_module enum_t.
:- implementation.
:- module enum_t.
:- implementation.
:- instance enum(t) where [ ... ].
:- end_module enum_t.
--
Fergus Henderson [EMAIL PROTECTED] | &q
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
the error at that point of use is likely to make it harder to find the
problem, since it is further away from the place where the error occurred.
So I think allowing union types would most likely lead to *worse*
error messages.
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known t
probably doesn't use that much
of the interface to readline (e.g. there's no support for command-line
completion, except the default file-name completion), so the difference
*might* not matter.
It's certainly worth a try ;-)
Cheers,
Fergus.
--
Fergus Henderson [EMAIL PROTECTED] |
n a single function:
foo = show (read "whatever")
This expression is fundamentally ambiguous unless you somehow
disambiguate what type it is that you are trying to read.
I don't see how first class modules could solve that.
--
Fergus Henderson [EMAIL PROTECTED] |
for implicit
parameter passing.
--
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
for implicit
parameter passing.
--
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
.
--
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 PROTECTED]| -- the last words of T. S. Garp.
___
Haskell mailing l
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
, which can only be browsed on a Windows system
(in fact I think it even has to be W2k, IIRC).
--
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 PROTECTED]| -
ch is like `Monad' except that it has an `Eq a' constraint
on the type variable. Then use `EqMonad' instead of `Monad'.
You can't use the `do' syntax, and you can't reuse the library
routines that work on Monads.
--
Fergus Henderson [EMAIL PROTECTED] | "I have always known that the pu
' as a syntactic function, e.g.
p x y = x + y
or
p x = (+) x
rather than via
p = (+)
then the monomorphism restriction does not apply, and so the type inferred
for `p' will be the correct polymorphic type `Num a = a - a - a'.
--
Fergus Henderson [EMAIL PROTECTED] | "I have a
1 - 100 of 398 matches
Mail list logo
