Simon Marlow wrote:
We really need to tune the flags for these benchmarks properly.
Do I sense the hidden hand of Goodharts law? :)
-- http://en.wikipedia.org/wiki/Goodhart's_law
#g
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
/mailman/listinfo/haskell-cafe
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
intuition... What does
computer science tell us about this?
Thank you,
Peter
--
Graham Klyne
Contact info: http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Mark Lentczner wrote:
[*] The Apple guidelines for the /Library and ~/Library files are
here:http://developer.apple.com/mac/library/documentation/MacOSX/Conceptual/BPFileSystem/Articles/LibraryDirectory.html#//apple_ref/doc/uid/20002282-BAJHCHJI
Thanks for the link. I followed through to a
Nice blog post:
http://importantshock.wordpress.com/2009/01/18/jquery-is-a-monad/
#g
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
, and their proposals were recently
published as a Proposed Standard RFC [1]. If this area is being considered
in the design of Haskell libraries, there may be some lessons there to be
copied.
#g
--
[1] ftp://ftp.rfc-editor.org/in-notes/rfc3987.txt
Graham Klyne
For email:
http
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
It's not exactly what you ask for, but I wrote down some of the things I
learned in my early days with Haskell:
http://www.ninebynine.org/Software/Learning-Haskell-Notes.html
#g
--
At 10:31 07/02/05 -0500, Jacques Carette wrote:
The recent post of Graham Klyne (below) reminds me that I have
/Software/HaskellUtils/
I had been meaning to wrap all this into my Swish package
(http://www.ninebynine.org/RDFNotes/Swish/Intro.html), but real work
intervened. I do intend to return to this when I can find an excuse to
make it part of the new day job.
#g
Graham Klyne
For email
.
-Jan-Willem Maessen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell
migrating the
project into Haskell?
Best Wishes,
Johan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
/libraries/network/Network.Socket.html#v%3Arecv
Still, 2002 was awhile back, so I'm still surprised nobody else noticed.
-- John
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham
.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
away (other than for practical purposes, as today with
specific networked file systems), and URIs are an effective and
standardized way to identify all kinds of resources.
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
if there's any other project or activity in this area I should be
aware of?
#g
--
[1] http://losser.st-lab.cs.uu.nl/mod_haskell/
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
]
type CFilterI i = CTransform i i
type CFilter = CFilterI ()
]]
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
At 19:42 02/05/05 +0200, [EMAIL PROTECTED] wrote:
Please,can anyone explain it to me?
Cheers!
This may be a bit late, and others have responded, but just in case it
helps you might peek at:
http://www.ninebynine.org/Software/Learning-Haskell-Notes.html#Sequence
#g
Graham Klyne
kind of abstract and analytical approach, if not specifically
a mathematical background. A challenge that I think a little about,
sometimes, is how to keep them distinct, which is a point to which Alan Kay
seems to be alluding (above).
#g
Graham Klyne
For email:
http
searching, using KMP for example?
[[
import List
foo = isPrefixOf (reverse needle) (reverse haystack with needle)
bar = isPrefixOf (reverse needle) (reverse haystack with pins)
]]
Seems to work. And (by inspection) is linear in size of haystack.
#g
Graham Klyne
For email:
http
and rational strategy.
So I ask myself: are there any good papers or books on this topic that
outline a coherent and principled approach to API design?
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
At 19:39 18/05/05 -0400, [EMAIL PROTECTED] wrote:
G'day all.
Quoting Graham Klyne [EMAIL PROTECTED]:
I think you raise an important point. Reading this, I realize that I have
no principled basis for deciding what makes a good API, in any language.
Me neither. Though I have short reading list
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
which took a Document or a
String and returned the same, processed. I hope I've overlooked
something.
Regards,
Echo Nolan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
.)
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
as describing a traversal sequence or pattern, rather than as a
concrete data value.
I touch briefly on some of these issues in Learning Haskell Notes:
http://www.haskell.org/tmrwiki/LearningHaskellNotes#programming-idioms
#g
Graham Klyne
For email:
http://www.ninebynine.org
a lightweight full stack web application
framework for Haskell: I believe many of the pieces exist, and Haskell could be
a supremely effective language for tying them together.
#g
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell
.org/Archives/Public/www-tag/2005Dec/0115.html
(etc.)
[2] http://web3.w3.org/2001/tag/
http://lists.w3.org/Archives/Public/www-tag/
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe
A colleague alerted me to this, which I thought might be of interest here:
http://www.theserverside.com/news/thread.tss?thread_id=38430
(I have already found that my Haskell experiences have influenced my Python
programming; maybe there's also hope for my Java?)
#g
--
Graham Klyne
of
framework, such as features in quickly inspect intermediate results in complex
programs without visible recompilation, and instrumentation of intermediate
results for creating regression tests, though I don't know how such might be
provided.)
#g
--
Graham Klyne
For email:
http://www.ninebynine.org
related work at the kestrel Institute
[http://www.kestrel.edu/home/projects/]
#g
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
by the syntax. In Python, one has to work
harder to achieve these (e.g. the curry function above seems rather convoluted
to me, for such a fundamental notion).
Thoughts? Comments?
#g
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
Donald Bruce Stewart wrote:
Haskell Weekly News: February 06, 2006
:
Oleg says, The implementation of RSA on the type level is left
for future work.
Methinks this gives a whole new meaning to type security.
:)
#g
--
Graham Klyne
For email:
http
of problem, but I
can't say that I've noticed it anywhere. Or is there a snag I didn't notice?
#g
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
quirky nature of XML syntax, especially concerning
parameter and general entities.
#g
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
you come across the HaXml test harness I created based on a subset of W3C
conformance tests?
http://www.ninebynine.org/Software/HaskellUtils/HaXml-1.12/test/
This covers all the parameter entity problems I fixed some time ago.
#g
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
-renaming were to become
the norm. There are, as you indicate, other technical concerns. But I still
think they are more easily solved that the problems that arise by failing to
maintain URI stability.
Best regards,
#g
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
started with filling up the pages, now we had enough
contents to see what the structure will serve better
Well, yes, better now than later, for sure.
My comments were really directed toward longer term principles.
I think I've said enough for now.
#g
--
Graham Klyne
For email:
http
[Switching to haskell-cafe]
Niklas Broberg wrote:
Ehum, shameless plug. :)
Pretty much what I was fishing for...
On 3/6/06, Graham Klyne [EMAIL PROTECTED] wrote:
Cale Gibbard wrote:
Ah, neat, I knew about WASH, but somehow I'd missed the fact that
there was a server there :)
Interesting
Björn Bringert wrote:
Graham Klyne wrote:
[Switching to haskell-cafe]
Niklas Broberg wrote:
...
On 3/6/06, Graham Klyne [EMAIL PROTECTED] wrote:
- Options to run the whole thing behind Apache to leverage its
security and web
space management capabilities
Lemmih has implemented a HSP
/listinfo/haskell-cafe
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Maybe not helpful to you at this stage, but...
An alternative to generating source code is to factor out the common
boilerplate elements into separate functions, suitably parameterized, and to
use higher order functions to stitch these together.
An example of this kind of approach, which is
Simon Peyton-Jones wrote:
| As membership of the Haskell community is not well-defined, and voting
| would potentially be open to abuse if anyone were able to vote, we
| propose that the committee should choose their replacements from open
| nominations.
I agree with the problem, and I think
by Graham Klyne - g...@ninebynine.org
mailto:g...@ninebynine.org:
1) http://www.ninebynine.org/RDFNotes/Swish/Intro.html
2) http://www.ninebynine.org/Software/swish-0.2.1.html
I am personally very excited about Graham's work and the role of
Haskell in his toolkit!
II.) My role
an accumulating parameter as you'll have to provide the
'initial' value.
I'd just about figured the ShowS idea, but I've yet to get a handle on this
idea of [a] 'monoid'.
#g
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
.
#g
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
the reference -- I think that might do it.)
I'm also harbouring a suspiscion that this FunctorM framework might be
subsumed by gmap and friends, but I'll leave that for another day.
#g
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
the existing fmap definition, but defined a new
function with certain similarities.
#g
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
(like the powerset function itself), is there any cause
for the ++ to actually be evaluated? I suspect not, but can't be sure.
#g
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
___
Haskell
of a set S and an operation *
with the following properties ...
]]
which is a datum I was missing. (I still don't claim to understand it all,
but at least I get a sense of whet the term monoid means.)
#g
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9
://www.ninebynine.org/Links.html#Programming-Haskell
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
be instructive to someone else.
-- Mark
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
/ /
--
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
___
Haskell-Cafe mailing list
, etc...), but that seems a small thing, and I'm
not sure it wouldn't introduce other problems.
#g
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
___
Haskell-Cafe mailing list
[EMAIL PROTECTED
The 'case' is somewhat redundant. How about:
test n | n == one = one
| n == two = two
| otherwise = three
#g
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
___
Haskell-Cafe
**
**
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
classes).
(The above code completely unchecked, but I hope it illustrates an approach.)
#g
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
---
Graham Klyne
[EMAIL PROTECTED]
PGP: 0FAA 69FF C083 000B A2E9 A131 01B9 1C7A DBCA CB5E
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman
testing (using HUnit)
eliminates most requirements for a debugger. When I have problems, I
resort to ad-hoc techniques, sometimes exposing (exporting) the inner
workings of a module for testing/exploration purposes.
#g
Graham Klyne _
[EMAIL PROTECTED
non-comprehension here?
#g
Graham Klyne
[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
OF COMPUTING SERIES, M.I.T. PRESS, 1991
]]
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
(Expr expr) rules
-- Checkout
test1 = typeName datatypeXsdInteger ==
http://www.w3.org/2001/XMLSchema#integer;
test2 = typeName (head $ typeSuper datatypeXsdInteger) == typeName
datatypeXsdInteger
test3 = typeRules datatypeXsdInteger == rulesetXsdInteger
Graham Klyne
[EMAIL
datatype to something I expose. Rather, what I want to do is
expose relationships between (textual) representations of a datatype, while
keeping the actual values used to derive those relationships hidden from view.
Thanks for your input and pointers provided.
#g
Graham Klyne
w)
-- testit --
my_store = update (update (update initial 'a' 4) 'b' 5) 'a' 3)
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
[EMAIL PROTECTED
list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
types might be the appropriate
appoach here.
Instead, I replace the class instances by a single algebraic data type,
whose members are functions corresponding to OO-style class methods.
#g
--
Graham Klyne
[EMAIL PROTECTED]
___
Haskell-Cafe
for Point, Displacement, Length, etc.)
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
At 18:38 14/10/03 -0700, Brandon Michael Moore wrote:
On Mon, 13 Oct 2003, Graham Klyne wrote:
Results in a fairly obvious type error: I'd need to have a way to say that
vbMap is applied to the value under construction. Experience with Java
would
suggest maybe something like
a) = a - a - Maybe a
nextSame3 a a1
| a1 == a = Just a
| otherwise = Nothing
]]
And it does work in the infinite list case.
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL
[] = [[]]
lp (as:ass) = concatMap (\a - (map (a:) (lp ass))) as
]]
I think I should also be able to eliminate the lambda-abstraction, but I
can't see how. I prefer the list comprehension, as I find that easier to
read than the \-expression.
#g
Graham Klyne
For email:
http
Swish software, with links
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
}
]]
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
At 01:14 22/10/03 +0200, Peter Simons wrote:
Graham Klyne writes:
I'm thinking in particular that a function that turned a regular
expression into a Parsec parser function could be useful, as in:
regexp.compile :: String - GenParser Char st [String]
Just curious: Why would you want
goals, though I do like the
purity of your approach (i.e. its focus on the core engine).
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo
than Dfa.
I tackled this as an exercise in writing a lightweight Parsec parser. A
copy is attached.
I do have a sourceforge count (GrahamK), but I'm not familiar with the
procedure for submitting a file. (I do use CVS locally on my network, but
not through SSH.)
#g
Graham Klyne
it. I'd suggest, if only as an
exercise, to do the entire definition using 'data' only (no 'type's) ...
then figure out if you want to eliminate any of the constructors.
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
functional programming pattern that corresponds to
vector space transformations so that a function defined over one space can
be used in another, and
(b) if so, are there any not-too-heavy papers or articles discussing this
pattern?
#g
Graham Klyne
For email:
http://www.ninebynine.org
_ b = b
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
the occasional user, not the full-time expert,
who may be better served by a non-textual approach.
#g
--
At 23:56 12/11/03 +0100, Marcin 'Qrczak' Kowalczyk wrote:
W li¶cie z ¶ro, 12-11-2003, godz. 11:06, Graham Klyne pisze:
I've sometimes thought that a functional language would be the ideal
I have a need for an algorithm to perform subsumption on partially
ordered sets of values. That is, given a selection of values from a
partially ordered set, remove all values from the collection that are less
than some other member of the collection.
Below is some code I have written, which
PLT - add ms e
PEQ - m:ms
If I fold this together with Tom's suggestions, I think the result is much
closer to what I felt I should be getting.
Thanks!
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
At 09:14 18/11/03 +1300, Tom Pledger wrote:
Graham Klyne writes:
:
| Below is some code I have written, which works, but I'm not sure
| that it's especially efficient or elegant. Are there any published
| Haskell libraries that contain something like this?
Hi.
Partially ordered sets
I've taken the suggestions made by Tom and Robert and combined them into a
new module with some supporting functions and test cases. A copy is
attached, in case it's of use to anyone.
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
working.)
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
-- $Id: PartOrderedCollection.hs,v 1.4 2003/11/20 18:35:59 graham Exp $
--
-- Copyright (c) 2003, G. KLYNE. All rights reserved
exists.
Thanks,
Alex
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
At 21:03 27/11/03 -0500, Derek Elkins wrote:
On Thu, 27 Nov 2003 14:56:03 +
Graham Klyne [EMAIL PROTECTED] wrote:
(perhaps a more serious and to the point reply later)
But not all cases I encounter involve lists or monads. A different
case might look like this:
Are you sure this doesn't
-cafe
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
At:
http://www.haskell.org/hawiki/MonadError
I see:
[[
instance Monad (Either e) where
return = Right
(Left e) = _ = e
(Right a) = f = f a
]]
Shouldn't that be:
[[
(Left e) = _ = Left e
]]
?
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
) e1) e1
= \e - h (k (m e) e) e
So both expressions are equivalent, as required.
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
the value
and the remainder of the string, and
(b) the fact that parsing is not, in general, deterministic: at any point
in the process there may be more than one possible way to continue the
parse. Hint: uses a list to return all possible parses.)
HTH.
#g
Graham Klyne
For email
in the standard libraries.
(Thanks, anyway!)
#g
--
At 11:30 14/12/03 +0100, Tomasz Zielonka wrote:
On Fri, Dec 12, 2003 at 08:55:59PM +, Graham Klyne wrote:
At 14:17 12/12/03 -0500, Derek Elkins wrote:
This will also provide a migration path if you want a more featureful
monad. (or_maybe
almost used to looking to the
Control.Monad.foo libraries, I didn't think to check Control.Monad. Oops.
One day, I'll learn to look in all the right places.
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe
the previous Hugs release into this module, and added it to the module
export list.)
#g
--
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo
[switching to Haskell-cafe]
At 19:37 23/12/03 +0100, Tomasz Zielonka wrote:
On Tue, Dec 23, 2003 at 05:26:20PM +, Graham Klyne wrote:
[1] http://www.ninebynine.org/Software/Learning-Haskell-Notes.html
Thanks, that was a nice reading :)
Thanks!
(If by any chance there's anything here
state other than to
increment a counter: as such, I'd have expected a simple recursive
function to serve the purpose. (Maybe there was something in the original
application that was lost in the problem isolation?)
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
1 - 100 of 200 matches
Mail list logo