Created a ticket with a patch:
http://hackage.haskell.org/trac/ghc/ticket/2093
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
You rule!
Here is where I am at now. It seems that when I build ghc from source,
the top level configure script detects that my system has large file
support, and enables it. As you discovered, this gets dumped into:
/usr/lib/ghc-6.8.2/include/ghcautoconf.h
which gets included when
Hello,
I get funny results when I call getSymbolicLinkStatus in ghc 6.8.2 on
Ubuntu 7.10. This happens on several systems and has been confirmed by
other people. Though, some people on almost the exact same system
claimed to not see it at all. Here is an interactive example with
ghci, note how
Hello,
If my sources are to be believed, the following clip contains Simon
Peyton Jones saying 'Haskell' several times.
http://www.n-heptane.com/nhlab/spj-haskell.wav
j.
At Tue, 29 Jan 2008 08:28:44 +0800 ,
[EMAIL PROTECTED] wrote:
[1 multipart/alternative (7bit)]
[1.1 text/plain; gbk
At Mon, 28 Jan 2008 17:06:58 -0800,
Tim Chevalier wrote:
I should really read more carefully -- I see now that you weren't
trying to disagree with me by posting that clip, but the person who
*did* disagree with me was also named Jeremy. How confusing.
tehehe.
For the record, I believe I
At Thu, 10 Jan 2008 17:22:02 -0200,
Maurício wrote:
Hi,
Is it possible not to load Prelude module
when compiling a Haskell module? Or instruct
ghc to “unload” it?
You can either do:
import Prelude()
or compile with the -fno-implicit-prelude flag, or add
{-# LANGUAGE NoImplicitPrelude
At Wed, 21 Nov 2007 12:10:38 +0100,
Peter Verswyvelen wrote:
Yes, but why don't researchers just publish their TEX file? You can
regard that as the source code for generating PDF/PS whatever no?
Yes. but things have a way of getting lost. The primary advantage to
embedding the data is you
At Mon, 19 Nov 2007 19:57:14 +,
Neil Mitchell wrote:
All these PDF's are produced from a standard Latex class file. For
all my papers I have the original source .tex files. I suspect
you'll have more luck going from the original .tex rather than the
PDF.
I would be especially neat if
At Mon, 19 Nov 2007 21:25:23 +,
Andrew Coppin wrote:
If you were going to implement Tetris in Haskell, how would you do it?
(For that matter, has anybody already *done* it? It would probably make
a nice example program...)
A minimal openGL haskell tetris clone:
At Mon, 19 Nov 2007 10:25:40 -0800,
brad clawsie wrote:
so far the haskell community has taken the cpan route for most
practical libs but i wonder if a batteries included approach might
help get some key libraries to a more complete state. in particular, i
would like to see support for basic
At Mon, 19 Nov 2007 23:18:58 -0200,
Felipe Lessa wrote:
If there aren't any libraries available, are there any
suggestions on how to create one?
I am not sure if a better way exists already, but here is how I would
do it if nothing better exists.
Creating a binding to the gettext library
Hello,
Is real-time, parallel garbage collection at all feasible?
My thinking is, real-time garbage collection requires the garbage
collector to be able to work on the problem in small, predictable,
pieces. That seems like something which would also be useful for
scaling up GC to multiple
At Sun, 21 Oct 2007 17:21:00 -0200,
Maurício wrote:
Brandon S. Allbery KF8NH escreveu:
On Oct 21, 2007, at 14:40 , Maurí cio wrote:
I like Haskell, and use it as my main
language. However, compiling a Haskell program
usually takes a lot of memory and CPU.
Last night I was
At Mon, 22 Oct 2007 14:45:51 -0400,
David F. Place wrote:
On Oct 22, 2007, at 2:26 PM, Jeremy Shaw wrote:
Hello,
If you have not seen this paper, you may enjoy it:
Modular Lazy Search for Constraint Satisfaction Problems (2001)
Thomas Nordin, Andrew Tolmach
http
Hello,
Oleg, Chung-chieh Shan, and others have done some work close to this
area. On this page, see the Monads parameterized by time section:
http://okmij.org/ftp/Haskell/number-parameterized-types.html
Also see this page:
http://okmij.org/ftp/Haskell/types.html#ls-resources
The new type
At Wed, 26 Sep 2007 22:11:12 +0700,
Peter Gammie wrote:
Hello,
Does anyone have a library for sending email from a Haskell program?
I'd like something portable and cabalised.
I note there is code in darcs to send email on Windows and UNIX-y
systems, and also something in WASH (I
At Thu, 13 Sep 2007 13:26:05 +0100,
Ian Lynagh wrote:
Hi Stefan,
On Thu, Sep 13, 2007 at 07:55:21AM +0200, Stefan Holdermans wrote:
We are pleased to announce the Release Candidate phase for GHC 6.8.1.
That's 6.8, right? Or have I missed something?
No, it's 6.8.1:
At Mon, 27 Aug 2007 17:04:17 +0200,
Peter Verswyvelen wrote:
In Scheme, on can quote code, so that it becomes data. Microsoft's F#
and C# 3.0 also have something similar that turns code into expression
trees. The latter is used extensively in LINQ which translates plain C#
code into SQL
At Sun, 26 Aug 2007 00:19:25 +0200,
=?UTF-8?Q?Rados=C5=82aw_Grzanka?= wrote:
It's funny. But 5 minutes ago I was thinking: did anyone compiled
haskell application for Palm (m68k and/or Arm) that runs on Palm OS?
I have looked into doing this in the past. Historically speaking, the
first
At Thu, 12 Jul 2007 00:42:46 -0700,
Simon Michael wrote:
Good day all,
my budding ledger program could not balance transactions exactly because of
rounding error with Double. I *think* I got it working better with Rational
(it was late). Another suggestion from #haskell was to multiply
At Thu, 12 Jul 2007 09:18:14 +1000,
Thomas Conway wrote:
On 7/12/07, Andrew Coppin [EMAIL PROTECTED] wrote:
It's fairly common to use the Either type for this. By convention,
Right means correct, and by elimination Left means an error...
Presumably, this is because the world is dominated
At Wed, 27 Jun 2007 18:54:58 +0200 (CEST),
Arie Peterson wrote:
What is the status of the MIME Strike Force?
The goals proposed at
http://www.haskell.org/haskellwiki/Libraries_and_tools/MIMEStrikeForce
promise a very useful library. Has the design been initiated?
Currently it is on hold
At Wed, 27 Jun 2007 21:14:02 +0200,
Marc Weber wrote:
exampleHeaders2 :: [RawHeader]
exampleHeaders2 =
((Subject whee) .+.
(Subject bork) .+.
(Keywords [baz, bar, bam]) .*.
(Keywords [zip, zap, zop]) .*.
empty
)
[...]
But, it is also really
Hello,
Have you seen Tom Moertel's series on directory-tree printing in Haskell ?
http://blog.moertel.com/articles/2007/03/28/directory-tree-printing-in-haskell-part-three-lazy-i-o
j.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hello,
Did you see the recently announce reduceron project? (Or perhaps you
are already involved in that project?)
http://www-users.cs.york.ac.uk/~mfn/reduceron/index.html
If you search scholar.google.com for graph reduction machine you
should turn up a bunch of papers about attempts to build a
At Thu, 31 May 2007 10:42:57 -0700,
Greg Meredith wrote:
BTW, i think this could have a lot of bang-for-buck because the literature i
read exhibited two basic features:
- the standard treatments (even by CS-types) are decidedly not
compositional
- the people in the field who face
At Thu, 31 May 2007 11:36:55 -0700,
Jeremy Shaw wrote:
This paper describes a non-monadic, compositional method for solving CSPs:
http://www.cse.ogi.edu/PacSoft/publications/2001/modular_lazy_search_jfp.pdf
btw, there are multiple versions of this paper. This version includes
a section
At Sun, 20 May 2007 10:55:26 +0100,
Malcolm Wallace wrote:
Jeremy Shaw [EMAIL PROTECTED] writes:
How do I create a HaXml filter that adds a new element as a child of
an existing element. For example, let's say I have the XML document:
a b/ c/ /a
How do I add a new element under
Hello,
How do I create a HaXml filter that adds a new element as a child of
an existing element. For example, let's say I have the XML document:
a
b/
c/
/a
How do I add a new element under a / so that I have the document:
a
newElement/
b/
c/
/a
The following works, but it seems very
Hello,
If one of the modules you are importing (for example, Fu.NewLogging),
does *not* contain a line at the top like:
module Fu.NewLogging where
then I think you will get an error that looks something like that. I
am not sure if this is your problem, but if it is, it is an easy fix
:)
hope
At Sun, 13 May 2007 02:49:13 +0100,
Frederik Eaton wrote:
Hello,
However, should either of these things be necessary?
no.
I think users oughtn't have to memorize and execute a list of
haphazard tricks, for instance like reading the modules they import
and visually checking that they
Hello,
I have uploaded a simple AGI interface to hackage. It is still very
alpha, but that has never stopped me before :)
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/AGI-1.0
darcs get http://www.n-heptane.com/nhlab/repos/haskell-agi/
The best way to understand how to use it is
At Mon, 16 Apr 2007 13:44:13 +0100,
Neil Mitchell wrote:
Hi,
So my question is if this is safe? Will the compiler always pick the
right one? Is there a better way to do this?
I noticed that the results can be a bit suprising sometimes. See if
you can predict the answers to these (in ghci):
Hello,
I defined a newtype like this (the ()s will be replace with
something more useful in the future):
newtype DryRunIO a = DryRunIO { runDryRunIO :: RWST Bool () () IO a }
deriving (Monad, MonadIO, MonadError IOError, MonadFix, Functor,
MonadReader Bool, MonadWriter (), MonadState ())
Hello,
This multipart tutorial seems similar to what you are describing:
http://blog.moertel.com/articles/2007/03/28/directory-tree-printing-in-haskell-part-three-lazy-i-o
The tutorial is actually a bit more complicated, it is traversing a
whole directory tree and printing a nice graph.
HTH,
Hello,
I would like to take this opportunity to announce the availability of
an Adobe Shockwave Flash (SWF) library for Haskell:
darcs get http://www.n-heptane.com/nhlab/repos/haskell-swf/
The library is a bit old and crufty, and it is not really release
quality code. The cabal files are out of
, you are (at least) the third person to do this.
Jeremy Shaw (stepcut):
http://www.n-heptane.com/nhlab/repos/haskell-xmpp/
In my library I try to preserve the extensible nature of XMPP. It was
my hope that people could add support for XMMP Extension Protocols
(XEP), by writing additional
Hello,
I would like to announce the availability of the a library for
interacting with the Debian system. This library does not (currently)
depend on dpkg or apt for any functionality. Contributions are
welcome. You should probably send an email first to make sure you are
not duplicating any of
At Tue, 3 Apr 2007 13:04:36 -0700,
Sounds like your duplicating a lot of the functionality of jgoerzen's
MissingH library. http://software.complete.org/missingh
yes. but better ;)
Not all of your functionality is subsumed, but he has a control-file
parser and a version type too.
Yes and
Hello,
Did you compile with -O2 ? That makes a huge difference when using ByteString.
j.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
At Tue, 27 Mar 2007 23:10:21 +0200,
Fawzi Mohamed wrote:
If someone has an idea on how else I can improve timings please tell me.
I believe you are seeing a speed decrease, because GHC is not inlining
functions as much when you split them into modules. If you add
explicit inline statements, I
At Tue, 20 Mar 2007 12:02:20 -0400,
Jeff Polakow wrote:
[1 multipart/alternative (7bit)]
[1.1 text/plain; US-ASCII (7bit)]
Hello,
On my system, GHC 6.6 running on windows xp, System.Time.toClockTime
fails on calendar times later than (by days, I didn't check hours,
minutes, etc.)
Hello,
If you have tried to do any MIME processing using Haskell, you are
likely to have found two things:
1) There are a lot of MIME libraries for Haskell
2) None of them do everything you want
So, I propose that we form a MIME Strike Force and create the one,
true MIME library.
The plan
At Sun, 18 Mar 2007 14:22:34 -0700,
Stefan O'Rear wrote:
This was solved on #haskell yesterday after you left.
http://tunes.org/~nef/logs/haskell/07.03.71
Scroll down to 21:48:47 and read stepcut's comment.
In fact, it's already patched in darcs:
darcs get
At Mon, 12 Mar 2007 11:24:48 +0100,
Maxime Henrion wrote:
pmaybe :: GenParser tok st a - GenParser tok st (Maybe a)
pmaybe p = option Nothing (p = return . Just)
I've been using it happily with some code of mine. Do people think
that it would be generally useful to have in Parsec?
I
Hello,
Your definition for Bool reminds me a bit of the definition for
booleans in Robert Dockins pure, untyped lambda calculus evaluator:
http://www.eecs.tufts.edu/~rdocki01/lambda/prelude.lam
http://www.eecs.tufts.edu/~rdocki01/lambda.html
j.
___
Hello,
There are a few solutions, depending on what behaviour you want. If
you plan to read the file all the way to the end, then you do not need
to explicitly close the handle, hGetContents will do it for you.
At Tue, 6 Mar 2007 22:56:52 +0100,
D.V. wrote:
The problem is that hGetContents only reads the contents of the file on
demand
and, without the 'return $!' you don't demand the value until somewhere
outside of rechf. By this point the hClose has happened and hGetContents
has
no
At Thu, 1 Mar 2007 11:38:54 -0600,
John Goerzen wrote:
On Thu, Mar 01, 2007 at 04:21:45PM +, Simon Marlow wrote:
Between that and the lack of support for forkProcess in Hugs, this
renders anything that needs to fork and then do I/O as being usable only
in GHC-compiled code. Which is
At Wed, 28 Feb 2007 11:15:04 -0600,
John Goerzen wrote:
You can see my test case with:
darcs get '--tag=glasgow ml' http://darcs.complete.org/hsh
ghc -fglasgow-exts --make -o test2 test2.hs
I get an erro when I use that darcs command-line, and test2.hs does
not appear to be in the directory
*without* the -threaded flag.
hth,
j.
At Wed, 28 Feb 2007 13:29:17 -0600,
John Goerzen wrote:
On Wed, Feb 28, 2007 at 10:40:18AM -0800, Jeremy Shaw wrote:
At Wed, 28 Feb 2007 11:15:04 -0600,
John Goerzen wrote:
You can see my test case with:
darcs get '--tag=glasgow ml' http
-0600,
John Goerzen wrote:
On Wed, Feb 28, 2007 at 01:06:25PM -0800, Jeremy Shaw wrote:
Hello,
Your first problem is just a line buffering issue. You need to
explicitly set the line buffer inside the child processes:
redir fstdin stdInput
Hello,
Here is a simplified example that seems to exhibit the same behaviour,
unless I screwed up:
---
module Main where
import System.Posix
import System.IO
import System.Exit
main =
do putStrLn running...
(stdinr, stdinw) - createPipe
(stdoutr, stdoutw) - createPipe
At Mon, 26 Feb 2007 07:54:56 +1000,
Tony Morris wrote:
[1 multipart/signed (7bit)]
[1.1 text/plain; ISO-8859-1 (quoted-printable)]
I have a backtracking algorithm that I need to memoise with. Rather than
go into the intricacies of the algorithm, I figure (and hope) the
factorial function
Hi,
I was working in embedded development, writing lots of C code. My
primary tool for debugging things was turning an LED on or off. So, I
became quite interested in figuring out how to write code with less
bugs.
After some searching, I found lclint, (now knows as splint:
At Fri, 26 Jan 2007 07:23:26 -0800,
David Roundy wrote:
I would think that what we'd want to benchmark would be clean, optimized
actually-used code.
Maybe there should be two versions of each benchmark:
1) an clean, simple, idiomatic version, aka the code we would like to
write if
At Sat, 6 Jan 2007 15:41:37 -0800,
Stefan O'Rear wrote:
On Sat, Jan 06, 2007 at 03:30:56PM -0800, tphyahoo wrote:
I'm having trouble installing ghc 6.6. On ubuntu, virtual server (user mode
linux).
Is it repeatable? i.e. If you run 'make' again, do you get the same error at
the same
Hi,
In this case, the stack overflow you are seeing is due to laziness not
tail recursion.
Because you never demand the value of any element in the list, Haskell
never bothers to calculate it. So you have a list that looks like:
[ i, i - 1, (i - 1) - 1, ((i - 1) - 1 - 1), .. ]
So, by the
At Fri, 05 Jan 2007 17:58:14 -0800,
Jeremy Shaw wrote:
Because you never demand the value of any element in the list, Haskell
never bothers to calculate it. So you have a list that looks like:
[ i, i - 1, (i - 1) - 1, ((i - 1) - 1 - 1), .. ]
I should clarify that this is the list
At Fri, 05 Jan 2007 20:59:16 -0800,
Mike Gunter wrote:
pps. I didn't explain why [1..100] works, but [1..] fails, because
I don't know :) It's a bit suprising to me...
With [1..100], the generated values have to be tested against
100 as you go. So, they get evaluated.
Hello,
According to this page:
http://www.cs.york.ac.uk/fp/HaXml/HaXml/Text-XML-HaXml-Wrappers.html
processXmlWith is used to apply a filter to an existing XML
document. By default, it will try to read the input document from
stdin. So, I am imagine that is what it is doing -- sitting their
Hello,
I would like to announce the availability of my partially complete
MIME processing library. This library is supposed to be able to parse
emails and decode various attachments, and generate emails with
attachments.
The library includes modules that implement portions of:
RFC 2045 -
At Sun, 19 Nov 2006 13:46:10 -0500,
Peter Tanski wrote:
What is the problem building GMP for PalmOS? According to the GMP
install documentation, it supports ARM and Motorola's m68k
processors, so you would not be using generic C code. You are
probably also using PRC-Tools, correct?
At Sat, 18 Nov 2006 00:44:32 +,
Neil Mitchell wrote
One advantage you probably haven't thought of is the size of the
binary. Currently GMP adds about 50Kb on to the Yhc runtime, for what
in the most cases is probably an occasional addition. If the bytecode
for a bignum library was less
Christian Neumann christian at altfrau.de writes:
Am Thu, 21 Sep 2006 08:07:36 +0100
schrieb David House dmhouse at gmail.com:
As a real Haskell newbie I must say that this is (IMHO) a very bad idea.
It's annoying to register on yet another forum just to ask one question
(and even more to
At Wed, 13 Sep 2006 15:24:39 +0400,
Bulat Ziganshin wrote:
because REAL code is somewhat larger than examples. try to rewrite the
following:
directory_blocks - (`mapM` splitBy (opt_group_dir command)
files_to_archive)
( \filesInOneDirectory - do
datablocks - (`mapM`
At Tue, 5 Sep 2006 03:03:51 + (UTC),
John Goerzen wrote:
I have the below program, and I'm trying to run it on an input of about
90MB. It eats RAM like crazy, and I can't figure out why.
I have not looked in detail at your code -- but it could simply be the
fact that String requires gobs
At Mon, 04 Sep 2006 22:05:57 -0700,
Jeremy Shaw wrote:
At Tue, 5 Sep 2006 03:03:51 + (UTC),
John Goerzen wrote:
I have the below program, and I'm trying to run it on an input of about
90MB. It eats RAM like crazy, and I can't figure out why.
If you fold a Data.Map or associative
Hello,
GHCi and the compiled program do not buffer the output in quite the
same way. In the compile program, stdout is line buffered, so it will
not output anything until it gets a '\n'. You can force the output
using 'hFlush stdout':
import System.IO
main = do
putStr Who are you?
At Sat, 29 Jul 2006 14:07:51 -0400,
Brian Sniffen wrote:
I'm very excited by the ability to pass functions or IO actions
between threads of the same program. But I don't see any language or
library support for doing so between programs, or between sessions
with the same program.
There is
... done.
ghc-pkg: invalid package identifier:
It's not showing me the ghc-pkg that's being invoked.
On Jul 26, 2006, at 12:56 AM, Jeremy Shaw wrote:
At Wed, 26 Jul 2006 00:40:33 +0100,
Joel Reymont wrote:
Is there something that looks particularly wrong below?
Can you try
At Wed, 26 Jul 2006 23:07:36 +0200,
Udo Stenzel wrote:
What does Emacs do with double separators? I'm at a loss thinking of
anything they could denote, but it could be useful.
You mean like,
/path/to/somewhere//with/double/seperator
If so, it treats it as if you had typed in:
At Wed, 26 Jul 2006 00:40:33 +0100,
Joel Reymont wrote:
Is there something that looks particularly wrong below?
Can you try the install with verbosity turned up:
$ sudo runhaskell Setup.lhs install -v
or perhaps even
$ sudo runhaskell Setup.lhs install -v5
I believe this will show
At Wed, 12 Jul 2006 10:57:54 -0700,
Chad Scherrer wrote:
[1 multipart/alternative (7bit)]
[1.1 text/plain; ISO-8859-1 (7bit)]
Hi,
I'm interested in attending the Hackathon, but I don't have any previous
experience working on compilers.
Perhaps we should start a list of pre-session
At Tue, 11 Jul 2006 19:28:13 +0400,
Bulat Ziganshin wrote:
Hello Haskell,
what is a best way to bring C constant (defined in header file) into
the Haskell source?
If this ^^^ was your entire question, I would say, use hsc2hs.
At Tue, 27 Jun 2006 20:36:30 +0100,
Brian Hulley wrote:
What about words like 'hour' and 'honest'?
Don't forget honor.
So I'd say these two words are closely related, so the search is still on
for another word with silent 'h' not related to time or integrity.
How about heir? Also, until
At Thu, 25 May 2006 13:42:11 +0400,
Bulat Ziganshin wrote:
Hello Jeremy,
Monday, May 22, 2006, 12:20:54 AM, you wrote:
For my own needs, I cabalized and debianized the Streams library. It
generates binary debs for ghc6 and hugs -- but I think the hugs
version is broken. In any case,
Hello,
I really wanted to respond to the parent thread, but I deleted it
already, so this message will be a bit out of context.
For my own needs, I cabalized and debianized the Streams library. It
generates binary debs for ghc6 and hugs -- but I think the hugs
version is broken. In any case, it
Hello,
You can do it -- but it may not be very useful in its current
form. The primary problem is, What is the type of 'f'?
applyArgument f [arg] = f arg -- NOTE: I changed (arg) to [arg]
applyArgument f (arg:args) = applyArgument (f arg) args
Looking at the second line, it seems that f is a
At Thu, 18 May 2006 02:37:56 -0700,
Juan Carlos Arevalo Baeza wrote:
I'd be worried about the performance you can get from this
breadth-first approach. I sort of like the fine-tuning control that the
try approach gives in parsec. I'll finish the paper before giving this
any more
At Wed, 17 May 2006 11:36:00 -0700,
Juan Carlos Arevalo Baeza wrote:
Is there any known alternative that doesn't exhibit this behavior? It
would have to somehow return errors inline or on a side channel. I'll
be toying with this sort of thing for a while.
You might try reading,
Polish
At Thu, 11 May 2006 23:05:14 +0100,
Brian Hulley wrote:
Of course the above could no doubt be improved but surely it is already far
easier to understand and much more powerful than the idiosyncratic text
based approach used in UNIX shells (including rc).
The idea of representing unix pipes
Update Summary
--
The testsuite indicates that the first-pass ghc arm build is in pretty
good shape -- I think it now does everything that can be expected
without porting the rts, etc. I have uploaded a tarball for anyone who
wants to try it:
At Wed, 03 May 2006 22:06:05 -0700,
Jeremy Shaw wrote:
Hello,
I believe I have successfully got an unregisterised version of ghc
6.4.2 compiled for arm/linux.
Updates:
---
1) I turns out I only had a in-place build of ghc, I have now got a
real build 'working'.
2) I have started
Hello,
I believe I have successfully got an unregisterised version of ghc
6.4.2 compiled for arm/linux.
Details:
---
I only had to do a minor bit of hacking -- this bug contains the
details of what went wrong:
http://hackage.haskell.org/trac/ghc/ticket/762
My target platform is the nokia
://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-List.html
You probably want to attack it as two steps:
(1) remove unwanted characters
(2) convert to lower case
Jeremy Shaw.
ps. Remember that String is just an alias for [Char] in haskell.
At Sun, 9 Apr 2006 16:59:19 -0700 (PDT),
UnfitElf
-| roundHint == RoundOneHalf (lastIsEven d) = (Decimal s (coef + 1) exp)
+| roundHint == RoundOneHalf (lastIsEven d) = (Decimal s (coef + 1) exp)
-- FIXME: this may be wrong, see pep327
Jeremy Shaw
At Fri, 10 Feb 2006 14:09:23 -0500,
Rob Tougher wrote:
I'm currently working on a mathematics
On Dec 26, 2005 10:20 PM, Brian McQueen [EMAIL PROTECTED] wrote:
How is this different from the (un)pickle process that has been
discussed here recently?
There is one important difference in my mind. Most of the pickling code
is concerned with turning haskell data into a binary stream that
At Thu, 22 Dec 2005 11:26:51 +,
Joel Reymont wrote:
Folks,
I'm trying to monadify the pickler code. sequ below positively looks
like = but you can't really join both pickle and unpickle into a
single monad. I would like to keep the ops together, though, as this
allows me a
performance gains associated with it -- and
they have to do it without the help of the type-checker.
Having written a bit of clean code, I can say that it is very easy to
accidently un-uniquify things.
Jeremy Shaw.
___
Haskell-Cafe mailing list
Haskell-Cafe
At Fri, 11 Nov 2005 01:11:17 +,
Thomas Davie wrote:
Announcing the York Haskell Compiler - a Haskell 98 compiler with
roots in nhc98. It's not totally finished, but is getting there
quickly, and could well be of interest to Haskell developers.
Is there some trick to getting it to build ?
Thanks!
Jeremy Shaw.
___
Glasgow-haskell-bugs mailing list
Glasgow-haskell-bugs@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
it. Thanks!
Jeremy Shaw.
___
Glasgow-haskell-bugs mailing list
Glasgow-haskell-bugs@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
everything later.
Thanks!
Jeremy Shaw.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
I have done all of those things in WASH. But, don't let that stop you
from writing something better :) I think some people started a project
to write a CGI interface based on a 'Category' -- where a 'Category'
is like an 'Arrow' without the 'pure/arr' function...
Jeremy Shaw.
At Wed, 1
...
I hope this makes some sense (and I hope what I have said is reasonably
correct...)
Jeremy Shaw.
On May 02, 2005 09:38 PM, Daniel Carrera
[EMAIL PROTECTED] wrote:
Hi all,
Again, I'm the new guy slowly learning this fuctional programming
thing. :-)
I've been reading, and I'm really liking
I am making a wild guess because I do not have all the information in
front of me right now but would this work ?
... do x - if cond
then textInputField ...
else return ()
note the addition of 'return' to the else clause ?
Jeremy Shaw.
On Feb 24, 2005 08:42 AM
~ It could never be done
~ It could be done, but it would be a really horrible idea, and here's why
So don't hold back :)
Thanks!
Jeremy Shaw.
[1] I suppose by 'currently in scope' I mean all the instances that
type checker is considering when it type checks the function at
compile time. But I am
At Sun, 16 Jan 2005 12:09:43 +0100,
Lemmih wrote:
On Sun, 16 Jan 2005 00:13:08 -0800, Jeremy Shaw
[EMAIL PROTECTED] wrote:
Hello,
Is it possible to write a function that would display all the instances
of a class currently in scope[1]?
For example, for 'Show a' it should output
At Fri, 17 Dec 2004 10:48:34 -0600,
John Goerzen wrote:
First, if someone were to make a working, useful package out of this, is
it likely that it would become the standard (whatever that means) IO
system in Haskell anytime in the near future? I ask because I don't
want to put a lot of time
301 - 400 of 420 matches
Mail list logo
