Hi,
I have Haskell Platform with GHC[i] 7.4.2 installed on a MacOS system. There's
a problem with the handling of certain Markdown constructs in literate Haskell
(lines starting with '#') that I understand is fixed in 7.6.2.
Therefore, I'd like to be able to update my GHC installation to 7.6
On 09/04/2012 00:45, Joey Hess wrote:
Thomas DuBuisson wrote:
On Sun, Apr 8, 2012 at 4:03 PM, Francesco Mazzoli wrote:
No, it is not possible to build GHC without GHC. Building GHC on ARM is
going to be extremely tricky (I'm not sure anyone has ever done it).
I used to use an unregistered bu
Hi,
I only just noticed this discussion. Essentially, I think you have arrived at
the right conclusion regarding URIs.
For more background, the IRI document makes interesting reading in this context:
http://tools.ietf.org/html/rfc3987; esp. sections 2, 2.1.
The IRI is defined in terms of U
to better
match the current specification.
For those not aware of what Swish actually is, it is an experiment
by Graham Klyne in writing a "Semantic Web" framework in Haskell [3].
I note that the wonderful machinery behind Hackage has already
processed the documentation so you can read
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 y
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 ha
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
http://
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
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 co
d and implemented 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
... But this is just 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
-
>
> _______
> 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/mailman/listinfo/haskell-cafe
nu)
> bg run in background like bashs & feature.
>
> Perhaps even introduce some new syntax ?
> or use ghci or hugs with a preprocessor to translate these commands to
> haskell commands?
>
> What do you think?
>
> Marc Weber
> _
host it
> and change the licence.
> Feel free to ask questions on what it does/doesn't do. You'll probably need
> to, given the documentation ;-)
>
>
> Regardless of it's utility, any criticism or advice on the code would be
> appreciated.
>
> Danie
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
&g
[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 fac
> think that all libraries should be under Library or Libraries root and
> so on. we 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
rly be overwhelmed if page-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://w
;
> even better if you can send a small test case.
Malcolm,
Did 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
tty, due
mainly to the somewhat 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/ma
feel sure this must be a known Haskell idiom for this kind 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
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
--
urtesy of generators), that the code doesn't always look as clean
as its Haskell equivalent. In Haskell, composition and currying are fundamental
patterns and are directly supported by the syntax. In Python, one has to work
harder to achieve these (e.g. the "curry" function above seems
was maybe too ambitious for
the effort contemplated). There is some 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-C
ed at compile time -- if you have in-context expression evaluation then
this wouldn't be a great leap: e.g. scan the code for identifiable expressions
that are expected to be true, and report warnings if they are not.
When I get back to some Haskell coding, I must try out your package. Thanks
ine
things that would really help Haskell development based on this kind 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
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 Klyn
tag/2005Dec/0113.html
http://lists.w3.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-
it in
Haskell. It would be great to see 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
e list is never required all
together. In such cases, I tend to think of the intermediate list or data
structure 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&quo
.)
#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
At 14:38 02/06/05 +0200, Peter Simons wrote:
Graham Klyne writes:
> http://www.ninebynine.org/Software/HaskellUtils/HaXml-1.12/
> This code is all heavily refactored from the original
> HaXml for improved XML entity handling, namespace,
> xml:lang and xml:base support [...].
nd line. I'd prefer a pure function 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/list
l#UseStandardTypes
----
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
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 h
t 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
brary that does some 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 si
al project (http://www.cs.kent.ac.uk/projects/vital/)
is an interesting take (at the level of function rather than specifically
the visual aspects) but (last time I looked) lacks IO capability.)
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
__
n-mathematical programmers, but
there's a lot of potential to build application frameworks that requires a
mathematical 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,
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
ElementInfoset
ElementI ElementInfoset
ContentI ElementInfoset
]]
...
[2] From my version of Text.XML.HaXml.Combinators:
[[
type CTransform i1 i2 = ContentI i1 -> [ContentI i2]
type CFilterI i = CTransform i i
type CFilter = CFilterI ()
]]
Graham Klyne
For
er 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@haskel
etworked
resources will fade 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
y to write spaghetti code.
___
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.o
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/mailman/listinfo/haskell-cafe
e best way of replacing yacc/bison and (f)lex when 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 K
de by
concealing the natural arity of a function.
-Jan-Willem Maessen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
For e
is:
[[
Prelude> :t (.) . (.) . (.)
(.) . (.) . (.) :: forall a a1 b c a2.
(b -> c) -> (a -> a1 -> a2 -> b) -> a -> a1 -> a2 -> c
]]
I think you maybe dropped the digits in the type variable names?
#g
Graham Klyne
For email:
http://www.ni
//www.ninebynine.org/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
----
Gr
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
pattern matching does.
___
Haskell mailing list
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
TF-8? UTF-8 is a sequence of
octets (bytes); what ordering is there here that can sensibly be varied?
#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
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:
At 11:31 24/01/05 -0600, John Goerzen wrote:
On Mon, Jan 24, 2005 at 04:48:49PM +, Graham Klyne wrote:
> At 20:15 21/01/05 +, John Goerzen wrote:
> >I have built a fixed Hugs for the Zaurus PDA running the OpenZaurus
> >distribution. Download here:
> >http://
eciate them.
Thanks,
Mark
___
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 mail
nice code everywhere.
I finally resorted to unsafePerformIO to get it done. But I'd like to
know the proper solution. I do hope that this is not it :-)
Thanks,
John
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailma
g PDA
functions, as a kind of super-calculator. Now I've seen versions mentioned
for two PDAs, but no Palm yet.
#g
--------
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.h
___
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
l.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
larger
the corporation the less likely this is going to happen. But with mind
share I can see smaller corps and smaller IT departments moving over to it.
Jason
_______
Haskell-Cafe mailing list
[EMAIL PROTECTED]
too.
Not a user, but sounds maybe interesting. Can you point to documentation?
#g
----
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
stances, modules, etc. Also data
objects themselves, i. e. precompiled and serialized functions along with
their type information. Data objects do not differ from functions i. e.
they are stored the same way.
Now quoting Graham Klyne
Subject was: [HAskell-Cafe] Mutable and persistent values (was
stuff right first time...
I agree, but... to carry weight in this snake-oiled world, such a claim
needs to be backed by clear evidence.
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROT
of types can be
used to provide global variables.
#g
--
[1] http://haskell.org/hawiki/GlobalMutableState
----
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/m
tion which I don't think would cause too much trouble in practice
to maintain.
This reminds me of recent discussion about multiple flavours of Show. Is
there a pattern here?
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
force.
<<<
(see http://www.cs.chalmers.se/~nordland/ohaskell/rationale.html)
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
nceptExpr:
> instance (Eq cw, Show cw, ConceptWrapper cw c,ConceptExpr c) =>
> ConceptExpr (CW cw c) where
> iConcept i = iConcept i . getConcept
Now declare a pair containing a ConceptExpr to be an instance of
ConceptWrapper:
> type Wrap d c = (c,d)
>
> instance
e about to get ugly, and start again (and the better you
are the less you actually have to implement before you realise things can
be refactored for the better)...
Graham Klyne wrote:
What's my point in all this? I supposed it might be summed up as: "The
best is the enemy of the good&q
(a b)
*** Overlaps with : ConceptExpr AtomicConcept
*** Common instance : ConceptExpr [Char]
Ralf Laemmel wrote:
Instance selection and thereby overlapping resolution
is *independent* of constraints. It is defined to be purely
syntactical in terms of instance heads. See the HList paper
for some w
I'd certainly be interested in doing without global variables, and would
appreciate any advice.
(By the way, I'm using Linux, and so far it looks like HTk is my choice for
the GUI interface.)
Best,
John Velman
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
many undesirables ...
(though I allow the moderator surely knows more about what is thrown at the
list that most of us don't see.)
Just a thought.
#g
--------
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing l
supported by both
Hugs and GHC.
What's my point in all this? I supposed it might be summed up as: "The
best is the enemy of the good".
#g
--
Graham Klyne wrote:
[Switching to Haskell-cafe]
I have used it once, with reservations, but at the time I didn't have the
time/ener
At 21:40 22/11/04 +0100, Ralf Laemmel wrote:
Instance selection and thereby overlapping resolution
is *independent* of constraints. It is defined to be purely
syntactical in terms of instance heads. See the HList paper
for some weird examples.
That explains it. Thanks!
#g
--
Ralf
Graham Klyne
sible to avoid using unsafePerformIO,
but I'd be reluctant to cede it altogether, if only for sometimes
quick-and-dirty pragmatic reasons.
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing li
overlap-conceptexpr.lhs":30 - Overlapping
inst
ances for class "ConceptExpr"
*** This instance : ConceptExpr (a b)
*** Overlaps with : ConceptExpr AtomicConcept
*** Common instance : ConceptExpr [Char]
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
law does hold if
we execute an ST computation using runST, so at least in principle
GHC could perform this optimiziation in such situations.
I think the law holds then, as I think no reference can escape to
concurrent threads,
as if they did their region parameter would become "RealWorld&quo
At 16:07 11/11/04 +, Keith Wansbrough wrote:
Graham Klyne wrote:
> At 12:27 11/11/04 +, Ben Rudiak-Gould wrote:
[..]
> >going to be safe, because it's just not the case that
> >
> >x = once (newIORef ())
> >y = x
> >
> >has the same inten
ation number.)
#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 12:27 11/11/04 +, Ben Rudiak-Gould wrote:
Graham Klyne wrote:
Wouldn't it be easier to simply define "once" as a common Haskell library
function?
Depends on the type and the expected semantics. As Adrian Hey already
pointed out, (once :: IO a -> IO a) with the obvious
all OSes have process IDs or named semaphores. This discussion has shown
many ways to implement "once", and which is best may depend upon the
underlying OS.
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Has
main problem was complexity: the lookup table was a pig to debug!)
#g
--------
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
brary which you could use.
Keean.
___
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
e tables to be
relatively small.)
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm overlooking?
#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 11:31 08/11/04 -0800, John Meacham wrote:
On Mon, Nov 08, 2004 at 02:20:45PM +, Graham Klyne wrote:
> I just found myself writing a function that looked like this:
>
> > isSubsumedByWith :: TBox c -> c -> c -> Bool
> > isSubsumedByWith
s (or processors) actually perform the reduction steps.
Or am I really overlooking something here?
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
it's not clear to me how it behaves when a key is
inserted that already exists.)
#g
--------
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
albeit one
that returns error when it is applied, and the second will cause an error
to be returned immediately. Am I right? Is this all?
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
indeed, I've no idea
if it's still available, though I'd expect any decent technical library to
have a (maybe dusty) copy somewhere.
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Cafe maili
ermine
difference here).
Does this strike any chords with anyone?
#g
--
[1] http://dl.kr.org/ (Description Logics web page)
[2] http://www.ninebynine.org/Software/HaskellDL/DLExploration.lhs (My
tutorial, work-in-progress - implements "structural subsumption" for a
simple
urns False.
I'm sure someone must have hit this problem before me and found a way
around it.
any suggestions greatly appreciated,
regards,
stijn.
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
I speculate:
1. Python users have already chosen expressivity over efficiency
2. For all that it's a "rapid" development language, and being dynamically
typed, Python doesn't completely abandon discipline in program construction.
#g
Graham Klyne
For email:
k's derivations of State monads.
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskel
ht of having a
type that basically stores a bunch of functions -- an implementation
would simply provide an instance of that type with the functions,
maybe.
That's what I've typically ended up doing in my code.
#g
Graham Klyne
For email:
http:
s on non-mutable objects? (In recent discussions with a colleague who
implements complex systems in Java, he has observed that their systems are
easier to understand and maintain when they elect to use non-mutable objects.)
#g
Graham Klyne
For email:
http
= (map . (flip ($))) a -- definition of .
(flip flist) = map . (flip ($)) -- redundant arg
flist = flip (map . (flip ($))) -- move flip to RHS
#g
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell
afe 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
# for the Hat tracer
Regards,
Malcolm
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell
ll-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
recht
...
The paper contains the full Haskell [5] code of a
free variable tableau theorem prover for predicate
logic, written in `literate programming' style.
]]
#g
--------
Graham Klyne
For email:
http://www.ninebynine.org/#Contact
___
Haskell-Ca
1 - 100 of 243 matches
Mail list logo