a = a - IO ()
printInferedType x = print (typeOf x)
main = do
printInferedType ()
printInferedType foo
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
with a similar formal
treatment of the module system for haskell' in the specification itself.
describing the result of import/export statements as the minimal
fixpoint of a set of equations is delightfully concise and
straightforward.
--
John Meacham - ⑆repetae.net⑆john
primitives to be implementable in haskell _or_ C transparently
and efficiently. It should not matter how the primitives are
implemented.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
several tools that can use the meta-info, jhc,
cabal, franchise, hackage (for the web site layout) so it seems like
abstracting it from the build info would be a useful step in the right
direction.
John
--
John Meacham - ⑆repetae.net⑆john
independently, the other depends on the specific build
system/configuration manager used.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo
be written in haskell?
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
functionality split among a variety of different
programs so the pieces can be used when appropriate, not as an all or
nothing thing. (bring back hmake! :) ).
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
being fixed, meerly
augmented with various work-arounds.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
On Wed, Aug 27, 2008 at 10:18:59PM +0100, Duncan Coutts wrote:
On Wed, 2008-08-27 at 06:13 -0700, John Meacham wrote:
The problem with the way cabal wants to mix with make/autoconf is that
it is the wrong way round. make is very good at managing pre-processors,
dependency tracking
. To blanketly say certain
constructs are just wrong to the point of disallowing them in the
language, especially when they are common practice at the moment, just
doesn't seem right.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing
with IO code. But being able to formalize it completely
independently of the IO monad and all the IO monad entails is an
enticing posibility.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
substitutions you like, but
_keep_ the original binding for x. let the simplifier/optimizer
recognize when bindings are dead and remove them. It can do so simply by
keeping track of free variables in the subterms, which is also useful
for things like let floating transformations.
John
--
John
to iPhone as well.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Wed, Aug 27, 2008 at 12:17:46PM -0500, Derek Elkins wrote:
On Wed, 2008-08-27 at 02:35 -0700, John Meacham wrote:
However, note the weasel words. Those are in there on purpose, every
design calls for different solutions. To blanketly say certain
constructs are just wrong to the point
features) then jhc's output is pure,
portable (in practice), C.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
for a
task without sacrificing performance, aethetics, or correctness, it is a
good day.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, Aug 26, 2008 at 04:31:33PM -0700, John Meacham wrote:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.8816
Doh! wrong paper.
http://portal.acm.org/citation.cfm?id=581690.581692
anyone have a free link?
John
--
John Meacham - ⑆repetae.net⑆john
formal definition
of when ACIO actions are valid without having to invoke the more
complicated IO monad.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
the old model to begin with.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
connection oriented infospherespace'
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
clear enough if ACIO is well defined which I
think it is.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
clear enough if ACIO is well defined which I
think it is.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, it is hard to see what this will
gain over a manual FFI wrapper.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, if not code)) just ignore the windows and treat the architecture
as having a flat 32 register file.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
, if not code)) just ignore the windows and treat the architecture
as having a flat 32 register file.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
data))
frisbys static analysis realizes that (irrefutable // ... ) and ( ... //
irrefutable) are irrefutable.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
'.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
it uses
the one token lookahead trick to determine which branch to take on
alternation, but I don't think that solves the issue with parsing the
entire file..
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
a hierarchy of modules.
I wonder if this is the root of your issue, OO concepts don't map
directly to haskell concepts a lot of the time. You may end up with some
very atypical haskell code if you try to copy OO designs directly.
John
--
John Meacham - ⑆repetae.net⑆john
get standardized.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
Just a random note. jhc works fine on ARM, I have successfully run
Haskell programs on on iPhone and a nokia n800 tablet compiled with it.
jhc is, of course, still pretty unstable. but new developers are always
welcome.
John
--
John Meacham - ⑆repetae.net⑆john
create helper functions like
v3 = Vector3
so you can do (v3 1 2 3 + v3 4 5 6)
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
on the environment. The
various rounding funcitons are particularly ugly IMHO. I added varients
of them that preserved the floating point type and properly implemented
IEEE behavior for jhc.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell
On Mon, Jun 16, 2008 at 05:39:39PM -0700, Don Stewart wrote:
It's a bug in the H98 report then:
Yes, I consider a whole lot of the floating point stuff in the report a
bug of sorts IMHO :) It is certainly something that I hope to work on for
Haskell'.
John
--
John Meacham
the scenes so there is a lot more stuff
to cause conflicts.
A graph reduction machine in C is fairly easy and only needs to be done
once, but one size doesn't fit all and starting from scratch can be much
easier than trying to shoehorn another back end onto your code.
John
--
John
I use a trick like this to allow saving of dynamics into ho files for
jhc, the same thing will work for network connections.
see Info.Info for the data type, and Info.Binary for the binary
serialization routines.
http://repetae.net/dw/darcsweb.cgi?r=jhc;a=tree;f=/Info
John
--
John
an instance, and it
wouldn't make explicit the fact that the instances of all modules it
depends on are also exported.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
'class alias expansion' is there
to make that distinction clear and unambigous, the expansion is what you
declare with an instance, the context is a prerequisite for creating an
instance.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell
to write a
compiler that seamlessly allows mixing code from the two without
compromising the design of either.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman
not sure of the value of
specifying the extension in terms of it. It of course doesn't mean
compilers have to perform the fixpoint iteration, it is just a
declarative statement of what class aliases are equivalent to.
John
--
John Meacham - ⑆repetae.net⑆john
an instance, and it
wouldn't make explicit the fact that the instances of all modules it
depends on are also exported.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman
the alternate syntax
class alias Eq a = Num a = (Additive a, Multiplicative a) where
The correct reading being:
if 'Eq a' then 'Num a' is an alias for (Additive a,Multiplicative a)
I think I am coming around to his point of view, do you think this makes
it clearer?
John
--
John
manually as above is indistinguishable from declaring instances via the
alias in all ways.
Hopefully the generalization to arbitrary numbers of classes is clear...
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell
On Thu, Apr 24, 2008 at 10:21:03PM +0200, Wolfgang Jeltsch wrote:
Am Donnerstag, 24. April 2008 21:27 schrieb John Meacham:
On Thu, Apr 24, 2008 at 08:48:15PM +0200, Wolfgang Jeltsch wrote:
[…]
I also have some remark: Why not write
class Eq a = Num a = (Additive a, Multiplicative
to $!. We should introduce $$! then.
I don't think either of these are necessary and eat up valuable
operator-space.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org
.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
it. Maybe this
one is not bad, because it has people interested in Haskell
innovation, regardless of whether it's a live Haskell' candidate?
Sounds good to me.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell
for compare or = to
compare the full lists before returning the head.
In addition, you need special min and max functions to implement IEEE
floating point properly. Of course, floating point is odd in general,
but we should be correct when we can.
John
--
John Meacham - ⑆repetae.net⑆john
for compare or = to
compare the full lists before returning the head.
In addition, you need special min and max functions to implement IEEE
floating point properly. Of course, floating point is odd in general,
but we should be correct when we can.
John
--
John Meacham - ⑆repetae.net⑆john
a lot more common as
f $ a $ b $ c
would now be written
f . a . b $ c
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
, or an underscore
2. are preceded by whitespace or BOL
is that onerous.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
)
Normalized data types are a good thing. A centralized registry of things
hackage recognizes is fine, but it shouldn't be cluttering up the source
code.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
this, then we can apply the same thing to
the treatment of ~ and regain it as a usable operator.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
in the space of the pointer itself. (even on 32 bit
architecturs, as Char is only 24 bits in jhc)
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/packrat/thesis/ for more
information on packrat parsing and PEGs. I have continued development of
pappy from Bryan Ford's original version and my repo is at [2].
[1] http://repetae.net/computer/frisby/
[2] http://repetae.net/repos/pappy/
John
--
John Meacham - ⑆repetae.net⑆john
Haskell works fine with both the FastCGI and SCGI protocols (There are
libraries floating around for both), I have found them much nicer than
any mod_* web server plugin in general.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe
of a fun project and might come in handy some day.
By efficient, I meant more efficient than the standard lazy number
formulation of
data Num = Succ Num | Zero
not more efficient than strict types, which it very much is not. :)
John
--
John Meacham - ⑆repetae.net⑆john
the
point I am trying to make, but much better.
I implemented this efficient lazy natural class once upon a time. it
even has things like lazy multiplication:
-- Copyright (c) 2007 John Meacham (john at repetae dot net)
--
-- Permission is hereby granted, free of charge, to any person obtaining
On Sun, Apr 06, 2008 at 11:30:20AM -0300, Felipe Lessa wrote:
On Sun, Apr 6, 2008 at 11:12 AM, John Meacham [EMAIL PROTECTED] wrote:
I implemented this efficient lazy natural class once upon a time. it
even has things like lazy multiplication:
[...]
instance Num Nat where
Zero + y
I concur! i use them in quite a few places. If anything, I would like
some more powerful style of quoting, like triple quotes in python.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http
.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
On Fri, Mar 21, 2008 at 11:21:26PM -0500, Galchin Vasili wrote:
In my blah.hsc, I have allocbytes (#const (struct bozo)) .. where
you probably meant allocBytes (#const sizeof(struct bozo))
John
--
John Meacham - ⑆repetae.net⑆john
My current set of tools are
Haskell
/ \
Perl --- C
I often use all three in one project. I think they complement each other
well as they are all relative extremes in their genre.
John
--
John Meacham - ⑆repetae.net⑆john
there is no need to worry about it for the haskell FFI spec.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
quite right.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
.
getargs :: Int - (Ptr CString) - IO [String]
getArgs argc argv = do
let f n = peekElemOff argv n = peekCString
mapM f [0 .. fromIntegral argc - 1]
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe
' as an arbitrary equality
relationship and 'Ord' as a compatible total ordering. It is not even
clear whether structural equality is meaningful for a lot of types, even
though they might have a 'natural' equality relationship.
John
--
John Meacham - ⑆repetae.net⑆john
any extra c headers at all
then, just write out the appropriate c code to call with the conventions
specified in the ffi import specification and you won't need external
headers at all so there isn't anything to conflict with.
John
--
John Meacham - ⑆repetae.net⑆john
and cabal.
I use 'make' to do so. I find it much more straightforward/useful to
have 'make' drive cabal than the other way around in general.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
to write
portable C interfaces so needs to be installed on target systems anyway.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo
, if there were a way to figure that stuff out without a c
compiler in a portable way, that would be cool.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman
and generalized before 'main' was even
processed...
Hmm..
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
is grab a single 'hl' file and
drop it somewhere, but you can optionally re-optimize it specifically
for your platform, (presumably after pulling it down from the web or
hackage or somewhere..)
John
--
John Meacham - ⑆repetae.net⑆john
needed is
inherently in the foreign declaration. If anything, the headers should
just be used as a sanity check, not actually to affect the generated
code. It would be nice if ghc just stopped relying on them and ignored
them altogether.
John
--
John Meacham - ⑆repetae.net⑆john
* get_COLOR_PAIRS (void) {return COLOR_PAIRS;}
hsc2hs is needed anyway for portable C bindings so it isn't too onerous
of a requirement.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
are free to provide extensions. But I'd rather see GHC get
further away from C idiosyncrasies instead of closer.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
accepts it.
Jhc thinks it is illegal according to my reading of the specification.
Any ideas about what is going on here?
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
support will likely be added back at
some point)
I think this is a-okay as far as haskell 98 goes. Assuming latin1
without doing an 'openBinaryFile' is certainly not okay in my book.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow
of the file, in this case
printing the length of each line.
or more succinctly:
main = readFile my.file = mapM_ doMyThing . lines
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
brain :).
John
John Meacham wrote:
On Tue, Feb 05, 2008 at 08:01:07AM -0500, Cale Gibbard wrote:
I also like this idea. Retaining the ability to treat selection as a
function easily is quite important, and this meets that criterion
nicely. Also, in which case does this cause a program
as 'anonymous
labeled data types'. when thought about that way, parenthesis make a lot
more sense.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
On Tue, Jan 15, 2008 at 07:40:03AM +0100, Henning Thielemann wrote:
On Mon, 14 Jan 2008, John Meacham wrote:
On Sun, Jan 13, 2008 at 01:08:49AM +0100, Henning Thielemann wrote:
Is there a fast and reliable way to compute the fraction of a floating
point number?
no, and this has
only one argument is allowed after the #! on the first line. however the
following should be portable if you must set the variable before
runhaskell is executed:
#!/bin/sh
-- /dev/null 21; MYENV=foo runhaskell $_
import System.Environment
main = getEnv MYENV = print
--
John Meacham
floorf x = if r 0 then n - 1 else n
where (n,r) = properFractionf x
the meaning should be clear, they perform the same operation as their
non f counterparts but maintain the same type.
John
--
John Meacham - ⑆repetae.net⑆john
. (this isn't mandated by
the haskell standard though I believe)
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to eliminating and coalescing the
type scrutinizations.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
?
I invoke it with
changequote({{,}})
at the beginning which seems to work well for haskell.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo
. And that
is a-okay by me :) Though, it is certainly a valid and well explored
choice as far as language design goes.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
.
but for the purposes of this it is fine IMHO.
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Fri, Nov 02, 2007 at 01:30:44PM -0700, Greg Fitzgerald wrote:
Anybody know of an ARM back end for any of the Haskell compilers?
jhc can compile to the arm as well. This was tested by compiling a
simple program for the iPhone. :)
John
--
John Meacham - ⑆repetae.net⑆john
of context.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
+ y
all sorts of oddness will result.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
is a masterful work of art.
Did I mention I was a little odd? I am sure I did.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Oct 18, 2007 at 02:31:10AM +0100, PR Stanley wrote:
Do you trust mathematical materials on Wikipedia?
Certainly! I honestly think wikipedia is one of man's greatest
achievements, and it is just in its infancy.
John
--
John Meacham - ⑆repetae.net⑆john
of course. As in, a
natural number type was actually my goal as it is the natural choice
for a lot of operations (hah! pun!), it wasn't a concession.
I found the paper that originally inspired me to write this class:
http://citeseer.ist.psu.edu/45669.html
it is a good read.
John
--
John
301 - 400 of 1117 matches
Mail list logo