he managed to explain very effectively what made Haskell
^^ she
Peace,
Dylan Thurston
signature.asc
Description: Digital signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
linear algebra library recently posted to the
Haskell list.)
Peace,
Dylan Thurston
signature.asc
Description: Digital signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with the Kiselyov-Shan
approach to dependent types? Does it look too bizarre?
http://okmij.org/ftp/Haskell/types.html#Prepose
http://okmij.org/ftp/Haskell/number-parameterized-types.html
Peace,
Dylan Thurston
signature.asc
Description: Digital signature
On Mon, Mar 27, 2006 at 05:02:20AM -0800, John Meacham wrote:
well, in interfaces you are going to end up with some specific class or
another concretely mentioned in your type signatures, which means you
can't interact with code that only knows about the alternate class. like
genericLength
= APL jot
00B0 degree sign
25E6 white bullet
I don't think any other Unicode character should be considered.
(Is this the approved way to send minor updates like this?)
Peace,
Dylan Thurston
signature.asc
Description: Digital signature
On Tue, Jan 03, 2006 at 02:41:40PM -0800, Ashley Yakeley wrote:
David Roundy wrote:
On Mon, Jan 02, 2006 at 04:23:32PM -0800, Ashley Yakeley wrote:
One open question (in my mind) would be whether we'd allow
data Foo = FooInt { foo :: Int } | FooChar { foo :: Char }
In the new system,
On Sun, Jan 01, 2006 at 11:12:31PM +, Joel Reymont wrote:
Simon,
Please see this post for an extended reply:
http://wagerlabs.com/articles/2006/01/01/haskell-vs-erlang-reloaded
Looking at this code, I wonder if there are better ways to express
what you really want using static typing.
On Wed, Jan 04, 2006 at 03:02:29AM +0100, Sebastian Sylvan wrote:
I took a stab at the rev-comp one due to boredom. It's not a space
leak, believe it or not, it's *by design*...
My god, I think someone is consciously trying to sabotage Haskell's
reputation!
Instead of reading input
On Tue, Oct 11, 2005 at 05:25:24PM -0700, [EMAIL PROTECTED] wrote:
First we define the representation of a list as a fold:
newtype FR a = FR (forall ans. (a - ans - ans) - ans - ans)
unFR (FR x) = x
It has a rank-2 type. The defining equations are: if flst is a value
of a type |FR a|,
On Tue, May 17, 2005 at 01:13:17PM +0200, Jens Blanck wrote:
How would I introduce number classes that are extended with plus and
minus infinity? I'd like to have polymorphism over these new classes,
something like a signature
f :: (Real a, Extended a b) = b - b
which clearly
On Fri, Feb 04, 2005 at 03:08:51PM +0100, Henning Thielemann wrote:
On Thu, 3 Feb 2005, Dylan Thurston wrote:
On Fri, Jan 28, 2005 at 08:16:59PM +0100, Henning Thielemann wrote:
O(n)
which should be O(\n - n) (a remark by Simon Thompson in
The Craft
(Resurrecting a somewhat old thread...)
On Fri, Jan 28, 2005 at 08:16:59PM +0100, Henning Thielemann wrote:
On Fri, 28 Jan 2005, Chung-chieh Shan wrote:
But I would hesitate with some of your examples, because they may simply
illustrate that mathematical notation is a language with side
On Wed, Nov 24, 2004 at 01:34:31AM -0800, John Meacham wrote:
Part of my current interest in #2 is that I have been experimenting with
some full-program optimization algorithms which could perhaps give
substantial gains but would pretty much obliterate any uses of the
unsafePerformIO global
On Sat, Nov 20, 2004 at 09:26:08AM -0800, John Velman wrote:
In a recent message to this list (msg15410) Oleg referenced a paper
comparing implicit parameters and implicit configurations with url
http://www.eecs.harvard.edu/~ccshan/prepose/prepose.pdf . I'd like to read
this, (and examine the
On Sat, Nov 20, 2004 at 12:47:58PM +0300, Serge D. Mechveliani wrote:
Is such a function familia to the Haskell users?
foldlWhile :: (a - b - a) - (a - Bool) - a - [b] - a
foldlWhilefp abs =
case
(bs, p a)
of
([],_) - a
On Sat, Nov 20, 2004 at 03:48:23PM +, Jorge Adriano Aires wrote:
On Sat, Nov 20, 2004 at 12:47:58PM +0300, Serge D. Mechveliani wrote:
foldlWhile :: (a - b - a) - (a - Bool) - a - [b] - a
foldlWhilefp abs =
case
(bs, p a)
On Fri, Nov 12, 2004 at 02:15:51PM +0100, Jerzy Karczmarczuk wrote:
First, we don't care about 'real random' numbers, actually there are
problems even with their definition. We need sequences which
*behave* randomly, from the point of view of feasible tests,
spectral/statistical;
On Thu, Nov 04, 2004 at 08:32:52PM +0100, Sven Panne wrote:
It's an old thread, but nothing has really happened yet, so I'd like to
restate and expand the question: What should the behaviour of toRational,
fromRational, and decodeFloat for NaN and +/-Infinity be? Even if the report
is unclear
On Fri, Nov 05, 2004 at 02:53:01PM +, MR K P SCHUPKE wrote:
My guess is because irrationals can't be represented on a discrete computer
Well, call it arbitrary precision floating point then. Having built in
Integer support, it does seem odd only having Float/Double/Rational...
There are
On Thu, Nov 04, 2004 at 08:32:52PM +0100, Sven Panne wrote:
It's an old thread, but nothing has really happened yet, so I'd like to
restate and expand the question: What should the behaviour of toRational,
fromRational, and decodeFloat for NaN and +/-Infinity be? Even if the report
is unclear
On Fri, Nov 05, 2004 at 02:53:01PM +, MR K P SCHUPKE wrote:
My guess is because irrationals can't be represented on a discrete computer
Well, call it arbitrary precision floating point then. Having built in
Integer support, it does seem odd only having Float/Double/Rational...
There are
On Tue, Oct 19, 2004 at 08:08:49PM +0200, Andres Loeh wrote:
Simon Peyton-Jones wrote:
derive( Typeable (T a) )
But that means adding 'derive' as a keyword. Other possibilities:
deriving( Typeable (T a) )
...
Any other ideas?
instance Typeable (T a) deriving
Why
On Mon, Oct 11, 2004 at 09:53:16PM -0400, Scott Turner wrote:
Evenutally I realized that calculating with lazy lists is not as
smooth as you might expect. For example, the square root of 2 has a
simple representation as a lazy continued fraction, but if you
multiply the square root of 2 by
On Mon, Sep 20, 2004 at 01:11:34PM +0300, Einar Karttunen wrote:
Size
Handling large amounts of text as haskell strings is currently not
possible as the representation (list of chars) is very inefficient.
You know about the PackedString functions, right?
On Tue, Jul 13, 2004 at 05:01:32PM +0800, Dylan Thurston wrote:
This library will let you use a shift instead of a division,
but won't give you a constant time size function for Integers.
You can easily get a logarithmic time size function from the shift.
But did you see Data.Bits.bitsize
The '-fno-implicit-prelude' flag uses the locally in scope fromInteger
function for integer literals, but oddly always uses the global
Prelude's fromRational function.
Peace,
Dylan
signature.asc
Description: Digital signature
___
On Mon, Jul 05, 2004 at 10:08:04AM +0100, Edmund GRIMLEY EVANS wrote:
Does Haskell provide any means of determining the number of binary
digits in an Integer other than by repeated division?
See the Data.Bits library:
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data.Bits.html
On Wed, Jun 30, 2004 at 03:07:00PM -0700, Greg Buchholz wrote:
-- Inspired from Mr. Howard Oakley. Might not qualify as good,
-- but with this function I get log10(x)=849.114419903382
...
For those who aren't aware: working with logs base 2 internally will
be very much faster than logs base
This looks very interesting! I sometimes wish Haskell had more powerful
binding facilities, so that things like this don't need to be extensions
to the language. (But I'm not sure exactly what I'm wishing for...)
On Sat, May 15, 2004 at 12:08:53PM +, Niklas Broberg wrote:
Introducing
On Sat, May 15, 2004 at 04:42:03PM +, Niklas Broberg wrote:
In non-linear context, the
type is a list of what it would otherwise be, regardless of what and how
many enclosing non-linear regular pattern operators.
So I guess that in
foo [/ a? 2 b /] = (a,b)
the type of a is
On Wed, Apr 14, 2004 at 09:37:02AM +0100, Simon Marlow wrote:
...
That symbol looks suspiciously like it comes from the separate OpenGL
parts of WX, which reside in a separate library
(/usr/lib/libwx_gtk_gl-2.4.so here). On my system, libwxc has an
explicit dependency on libwx_gtk_gl, because
On Tue, Apr 13, 2004 at 03:53:31PM +0100, Simon Marlow wrote:
I tried stripping /usr/lib/libwx_gtk-2.4.so.0.1.1 and libwxc-0.6.so, and
GHCi was still able to load the wx package successfully. In fact,
libwx_gtk appeared to be already stripped.
What error messages do you get, specifically?
On Fri, Apr 02, 2004 at 01:59:08PM +0100, Simon Marlow wrote:
Very strange. Is /usr/lib/libdl.so perhaps a symlink to a library that
doesn't exist? That could happen if an upgrade had gone wrong, perhaps.
Thanks, it was a dangling symlink due to my filesystem layout. Sorry
for the stupidity.
On Sat, Apr 03, 2004 at 01:35:44PM +0200, Henning Thielemann wrote:
(I like to omit -fallow-undecidable-instances
before knowing what it means)
There's a nice section in the GHC user's manual on it. I can't add
anything to that.
-- a classical linear space
class VectorSpace v a
On Thu, Apr 01, 2004 at 10:00:23AM +0100, Simon Marlow wrote:
Has anyone succeeded in getting wxhaskell to work under ghci on Linux?
On my system, I get an error message
Loading package unix ... ghc-6.2: can't load .so/.DLL for: dl
(libdl.so: cannot open shared object file: No such
Has anyone succeeded in getting wxhaskell to work under ghci on Linux?
On my system, I get an error message
Loading package unix ... ghc-6.2: can't load .so/.DLL for: dl (libdl.so: cannot open
shared object file: No such file or directory)
This sounds like it has nothing to do with wxhaskell,
On Mon, Mar 29, 2004 at 06:00:57PM +0200, Henning Thielemann wrote:
Thus I setup a type constructor VectorSpace
in the following way:
module VectorSpace
where
class VectorSpace v where
zero :: v a
add :: v a - v a - v a
scale :: a - v a - v a
I haven't added
Another comment is that it looks too complicated. Your basic
Collection class has 30 members, and some of them are clearly
excessive: do you really need all of has, elem, (#), not_elem, and
(/#) in the class (rather than defined as auxiliary functions,
possibly optimised with fusion)?
(Of
(Reviving an old message here. You can see the original message at
http://www.stud.tu-ilmenau.de/~robertw/haskell/doc/contract_notations.lhs
)
On Tue, Feb 17, 2004 at 10:50:30AM +0100, Robert Will wrote:
4. A notation for preconditions. ...
Presently I use the following coding style:
It looks interesting and I'm still looking at it, although I think
many of the language extensions need to be better thought out. But it
exhibits the creeping Eq problem: your hierarchy starts
class (Eq (coll a), Eq a)
= Collection coll a
where ...
If this is to replace lists, this is
On Fri, Jan 30, 2004 at 09:21:58AM -0700, [EMAIL PROTECTED] wrote:
Hi,
I'm writing a game in Haskell. The game state includes a lot of closures.
For example, if a game object wants to trigger an event at a particular
time, it adds a function (WorldState - WorldState) to a queue.
On Mon, Jul 28, 2003 at 03:42:11PM +0200, Konrad Hinsen wrote:
On Friday 25 July 2003 21:48, Dylan Thurston wrote:
Another approach is to make Universe a multi-parameter type class:
class (RealFrac a, Floating a) = Universe u a | u - a where
distanceVector :: u - Vector a - Vector
On Mon, Jul 28, 2003 at 11:59:48AM +1000, Andrew J Bromage wrote:
G'day all.
On Fri, Jul 25, 2003 at 03:48:15PM -0400, Dylan Thurston wrote:
Another approach is to make Universe a multi-parameter type class:
class (RealFrac a, Floating a) = Universe u a | u - a where
On Fri, Jul 25, 2003 at 08:31:26AM -0700, Hal Daume wrote:
However, once we fix this, we can see the real problem. Your Universe
class has a method, distanceVector, of type:
| distanceVector :: Universe u, Floating a = u - Vector a - Vector a
- Vector a
And here's the problem. When 'u'
On Mon, Jul 21, 2003 at 06:21:33AM -0700, Ashley Yakeley wrote:
Well I don't doubt this would be a very useful extension to the Haskell
language: indeed it would eliminate code in all my Haskell projects. But
before we can propose this, we have to work out what the syntax would
look like.
On Fri, Jul 18, 2003 at 11:39:48AM +1000, Andrew J Bromage wrote:
Someone mentioned multiplying by a scalar. I think this is a
good application, but what we need is to agree (somehow) on
the symbol used. I've used (*.) and (.*), with the dot being
on the side the scalar is on (on the
On Sat, Jul 19, 2003 at 02:06:44PM +1000, Andrew J Bromage wrote:
G'day all.
On Fri, Jul 18, 2003 at 04:08:25AM -0400, Dylan Thurston wrote:
What's wrong with that solution?
Working with these operators, I would spend a significant amount of
time getting the '' and '' notations right
On Tue, Jul 15, 2003 at 01:07:12AM -0700, Ashley Yakeley wrote:
In article [EMAIL PROTECTED],
Marcin 'Qrczak' Kowalczyk [EMAIL PROTECTED] wrote:
It doesn't provide instances of Num for anything which is already an instance
of the other classes. And in Haskell 98 they must be defined
On Fri, Jul 11, 2003 at 05:38:18PM +1000, Andrew J Bromage wrote:
G'day all.
On Thu, Jul 10, 2003 at 11:16:56PM -0700, Ashley Yakeley wrote:
As written, this is _not_ a good idea. Trust me, you end up having to
put type annotations everywhere. Even (3 + 4 :: Integer) is ambiguous,
On Thu, Jul 10, 2003 at 02:33:25PM +0100, Ross Paterson wrote:
Subclasses in Haskell cover a range of relationships, including this
sense where things in the subclass automatically belong to the superclass.
Other examples include Eq = Ord and Functor vs Monad. In such cases it
would be handy
On Thu, Jun 19, 2003 at 11:08:35AM -0500, Ed Komp wrote:
| type BaseType = Either Integer ( Either Bool () )
|
| type Value = (Either Double BaseType)
|
| data Foo = forall x. (SubType x BaseType) = MkFoo x
|
| test :: Foo - Value
| test (MkFoo x) = inj x
'x' is the
On Sat, Jun 07, 2003 at 08:24:41PM -0500, Stecher, Jack wrote:
It sounds like you're on the right track...
You could get a moderately more efficient implementation by keeping
the active list as a heap rather than a list.
I had thought about that, and took the BinomialHeap.hs file from
On Wed, Jun 04, 2003 at 01:21:00PM +0100, Graham Klyne wrote:
There is a recurring difficulty I'm having using multiparameter classes.
Most recently, I have a class Rule:
[[
class (Expression ex, Eq (rl ex)) = Rule rl ex where
...
]]
Which I wish to instantiate for a type GraphClosure
On Thu, Jun 05, 2003 at 08:09:02AM -0500, Stecher, Jack wrote:
I have an exceedingly simple problem to address, and am wondering if
there are relatively straightforward ways to improve the efficiency
of my solution.
Was there actually a problem with the efficiency of your first code?
The
_ = True
? (The pattern matching doesn't work quite the same way, but you can
use guards to acheive the same effect, especially with ghc's pattern
guards extension.)
Best,
Dylan Thurston
pgp0.pgp
Description: PGP signature
[a]) (Tree [a])
in which the variable 'a' is used recursively at a different type.)
Best,
Dylan Thurston
msg12142/pgp0.pgp
Description: PGP signature
.
Best,
Dylan Thurston
msg12043/pgp0.pgp
Description: PGP signature
beautiful stuff.
Part of my motivation for revising the numeric parts of the Prelude was
to make it possible to implement all this elegantly in Haskell.
--Dylan Thurston
msg02082/pgp0.pgp
Description: PGP signature
On Sat, Sep 21, 2002 at 12:56:13PM -0700, Russell O'Connor wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
[To: [EMAIL PROTECTED]]
Is there a nicer way of writing the following sort of code?
case (number g) of
Just n - Just (show n)
Nothing -
case (fraction g) of
Just n
On Thu, Sep 19, 2002 at 02:36:01PM +0100, Simon Peyton-Jones wrote:
The copyright notice is, I believe, agreed with CUP, but I must check
that. The online versions will remain available.
Will the online version be available with the current copyright, or
will it only be available with the
On Mon, Sep 02, 2002 at 03:11:58AM -0700, Ashley Yakeley wrote:
At 2002-09-02 02:46, Jerzy Karczmarczuk wrote:
class Module v s | v-s .
...
instance Num s = Module (v-s) s
...
instance ...= Module ((v-s)-(v-s)) s
...
But GHCi yells that two instances in view of the functional
) of the GHC user's manual.
--Dylan Thurston
msg11412/pgp0.pgp
Description: PGP signature
On Sun, Aug 18, 2002 at 06:32:27PM +0200, [EMAIL PROTECTED] wrote:
Hi all.
I'm new to this mailing list. (and still a relative newbie in Haskell -
learning GraphicsLib)
Because the Wish List did not work (maybe it is my browsers fault), I now
write it to this list.
I found the zipWithN
in constant space. I guess
strictness analysis (which knows how to evaluate the foldl) only
happens at -O2 or above?
Best,
Dylan Thurston
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
On Mon, Aug 19, 2002 at 11:34:48PM +0100, Alastair Reid wrote:
main = print $ sum [0..100]
...
Hugs uses foldl' instead of foldl to define sum:...
Does it really? That's a violation of the standard: a user's instance
of (+) need not be strict in its left argument. Consider
data Foo
On Thu, Aug 01, 2002 at 02:34:00PM -0700, Hal Daume III wrote:
...
Now, I want in my executable my user to be able to say -model=0 and so
on in the command line and for it to use the appropriate model. Each of
these models will go in a separate module.
One way to do this would be to
On Tue, Jul 16, 2002 at 04:02:44PM +1000, Bernard James POPE wrote:
I would like to use do-notation in the transformed program, but have it
refer to Prelude.Monad and not MyPrelude.Monad which is also in scope.
Why do you have a MyPrelude.Monad (different from Prelude.Monad) if
you don't want
On Sat, Jul 13, 2002 at 07:58:19PM +1000, Bernard James POPE wrote:
...
I'm fond of the idea proposed by Marcin 'Qrczak' Kowalczyk:
May I propose an alternative way of specifying an alternative Prelude?
Instead of having a command line switch, let's say that 3 always means
On Fri, Jun 28, 2002 at 03:54:50PM -0400, Dylan Thurston wrote:
On Fri, Jun 28, 2002 at 10:24:13AM +0100, Malcolm Wallace wrote:
Yes,-5`div`2 == -(5`div`2) == -2
but (-5)`div`2 == -3
Ghc 5.02.2 has the infix priority wrong, and interprets the former as the latter.
But more
On Sat, Jun 29, 2002 at 12:23:27PM -0400, Dylan Thurston wrote:
After a looking a little more, there seem to be other problems
(including errors in my proposed solution). I don't know where the
code for quotRem is, but it is also buggy. For instance,
Prelude 9 `quotRem` (-5)
(-1,4
.
Loading package std ... linking ... done.
Prelude -1796254192 `div` 357566600
5
Prelude
Has this been fixed already? I checked, and the gmp library itself
(Debian version 4.0.1-3) does not have this problem.
Best,
Dylan Thurston
msg04894/pgp0.pgp
Description: PGP signature
a horizontal distance of $1/9$ inch or approximately
$2.82$ mm.
This contradicts the table that immediately follows, in which it is
evident that a unit of '1' is one printer's point, 1/72.27 of an inch;
the Postscript points are called 'bp'. Which is correct?
Best,
Dylan Thurston
to laziness issues; your
approach seems like a promising way to avoid that.
Best,
Dylan Thurston
msg10904/pgp0.pgp
Description: PGP signature
to implement it.
--Dylan Thurston
msg03485/pgp0.pgp
Description: PGP signature
On Tue, May 14, 2002 at 03:45:36PM +0100, Robert Ennals wrote:
Just thought I would jump in and say that, unlike (it seems)
everyone else, I hate printf in C. It is a horrible horrible
inextensible hack of a function that I find extremely awkward to
use.
...
I personally much prefer the
On Tue, May 14, 2002 at 04:57:12PM +0200, George Russell wrote:
According to the report
Instances of Monad should satisfy the following laws:
return a = k = k
m = return= m
m = (\x - k x = h) = (m = k) = h
so neither IO nor my events satisfy this. Up to
to implement it.
--Dylan Thurston
msg01674/pgp0.pgp
Description: PGP signature
(s-t+1).
scm(n) = (n `rem` (s-t+1)) + s
Warning: some, broken, random number generators do not behave well
when used like this. Also, although this is as uniform as possible,
there is a systematic skew towards the lower end of the range [s..t].
--Dylan Thurston
msg01661/pgp0.pgp
representation?
--Dylan Thurston
msg10624/pgp0.pgp
Description: PGP signature
are typically prohibited
from taking advantage of such laws, and why the translation from the
'do' notation should be the obvious one (using '').
Best,
Dylan Thurston
msg10610/pgp0.pgp
Description: PGP signature
elements yields an
exception.)
It seems to me this is a problem with providing code as specification:
you probably fix the details more than you want.
Best,
Dylan Thurston
msg01575/pgp0.pgp
Description: PGP signature
debian user should just be able to say apt-get install
ghc5 to get the latest package from the nearest mirror...
Better:
http://packages.debian.org/testing/devel/ghc5.html
http://packages.debian.org/unstable/devel/ghc5.html
--Dylan Thurston
msg03123/pgp0.pgp
Description: PGP signature
On Wed, Feb 20, 2002 at 01:15:36PM -0800, Simon Peyton-Jones wrote:
Another possiblity would be to make the ConCls class look like this
class ConCls c where
name :: String
arity :: Int
...etc...
Now we'd have to give an explicit type argument at the call
for a variable, you don't have to figure out how to gather them
together. Can anyone see a way to implement something like this in
Haskell? Or is it better to make a small interpreted language?
Best,
Dylan Thurston
msg10237/pgp0.pgp
Description: PGP signature
On Mon, Feb 04, 2002 at 01:33:54PM -0800, Ashley Yakeley wrote:
At 2002-02-04 01:45, Koen Claessen wrote:
| addBase{?base=7} 5
I like this! It is the least polluting syntax of all.
Hmm... you have braces without following a keyword. I think in all other
cases, braces follow a keyword
situation: I want to interface to C code with several rather large
structures, so plain FFI is not very attractive. I've started using
C-Haskell, but am curious about other people's experiences.)
--Dylan Thurston
msg02917/pgp0.pgp
Description: PGP signature
they are defined (with gcd 0 0 = 0).
As I said, I was surprised; to me, the definiton with all a and b is the
more natural one. I still recommend using the full domain (especially since
exceptions are awkward to deal with in Haskell), but I'm not as certain.
Best,
Dylan Thurston
On Sat, Nov 24, 2001 at 04:52:00PM +0100, Ferenc Wagner wrote:
BTW, I didn't notice import problems. They may be specific to
GHC... I have got 5.02-1 now, I'll check later.
I don't know if it's specific to GHC, but it's definitely a bug in
Functional MetaPost (although probably easy to
(I want to trim the headers, but don't know the history of this
thread. Also cc:ed back to the Haskell list.)
On Thu, Oct 25, 2001 at 11:11:42AM +0200, Ketil Malde wrote:
Dylan Thurston [EMAIL PROTECTED] writes:
I agree that Enum instances for Float/Double are not likely to be
useful
On Wed, Oct 24, 2001 at 07:51:12AM -0700, Simon Peyton-Jones wrote:
The Report is (regrettably) silent about what the Integer
instances for succ and pred should be, but they should definitely simply
add 1 (resp subtract 1). They should emphatically not use the default
methods. I will add
.
(They don't work for floating point numbers because of the special
behaviour near 0.)
Best,
Dylan Thurston
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
their standards; one might wonder what the
purpose is of having unavailable standards. Is the content
available somewhere?
Best,
Dylan Thurston
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Fri, Oct 12, 2001 at 12:39:09PM +0100, Keith Wansbrough wrote:
Dylan writes:
Incidentally, it seems to me that this is one case where a Lisp-like
macro facility might be useful. With Haskell, it is impossible to
play with bindings, while presumably you can do this with good Lisp
need a macro for it in Lisp. Your arrow notation
example may provide some motivation, though.
I wonder if macros could also be used to implement views.
I think there were other times I wanted to play similar tricks with
scoping, but I don't remember right now.
Best,
Dylan Thurston
of implementations is that they support 21 bits.
Best,
Dylan Thurston
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
to compare strings using
a localized order.
Is anyone working on honest support for Unicode, in the form of a real
Unicode library with an interface at the correct level?
Best,
Dylan Thurston
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http
On Wed, Oct 03, 2001 at 11:52:30AM -0400, Jan-Willem Maessen wrote:
Earlier, Simon says:
Indeed, if none of the classes have a method that returns
an a-value without also consuming one (urk-- strictly, I think, sigh)
then the same holds.
Strictness alas matters. Here's the witness:
to introduce
such empty types for phantom-type purposes, so GHC now lets you say
data T
and get a type T with no values.
Ah, excellent! I've frequently wanted to do this.
Best,
Dylan Thurston
___
Haskell mailing list
[EMAIL PROTECTED]
http
'' are each a varid rather than a reservedid. They have
special significance only in the context of an import declaration;
they may also be used as variables.
Best,
Dylan Thurston
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org
logarithmic in
the size of your data, and automatically gives you other benefits,
like persistence.
(That is, you only need to change the nodes when the corresponding
subtree has actually changed, which makes some sense.)
I second Mark Carroll's recommendation for Okasaki's book.
Best,
Dylan
1 - 100 of 146 matches
Mail list logo
