? They don't seem to
offer it, last I checked.
I'm looking in to doing this with PRGMR, which has pretty good
pricing though it's not nearly as featureful as Linode.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
thing.
It's nice to reflect on the fact that Haskell offers a lot of
flexibility for program transformation but is relatively safe
from the incomprehensibility that results from the use of
monkey patching in Ruby or macros in general.
--
Jason Dusek
Monk and nun?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I believe GMail put the original message in my SPAM folder.
Which is just as well. Let me re-affirm the collective
rejection of this post. Very no!
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
Patched by Antoine S. Latter to interoperate with UUID.
http://hackage.haskell.org/package/system-uuid-1.2.0
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Well, you can, with:
-XTypeSynonymInstances
though I'm not sure it addresses your specific need.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the work is
done by blink_atom() which is called out of the ISR (Interrupt
Service Routine).
Thanks for the example.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
as it is to ensure non-interleaved
execution for safe multi-threading?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Wait, no -- I missed something. As long as the outermost Atom
routine is run every `n' µs by a hardware clock, the counter
(`__global_clock') will contain an accurate count of how many
`n' µs intervals have passed in our application.
--
Jason Dusek
This version of `HPath' depends on new release of
`haskell-src-exts' with improved pretty printing.
http://hackage.haskell.org/package/HPath-0.0.2
No other changes have been made.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe
kit from Lady Ada. I am (gratuitously) exploring ways to
program it with Haskell.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Yes, I just saw that.
http://hackage.haskell.org/package/HPath-0.0.1
It doesn't handle Haskell needing the C preprocessor and
there are some real problems with the output of data/type
definitions -- I hope to resolve these shortly.
--
Jason Dusek
Here is a bug report for the newlines issue:
http://trac.haskell.org/haskell-src-exts/ticket/188
A tentative patch is also included. This is not something I can
really fix within HPath, unfortunately.
--
Jason Dusek
___
Haskell-Cafe mailing
monadic operations.
The `MonadPlus' instance gives you access to `msum'. It's not
just about `do' notation :)
3. The comprehension syntax for Lists in Haskell - can that be
used in anyway for other Monads?
Not anymore, though Gofer used to allow monad
comprehensions.
--
Jason Dusek
more than
monadicity -- you need an algebra for `M' at `t'.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/12/29 Luke Palmer lrpal...@gmail.com:
They are another group, too -- the group with `*':
Group* = (*, 1, 1 / _)
Ignoring 0 for sake of discussion.
Doh.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
HPath in conjunction with
LaTeX macros to allow easy inclusion of Haskell in elaborate
documents.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Thanks; this should be enough for me to get it working again.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Maybe I missed an email about this...
http://www.haskell.org/ghc/docs/latest/html/libraries/ghc/index.html
The link is down.
--
Jason Dusek
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman
to these two projects and if any
docs remain for them.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
A quick check on Hayoo! and in my interpreter shows that
there are basically no instances of `IsString`. Is it
really so little used?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
2009/12/20 Brandon S. Allbery KF8NH allb...@ece.cmu.edu:
On Dec 20, 2009, at 17:09 , Jason Dusek wrote:
A quick check on Hayoo! and in my interpreter shows that
there are basically no instances of `IsString`. Is it
really so little used?
The only 2 instances I'm aware of are String
-include-dirs= and --extra-lib-dirs= to specify where it is.
It takes like a minute to err out, too. This isn't urgent or
anything but it would be nice to know how to get this build
process -- C generation followed by compilation -- to work
again.
--
Jason Dusek
(for Haskell) approach.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Concatenating two `ByteString`s is O(n)?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/12/16 Stephen Tetley stephen.tet...@gmail.com:
2009/12/16 Jason Dusek jason.du...@gmail.com:
What is the relationship between the Parsec API, Applicative
and Alternative? Is the only point of overlap `|`?
Lots of functions in Text.ParserCombinators.Parsec.Combinator can be
defined
with a
Haskell comment, like `-- EOT`. Since your message always
comes wrapped in a list, you could just use the square
brackets to tell you when you're done.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
2009/12/16 Mitar mmi...@gmail.com:
On Wed, Dec 16, 2009 at 11:25 PM, Jason Dusek jason.du...@gmail.com wrote:
Criterion for garbage is that it is not readable with read and that
not because there would be not enough data available. It seems that I
will need to do buffer filling and reading
.
I've done one Haskell contract this year, for legal document
processing. This was a case where the client was definitely
more focused on the solution than the language used and
really cared a lot more about a good CLI and clearly defined
output for each processing step.
--
Jason Dusek
What is the relationship between the Parsec API, Applicative
and Alternative? Is the only point of overlap `|`?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/12/14 Edward Kmett ekm...@gmail.com:
[...] That doesn't mean that I want to subject myself to working
in such a sufficient computing environment :)
Sufficient?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
2009/12/12 Luke Palmer lrpal...@gmail.com:
On Fri, Dec 11, 2009 at 7:07 PM, Jason Dusek jason.du...@gmail.com wrote:
Where do we draw the line between machinery and packages?
The types don't tell us what libraries we need.
...you might mean what *haskell* libraries does a piece of
code
to native code
in a way that trusts it to be pure, I don't see how having a
way to bind to nominally side-effecting Haskell code in a way
that trusts it to be pure adds anything to our troubles.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe
?
The types don't tell us what libraries we need. They don't
tell us how much RAM/CPU we need, either.
Pure functional code as the minimal essence of pure
computation -- everything else an EDSL.
Partial or total code?
--
Jason Dusek
___
Haskell-Cafe
.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to be
unjust, and it encourages more of the same. It's like
littering your own house.
+1
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Then the maintainer of Parsec specifies that 2.1.0.1 is
compatible with 2.1.0.0 and we can compile the second package,
the one that require 2.1.0.0, with 2.1.0.1 since they are
compatible and that is all it is asking for. Then we try to
use these two packages together and everything works.
--
Jason
-- in
terms of multi-versioning, compiled module interfaces and
approaches to modularity that are about servers and pipes
instead of linking -- to make it easy to move away from
Haskell module by module?
--
Jason Dusek
___
Haskell-prime mailing
)
As for `preserveMatrix`, it is some OpenGL thing; probably
what it does is ensure that any changes you make to one of the
matrices that make up the rendering state are undone once you
exit the enclosed computation.
--
Jason Dusek
___
Haskell-Cafe mailing list
; but this doesn't capture the notion that
all these records conform to a certain type equation. In this
way, Haskell is more demanding of you; but it also offers you
a way to make the semantics of your data explicit.
--
Jason Dusek
___
Haskell-Cafe
column wide.
In addition, a little utility is provided that constructs a
table of widths by character and a listing of character ranges
with the same width. On different systems, `wcwidth` may
assign different widths to the same character for some obscure
characters.
--
Jason Dusek
. However, I was quite keen on releasing my JSON
parser in a timely manner; the maintainer was (very
reasonably) not on my schedule and I'm not sure my patch was
ever applied.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
).
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
)
Linking demo ...
0x5cff -1 峿
:; chmod ug+x DemoFailure.hs DemoFailure.hs
0x5cff 2 峿
Switching between safe/unsafe does not make any difference. This
was run on a Macintosh.
--
Jason Dusek
#!/usr/bin/env runhaskell
{- DemoFailure.hs -}
{-# LANGUAGE
Thank you very much!
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
There is a Cabal package for this already:
http://hackage.haskell.org/package/setlocale
A call to `setLocale LC_ALL (Just )` in `main` fixes things.
--
Jason Dusek
2009/11/13 Daniel Fischer daniel.is.fisc...@web.de:
Am Samstag 14 November 2009 00:00:36 schrieb Jason Dusek:
I'm
`closecport`? Maybe you could put in a
print statement in the C to find out?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
if this helps.
Here is the compilation script:
ghc -fglasgow-exts serial.c %1.hs -L./ -ljapi --make
erase *.hi
erase *.o
strip %1.exe
I encourage you to look into Cabal soon :)
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
`argv` is `char**` and not
`char*`, right?) so we introduce `stringPrim` and then build
up the primitives from that.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Does marking the call `unsafe` make any difference?
This is running on a *NIX of some flavour?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/11/4 Philippos Apolinarius phi50...@yahoo.ca
Jason Dusek wrote:
How do you read in the IOUArray? By parsing a character
string or do you treat the file as binary numbers or ... ?
I always pare the file. Parsing the file has the advantage of
alowing me to have files of any format
2009/11/04 Jason Dusek jason.du...@gmail.com:
...you parse the file I imagine you in face...
in face - in fact
Sorry.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
How do you read in the IOUArray? By parsing a character string
or do you treat the file as binary numbers or ... ?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
are.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
This version fixes defective handling of empty objects and
arrays.
http://hackage.haskell.org/package/json-b-0.0.4
Thanks to Dmitry Astapov for this fix.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
at the
bottom that has exactly the format of the user property of
the schema ahead of it -- why is that? Well, `json-schema`
uses a fault tolerant parsing approach; the very last Tweet
was cut off and the user property's value was among the
things that could be salvaged.
--
Jason Dusek
2009/09/28 John A. De Goes j...@n-brain.net:
Libraries are _everything_...
Not exactly. Python would never have gotten a foothold over
Perl, nor Java over C, if cleaner language semantics weren't
enough for some shops or certain applications.
--
Jason Dusek
, that a wholesome vegetable -- good raw
or pickled or in little salady things like coleslaw -- finds
itself used as a disincentive.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Some day, we're going to need a short, catchy name for Cabal
packages. Let's call them cabbages.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
can be extended to the other ones, at the cost of
a few characters.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/09/20 Joe Fredette jfred...@gmail.com:
I also agree. Hackage should also be renamed to something appropriate.
The Cabbage Patch?
+1
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
, `bint` just calls my `int` and `int` calls `lazy_int`
so why are there 41 million plus entries of `lazy_int`?
--
Jason Dusek
spoj-eugene-prof-opt-bang-acc-scc-dfold.prof
Description: Binary data
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
technical.
I'm sure I'm not alone when I say I'd like to see the longer,
more technical response.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
not a common
requirement, anyways).
http://hackage.haskell.org/package/bytestring-nums-0.3.0
I suspect that splitting the string into pieces and then
mapping the parser over the pieces will never be faster than
an all-in-one parser/tester/incrementer like the fast programs
have.
--
Jason
2009/08/30 Eugene Kirpichov ekirpic...@gmail.com:
Here's my version that works in 0.7s for me for a file with 10^7
9's but for some reason gets a 'wrong answer' at SPOJ :)
Maybe it gets a wrong answer because it reads all the input,
regardless of `n`.
--
Jason Dusek
I've updated Don Stewart's solution to compile with the modern
ByteString libs. I'll be looking at ways to improve the
performance of the `bytestring-nums` package.
--
Jason Dusek
http://github.com/jsnx/bytestring-nums/blob/d7de9db83e44ade9958fb3bfad0b29ede065b5dd/SPOJDons.hs
Say we have a nice thread on this and we all realize that the
precedence of `do` and `case` could be changed (and changing
`if` would be nice but we can't have everything). How many
months/years would it take for any change in that direction to
occur?
--
Jason Dusek
...
foo case...
foo if...
were always parsed as:
foo (do...)
foo (case...)
foo (if...)
This is what is usually meant.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
like this library.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Aha. From `Data.ByteString.Lazy` we have:
null :: ByteString - Bool
null Empty = True
null _ = False
So either users need to norm ByteStrings before testing
them for emptiness or it needs to happen within the ByteString
code...
--
Jason Dusek
2009/08/19 Jason Dusek jason.du...@gmail.com:
Aha. From `Data.ByteString.Lazy` we have:
null :: ByteString - Bool
null Empty = True
null _ = False
So either users need to norm ByteStrings before testing
them for emptiness or it needs to happen within the ByteString
code
2009/08/18 Eric Wong wsy...@gmail.com:
When I was using C and Python, I used to think of most
applications in an simulation way.
By simulation way, do you mean object-oriented way?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe
it doesn't.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of
information, and not just for files, but network, memory,
etc., then you'll be able to do some extremely powerful
parallelization optimization.
I am challenged to imagine optimizations that would be safe in
the case of File I/O.
--
Jason Dusek
___
Haskell
writing yourself.
+1
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the Barrier to Entry - Incremental Generational Garbage
Collection for Haskell
--
Jason Dusek
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
and Optimising Parallel Haskell Implementations
for Multicore Machines
What is the mutator?
--
Jason Dusek
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
to have a loop)? Then
it's not just a matter of performance when we do it?
--
Jason Dusek
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
2009/07/31 Jeremy Shaw jer...@n-heptane.com:
...why doesn't the stuff get freed eventually?
It is my understanding that the GHC runtime never lets go of
memory once it has requested it. (Confirmation either way
would be informative.)
--
Jason Dusek
on functions of a
functor, anyway? The name `fmap` seems to driven by an analogy
with `map`.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Is there a relationship between sessions and coroutines?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/06/24 Greg Meredith lgreg.mered...@biosimilarity.com:
Better support for std Haskell syntax
What does this mean, actually? Better support for standard
Haskell syntax than what?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe
Having read some of the material, it seems that sessions are
far richer than would be needed for most coroutines.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
What do I need to do to debug this?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the default dereferencing shouldn't sacrifice
helpful error messages and predicability.
This arrangement would make me LOL if it weren't my own
project...
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
2009/06/24 Daniel Fischer daniel.is.fisc...@web.de:
Am Mittwoch 24 Juni 2009 18:50:49 schrieb Jason Dusek:
2009/06/24 Ketil Malde ke...@malde.org:
So in effect, you have a zero-length underlying array, but
the array implementation still keeps track of the real
indices and tries
, in windows 32-bit program cannot alloc memory
block larger than 2gb
But on everything but Windows...
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
So now I get to write a blog post called Compact Bit Arrays
in Haskell or some such.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Why don't we have a picture of a cool dinosaur instead?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
) = (a - b) - m a - m b
Prelude Control.Monad :t fmap
fmap :: forall a b (f :: * - *). (Functor f) = (a - b) - f a - f b
I think we have `liftM` either to help the inferencer or due
to the absence of a `(Functor m)` constraint in the definition
of the `Monad` typeclass.
--
Jason Dusek
2009/05/28 Benjamin L.Russell dekudekup...@yahoo.com:
What makes you think that Haskell is likely eventually to dig
a smoking hole in the ground?
This is more about unmet expectations than spectacular
failure.
--
Jason Dusek
___
Haskell-Cafe
2009/05/27 Miguel Mitrofanov miguelim...@yandex.ru:
And I would certainly celebrate when if b then x else y
expression becomes polymorphic in b.
class Boolean b where
fromBoolean :: b - Bool
--
Jason Dusek
___
Haskell-Cafe mailing list
typeful languages in
general) do not find themselves in the same situation in just
a few years' time? Is avoiding success at all costs really
enough?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
2009/05/27 Tord Romstad tord.roms...@gmail.com:
I think you rarely meet embittered Lisp programmers simply
because we Lispers are rarely embittered...
I have a very small sample size :)
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe
On the IRC channel a few days ago, it was said that, as long
as we allow `seq`, Hask is not a valid category.
Doesn't this basically mean that a very large amount of
Haskell -- anything with strictness annotations -- can not be
described in a category Hask?
--
Jason Dusek
operations that need to be generified. I'd like to know what
folks think about the use of `MonadPlus` in this case.
--
Jason Dusek
|...an implementation of `filter`...|
http://github.com/jsnx/genfil/blob/246026b975ec13587186681b7b346ae1e440d0c9/Data/Filter.hs
://www.haskell.org/ghc/dist/current/docs/users_guide/type-extensions.html#stand-alone-deriving
Same problem. Standalone deriving is described here...
I found it linked from the wiki page on stand-alone deriving
(which also happens to have the offending sytnax).
--
Jason Dusek
|...the wiki
Yes, it is fixed (the link is to the history).
--
Jason Dusek
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Oh, I just realized I had not changed the links, only the
examples. They are all fixed now.
--
Jason Dusek
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
101 - 200 of 410 matches
Mail list logo