I refactored the code and uploaded a new version to Hackage
(YamlReference-0.2). It is cleaner now and much more efficient. It is
still "leaking" memory though. The profiler hints at "bindReply" as
the culprit retaining State and Reply objects, but it isn't clear to
me why the code would do that.
Hi,
Haskell has a rich history of embedded hardware description languages.
Here's one more for the list.
Inspired by the work of Arvind, Hoe, and all the sharp folks at
Bluespec, Atom is a small HDL that compiles conditional term rewriting
systems down to Verilog RTL. In Atom, a circuit descrip
Hello Scott,
Wednesday, April 4, 2007, 1:54:27 AM, you wrote:
> Match the Parsec parser against the input as soon as a match
> is available, but fail if the match is unavailable after a timeout
> value if no further data is available on the socket.
one possible solution: use Streams library and
Hello all,
I'm writing an application to interact with other applications
remotely though TCP sockets (primarily), and in the future
with local apps also.
So far I have a Parsec parser to match the input that I want
to see, which works if the remote connection is particularly
speedy - but the fi
On Tue, 3 Apr 2007 16:01:56 +0100
Joel Reymont <[EMAIL PROTECTED]> wrote:
Folks,
I'm trying to figure out how to test a Parsec-based parser with
Smallcheck [1]. My test AST is below and the goal is to return
StyleValue if the parser is fed an integer, or return
Solid when parsing "Solid",
On Tue, 3 Apr 2007 16:01:56 +0100
Joel Reymont <[EMAIL PROTECTED]> wrote:
> Folks,
>
> I'm trying to figure out how to test a Parsec-based parser with
> Smallcheck [1]. My test AST is below and the goal is to return
> StyleValue if the parser is fed an integer, or return
> Solid when parsi
| > > class T root pos sel | pos -> root, root -> sel where
| > >f :: pos -> sel -> Bool
| > >
| > > instance T root (Any root) sel where
| > >f (ANY p) s = f p s
...
| That is not surprising. What is surprising is why GHC 6.6 accepts such
| an instance?
Well, it shouldn't. As the user ma
Folks,
I'm trying to figure out how to test a Parsec-based parser with
Smallcheck [1]. My test AST is below and the goal is to return
StyleValue if the parser is fed an integer, or return
Solid when parsing "Solid", etc.
data Style
= StyleValue Expr
| Solid
| Dashed
| Dot
On Tue, 3 Apr 2007, Jason Morton wrote:
> NumericPrelude does seem like a good starting point for discussion and
> addition. Is it still being actively developed,
slowly but actively
> and what are the goals there?
A more sophisticated numeric type class hierarchy. However it contains
also so
NumericPrelude does seem like a good starting point for discussion and
addition. Is it still being actively developed, and what are the
goals there?
On 4/3/07, Henning Thielemann <[EMAIL PROTECTED]> wrote:
On Mon, 2 Apr 2007, jasonm wrote:
> Jacques Carette wrote:
> >
> >> perhaps i was mista
resolved issue at
http://groups.google.de/group/fa.haskell/browse_thread/thread/ceabae2c3fdc8abc/5ab21d4ae2a9b1fc?lnk=st&q=hsh++tphyahoo&rnum=5&hl=en#5ab21d4ae2a9b1fc
2007/4/2, Thomas Hartman <[EMAIL PROTECTED]>:
Well, I guess I spoke to soon. After building ghc6 from feisty as
described above,
never mind.
Prelude HSH> run $ ("ls", ["."]) :: IO String
"COPYING\nCOPYRIGHT\nHSH\nHSH.cabal\nHSH.hi\nHSH.hs\nHSH.o\nINSTALL\nMakefile\nSetup.hi\nSetup.lhs\nSetup.o\n_darcs\ndebian\ndist\nsetup\ntest.hs\ntest2.hs\ntestsrc\n"
I guess I got it installed.
Only thing is you (jgoerzen) might want t
actually, maybe I'm more okay than I thought.
I originally did this without reading the INSTALL file, and built
using the process I have gotten used to: runghc Setup.hs configure;
runghc Setup.hs build; runghc Setup.hs install.
But when I followed the directions in the INSTALL file ...
make se
That was a pretty badly titled top thead, which I regret -- probably
should have been something like "figuring out how to track down and
install packages in haskell, using ubuntu /deb-- was Ann:: HSH".
To give additional context, this started out as
http://groups.google.de/group/fa.haskell/brows
I'm still trying to figure out how to do this on ubuntu. If this winds
up being a garden path I'll try on debian next, but at least I'm
learning a lot about getting haskell stuff built.
Anyway, since I'm on a virtualized linux box, I decided to get a fresh
start, unmounted my original OS profile
Anthony Chaumas-Pellet <[EMAIL PROTECTED]> wrote:
> From: Ross Paterson <[EMAIL PROTECTED]>
> > You show a bias towards tail recursion. It would be neater (and
> > lazier) to return the executed ones incrementally.
>
> Why is tail recursion a bad thing for a finite function?
Tail recursion tend
On Tue, 3 Apr 2007, Ferenc Wagner wrote:
> "Alexander McPhail" <[EMAIL PROTECTED]> writes:
>
> > I am embarking on a project to bind to CBLAS and CLAPack.
>
> Do you know of http://www.cs.utah.edu/~hal/HBlas/index.html ?
... not to forget GSLHaskell and
http://www.haskell.org/haskellwiki/Libra
On Mon, 2 Apr 2007, jasonm wrote:
> Jacques Carette wrote:
> >
> >> perhaps i was mistaken in thinking that there is a group of
> >> math-interested
> >> haskellers out there discussing, developing, and documenting the area? or
> >> perhaps that group needs introductory tutorials presenting its w
"Alexander McPhail" <[EMAIL PROTECTED]> writes:
> I am embarking on a project to bind to CBLAS and CLAPack.
Do you know of http://www.cs.utah.edu/~hal/HBlas/index.html ?
--
Feri.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell
Thanks for your comments everyone! There is one point that has left me
puzzled, though.
From: Ross Paterson <[EMAIL PROTECTED]>
> You show a bias towards tail recursion. It would be neater (and lazier)
> to return the executed ones incrementally. This is easier if you don't
> distinguish the sur
I have set up a page on the wiki for discussion:
http://www.haskell.org/haskellwiki/Haskell_and_mathematics/Hierarchy
And about a darcs repo for people to patch against:
-- Forwarded message --
From: Simon Marlow <[EMAIL PROTECTED]>
Date: 03-Apr-2007 20:28
Subject: Re: darcs.has
21 matches
Mail list logo
