Hello all,
Just a small announcement.
funsat has been bumped to 0.6.2. New in 0.6.2: works with ghc-6.12 and
fixed some space leaks.
http://hackage.haskell.org/package/funsat
bitset has been bumped to 1.1. New in 1.1: can easily convert between
the BitSet representation and the underlying
On Sat, Jul 4, 2009 at 08:22, Andrew Coppinandrewcop...@btinternet.com wrote:
This is irritating me now... Suppose I have something like the following:
zero = 0 :: Int
one = 1 :: Int
two = 2 :: Int
three = 3 :: Int
How do I add Haddock comments to the end of each line? For some reason,
On Fri, Apr 24, 2009 at 19:49, Edward Kmett ekm...@gmail.com wrote:
On Fri, Apr 24, 2009 at 5:11 PM, Denis Bueno dbu...@gmail.com wrote:
Is there an Ord instance that can be dynamically changed in this way?
My first idea is something like this:
data CompareRecord = CR{ rCompare :: Record
On Fri, Apr 24, 2009 at 08:40, Edward Kmett ekm...@gmail.com wrote:
The only caveat I would mention about using Data.Binary is that it traverses
lists twice to encode them. Once to determine the length and once to output
the list. As a result you may see space-leak-like behavior when encoding
Hi all,
I discussed this with a few people in #haskell-in-depth, and we
thought I should send this to the list.
The following paste shows the only changes required to remove a space
leak: http://hpaste.org/fastcgi/hpaste.fcgi/view?id=4185#a4185.
Summary: if I reduce a tuple-from-IO to whnf in
Hi all,
Suppose I have the following interface to a sorting function:
sort :: (Ord a) = [a] - IO [a] -- sort large, on-disk array of records
but I don't have a sortBy where you can simply pass a compare function.
Wrapped around this is a command-line program which should allow the
user to
On Fri, Apr 24, 2009 at 15:22, Martijn van Steenbergen
mart...@van.steenbergen.nl wrote:
Hi Denis,
Denis Bueno wrote:
where the rCompare field would be a function that is based on the
flags passed to the command-line problem. But this has an ugly
asymmetry. Does anyone have any other
.
Denis
On Wed, Apr 22, 2009 at 07:38, Denis Bueno dbu...@gmail.com wrote:
Hello again,
Here are several heap profiles for sorting 1 million entries (each
entry is 48 bytes). Each was created by passing +RTS flag -L200 to
leak.hs, where flag is one of -hc, -hd, -hy
Hello haskell-cafe,
I'm running into what I think is a space leak. I've modified
external-sort-0.2 [0] to use tournament trees for merging, and
although the block sorting works in constant space, merging seems to
produce a space leak.
The external sort works by lazily consuming an input list,
On Fri, Apr 17, 2009 at 20:41, Don Stewart d...@galois.com wrote:
dbueno:
Hi all,
In a command-line app of mine I want to have a --version flag, like
many GNU apps do to report their version. The only way I know to
provide the version number is to hardcode it in the source code
somewhere.
Hello haskell-cafe,
funsat is a modern, DPLL-style SAT solver written in Haskell. Funsat
solves formulas in conjunctive normal form and produces a total
variable assignment for satisfiable problems. Funsat is intended to
be reasonably efficient for practical problems and convenient to use
as a
Hi all,
In a command-line app of mine I want to have a --version flag, like
many GNU apps do to report their version. The only way I know to
provide the version number is to hardcode it in the source code
somewhere. That means I have the version number in two places: the
.cabal file and the
On Thu, Mar 19, 2009 at 04:42, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
Am Donnerstag, 19. März 2009 03:53 schrieb Benjamin L.Russell:
Therefore, rank 1 is the best.
This is quite the opposite of what Denis Bueno said. :-(
Ugh, I'm sorry about this. I've participated in several
On Tue, Mar 17, 2009 at 06:37, Gü?nther Schmidt gue.schm...@web.de wrote:
Hi,
How can I check which thunks are piling up on the stack?
Check out the section on retainer profiling in the Profiling memory
usage section of the GHC manual:
On Sat, Mar 14, 2009 at 09:40, Duncan Coutts
duncan.cou...@worc.ox.ac.uk wrote:
A medium term solution here should involve letting packages specify that
some of their dependencies are private, ie nothing is re-exported and
thus there is no danger of clashes.
Is the long term solution to
2009/3/12 Peter Verswyvelen bugf...@gmail.com:
I think. Or is it defined in some other package?
Note that you can get an Applicative instance for free by using
WrapMonad in Control.Applicative. For example, just today I was
writing a quickcheck Arbitrary instance, and the Gen monad doesn't
have
2009/3/11 Rick R rick.richard...@gmail.com:
I have basic beginning to a parser for the BSON spec:
http://www.mongodb.org/display/DOCS/BSON
It is basically a binary compressed form of JSON.
The usage model should be general, but I intend to read this data over TCP.
[...]
I was wondering if
I've got a small patch for Data.Binary. Should I post it here, or is
there some more appropriate forum?
http://code.haskell.org/binary/ doesn't specify.
Thanks,
Denis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Wed, Mar 11, 2009 at 20:54, Denis Bueno dbu...@gmail.com wrote:
I've got a small patch for Data.Binary. Should I post it here, or is
there some more appropriate forum?
In case whoever reads this is a Data.Binary maintainer, the patch is
now attached, to save you some work.
The .patch file
On Sun, Mar 1, 2009 at 11:56, Duncan Coutts duncan.cou...@worc.ox.ac.uk wrote:
That's because it's a bug, not a feature. :-)
Be careful of using this feature as we might fix it.
I've wished for this feature, and have Cabal files right now that
would be cleaner with it. Is there something
On Tue, Feb 3, 2009 at 14:58, rodrigo.bonifacio
rodrigo.bonifa...@uol.com.br wrote:
Hi all,
I'm trying to use the Funsat library. One of its data types is CNF:
data CNF = CNF {
numVars :: Int
numClauses :: Int
clauses :: Set Clause
}
I have a list of clauses, but I'm getting an error
On Mon, Feb 2, 2009 at 15:04, Don Stewart d...@galois.com wrote:
pocmatos:
Hi all,
Much is talked that Haskell, since it is purely functional is easier
to be verified. However, most of the research I have seen in software
verification (either through model checking or theorem proving)
On Wed, Jan 28, 2009 at 13:32, Sebastian Fischer
s...@informatik.uni-kiel.de wrote:
Simple, Incremental SAT Solving as a Library
This Haskell library provides an implementation of the
Davis-Putnam-Logemann-Loveland algorithm (cf.
2008/12/22 Andrew Wagner wagner.and...@gmail.com:
The problem here is even slightly deeper than you might realize. For
example, what if you have a list of functions. How do you compare two
functions to each other to see if they're equal? There is no good way really
to do it! So, not only is ==
Dear haskell-cafe,
I've got an anagram-finder (puzzler) that uses a dictionary datatype, which
in turn uses a trie. In src/hs/Main.hs, I create a new dictionary from a word
list (a file containing one word per line) and perform a query on it in order to
force it to actually load something from
2008/7/8 Galchin, Vasili [EMAIL PROTECTED]:
Database/HSQL.hsc:66:7:
Could not find module `System.Time':
it is a member of package old-time-1.0.0.0, which is hidden
[EMAIL PROTECTED]:~/Desktop/hsql-1.7$
I have a global ghc installation plus a local one off my user directory. In
Hi all,
It is my pleasure to announce the first reasonable release of funsat,
a modern, DPLL-style SAT solver written in Haskell. Funsat solves
formulas in conjunctive normal form and produces a total variable
assignment for satisfiable problems. It is available from Hackage:
On Fri, Jun 6, 2008 at 2:35 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
Johan Tibell wrote:
3. Lack of common interfaces.
Yes.
It's really quite frustrating that it is 100% impossible to write a single
function that will process lists, arrays, sets, maps, byte strings, etc. You
have to
On Sat, May 17, 2008 at 3:16 PM, Don Stewart [EMAIL PROTECTED] wrote:
allbery:
On 2008 May 17, at 14:52, D. Gregor wrote:
Common Lisp is a multiparadigm, general purpose programming language
that supports imperative, functional, and object-oriented programming
paradigms.
2008/5/6 Galchin, Vasili [EMAIL PROTECTED]:
2) http://hackage.haskell.org/packages/upload.html
- do I have to set up my .cabal in a special way to run dist?
I believe it works automatically, using the values of the fields you
set, e.g. Exposed-modules and
On Mon, Apr 21, 2008 at 5:21 PM, Bertram Felgenhauer
[EMAIL PROTECTED] wrote:
Denis Bueno wrote:
On Wed, Apr 16, 2008 at 2:33 PM, Bertram Felgenhauer
[EMAIL PROTECTED] wrote:
No. Data.Graph.Inductive.Query.Dominators is just buggy.
[...]
Here's a quick fix:
Thanks
On Sat, Apr 19, 2008 at 10:56 AM, Andrew Coppin
[EMAIL PROTECTED] wrote:
Can anybody explain any of this behaviour? I have no idea what I'm
benchmarking, but it certainly doesn't appear to be the performance of a
parallel merge sort!
It would be much easier to draw sound conclusions if you
On Wed, Apr 16, 2008 at 2:33 PM, Bertram Felgenhauer
[EMAIL PROTECTED] wrote:
No. Data.Graph.Inductive.Query.Dominators is just buggy.
[...]
Here's a quick fix:
Thanks! This fixes my problem.
Have you submitted a bug and your patch to the appropriate tracker?
If not, would someone point me
On Thu, Apr 17, 2008 at 11:32 AM, Denis Bueno [EMAIL PROTECTED] wrote:
On Wed, Apr 16, 2008 at 2:33 PM, Bertram Felgenhauer
[EMAIL PROTECTED] wrote:
No. Data.Graph.Inductive.Query.Dominators is just buggy.
I have one more problem. For the attached graph, the dominators of
the -20 node
On Thu, Apr 17, 2008 at 5:52 PM, Dan Weston [EMAIL PROTECTED] wrote:
Your reasoning differs from the usual understanding of a null product (1 or
True), as compared to a null sum (0 or False):
the list of nodes for which
*any path* from source to x must touch, i.e., the list of dominators
On Wed, Apr 16, 2008 at 12:02 AM, John Goerzen [EMAIL PROTECTED] wrote:
Hi,
I'm pleased to announce the first release of datapacker.
Your datapacker depends on MissingH 1.0.1 which, although on hackage,
fails to build with GHC 6.8.2. (It may build with earlier versions,
but I haven't tried.)
I'm using the Data.Graph.Inductive.Query.Dominators library
(http://haskell.org/ghc/docs/latest/html/libraries/fgl/Data-Graph-Inductive-Query-Dominators.html)
with GHC 6.8.2.
The library is a bit spare on comments, so I may or may not be using
it correctly.
My goal is to compute the set of nodes
On Tue, Mar 11, 2008 at 4:01 AM, Adrian Hey [EMAIL PROTECTED] wrote:
and sorting is
meant to be a permutation, so we happily have the situation where this
has a correct answer: 2.
Anything else is incorrect.
Isn't 3 also a permutation? Why is it incorrect?
Because it is not
On Mon, Mar 10, 2008 at 10:10 AM, Adrian Hey [EMAIL PROTECTED] wrote:
The Eq instance you've given violates the law that (x == y) = True
implies x = y. Of course the Haskell standard doesn't specify this law,
but it should.
Unless I'm missing something obvious, the example Neil gave
On Mon, Mar 10, 2008 at 12:19 PM, Adrian Hey [EMAIL PROTECTED] wrote:
Denis Bueno wrote:
On Mon, Mar 10, 2008 at 10:10 AM, Adrian Hey [EMAIL PROTECTED] wrote:
The Eq instance you've given violates the law that (x == y) = True
implies x = y. Of course the Haskell standard doesn't
On Mon, Mar 10, 2008 at 3:12 PM, Neil Mitchell [EMAIL PROTECTED] wrote:
Hi
The Ord class is used for totally ordered datatypes.
This *requires* that it be absolutely impossible in valid code to
distinguish equivalent (in the EQ sense, not the == sense) things via
the
On Sat, Mar 8, 2008 at 12:29 AM, Xiao-Yong Jin [EMAIL PROTECTED] wrote:
I'm using STUArray in some of my time critical number
crunching code. I would like to know some way to catch the
exceptions raised in the ST monad, ie. ArrayException.
I am also using STUArray from some time-critical
On Sat, Mar 8, 2008 at 9:54 AM, Xiao-Yong Jin [EMAIL PROTECTED] wrote:
ArrayException? If it is out-of-bounds reading or writing, surely
that indicates a bug in your program that you'd rather fix than catch
the exception, no?
In my case, because I choose a index of the array according
On Wed, Feb 27, 2008 at 2:01 AM, Judah Jacobson
[EMAIL PROTECTED] wrote:
Hi Denis,
I was unable to run your program; it looks like there's a missing
module 'Properties'. To include it in the sdist you probably need to
add it under the other-modules field in the .cabal file.
Sorry about
On Wed, Feb 27, 2008 at 12:06 AM, [EMAIL PROTECTED] wrote:
Fortuitously, I recently came across a bunch of bioinformatics software in
Haskell. One of the libraries was called 'interlude', and it claims to be
able to give line locations for errors in the Prelude. I was intending to
upload
Hi all,
I've got some code crashing with Prelude.foldr1: empty list. In
GHCi, the code uses too much memory (I kill it after it consumes 1GB)
to be able to use :trace and :history, but I just found out about the
-xc RTS option. I tried that, and I get the following:
GHC.List.CAFdsat:
On Mon, Feb 11, 2008 at 5:05 PM, Don Stewart [EMAIL PROTECTED] wrote:
I've recently done a small Haskell port of some OCaml code from a
paper entitled SAT-MICRO: petit mais costaud! It's a tiny (one
emacs buffer for the algorithm, ~160 lines overall) DPLL SAT solver
with
On Thu, Feb 14, 2008 at 2:55 PM, Don Stewart [EMAIL PROTECTED] wrote:
You can use the profiler to get a stack trace, or use the new
GHCi debugger to step backwards from the exception to the source.
I wrote a bit of a tutorial for this here:
On Mon, Feb 11, 2008 at 5:05 PM, Don Stewart [EMAIL PROTECTED] wrote:
Have you thought about uploading it to hackage.haskell.org?
We've got some similar stuff up there already,
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/sat-1.1.1
so feel free to upload this code!
Hi all,
I've recently done a small Haskell port of some OCaml code from a
paper entitled SAT-MICRO: petit mais costaud! It's a tiny (one
emacs buffer for the algorithm, ~160 lines overall) DPLL SAT solver
with non-chronological backtracking, implemented using the Cont monad
and callCC. If
On Feb 6, 2008 9:00 AM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Wed, 6 Feb 2008, Matthew Pocock wrote:
class Buildable b where
empty :: b a --makes an empty b with elements of type a
insert :: a - b a - b a --inserts the new element into the buildable
How can this interface be
On Feb 6, 2008 9:40 AM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Wed, 6 Feb 2008, Denis Bueno wrote:
On Feb 6, 2008 9:00 AM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Wed, 6 Feb 2008, Matthew Pocock wrote:
class Buildable b where
empty :: b a --makes an empty b
On Feb 6, 2008 10:36 AM, Henning Thielemann
[EMAIL PROTECTED] wrote:
type SomethingWithKV k a = KV {getKV :: (k, a)}
instance Buildable (Map k a) (SomethingWithKV k a) where
empty = Map.empty
insert s m = uncurry Map.insert (getKV s) m
I have done this before -- it's very
On Jan 28, 2008 12:45 AM, [EMAIL PROTECTED] wrote:
It seems strange that you need the types e and e' (perhaps this is a
quirk or a bug of GHC 6.8). With GHC 6.6, I have derived the following
instance (Floating f, MetricSpace e f, HFoldr ApplyDistSum Float l1 f,
HZip (HCons e l)
= do
ref - newSTRef s
runReaderT (internalRunStateST m) ref
-- ryan
On Feb 2, 2008 9:05 AM, Derek Elkins [EMAIL PROTECTED] wrote:
On Sat, 2008-02-02 at 12:33 -0500, Denis Bueno wrote:
Is it possible to use the ST monad as a (drop-in) replacement for the
State monad
On Fri, Feb 1, 2008 at 9:03 AM, Loup Vaillant [EMAIL PROTECTED] wrote:
I have read quite a lot of Haskell papers, lately, and noticed that
the number 42 appeared quite often, in informal tutorials as well as
in very serious research papers. No wonder Haskell is the Answer to
The Great
On Fri, Feb 1, 2008 at 9:19 AM, Janis Voigtlaender
[EMAIL PROTECTED] wrote:
I think Loup is aware of the hitchhiker books (see the reference to the
Great Question of ... Everything).
Ah, I didn't read that correctly. I assumed that something he read
something that had described Haskell as
On Thu, Jan 31, 2008 at 7:11 PM, Jon Harrop [EMAIL PROTECTED] wrote:
Has anyone written anything on the use of FP (e.g. point free style) in
linear
algebra problems?
I'm not sure how relevant this is to you, but John Backus wrote
foundationally on it and related topics.
On Sat, Jan 26, 2008 at 1:59 AM, [EMAIL PROTECTED] wrote:
[snip useful explanation of error}
Here's a
bit elaborated example:
[...]
Thanks! this works, and I understand why it didn't before.
The example I posted was a stepping stone toward a definition of
distance using hFoldr and hZip.
On Sat, Jan 26, 2008 at 11:03 AM, Denis Bueno [EMAIL PROTECTED] wrote:
Have I made some sort of simple error, or am I going about this the
wrong way altogether?
After some fooling around, I came up with something I think makes
sense. Let me know if this is the right/wrong thing. It seems
Hello all,
I'm doing some machine learning in Haskell and have run into a
problem. I have a generic distance function (declare in the
MetricSpace) typeclass that returns the distance between two things as
a number. I frequently will be working with heterogeneous collections
of data, and if
On 12/12/07, Bill Wood [EMAIL PROTECTED] wrote:
On Wed, 2007-12-12 at 11:19 +, Andrew Coppin wrote:
. . .
...and normal programmers care about the Fibonacci numbers because...?
Seriously, there are many, many programmers who don't even know what
Fibonacci numbers *are*. And even I
On Dec 6, 2007 10:50 AM, Neil Mitchell [EMAIL PROTECTED] wrote:
So now, if there is a function you are looking for in the core
libraries which you can't find, tell me. Equally, if any of the
documentation links lead to a 404, please do tell me.
Thanks for your work on Hoogle! It is an
On Dec 3, 2007 6:55 AM, PR Stanley [EMAIL PROTECTED] wrote:
Hi
I've probably asked about the do construct, if that's the right
label. Unfortunately I'm still not quite sure of its role and more
specifically its syntax. Something to do with generators perhaps? A
description plus some examples
On 03 Dec 2007, at 13:25 , Tim Newsham wrote:
Probably one should understand how to use monads before worrying
about
the do-notation. Here are some references:
I don't totally agree. You can teach monads to beginners just fine
using the do-notation. Unsuprisingly its very much like
On Nov 16, 2007 12:05 PM, Valery V. Vorotyntsev [EMAIL PROTECTED] wrote:
On 11/16/07, Brent Yorgey [EMAIL PROTECTED] wrote:
Nice! Is there a way to have this only run if the current buffer is in
haskell-mode? I'd add it myself but I've not yet taken the plunge to being
an elisp hacker.
On Nov 15, 2007 7:25 AM, Philip Armstrong [EMAIL PROTECTED] wrote:
On Thu, Nov 15, 2007 at 02:56:32PM +0900, Daisuke IKEGAMI wrote:
Dear Stefan and Haskell-Cafe,
Thanks to keeping your interest to the flymake-mode for Haskell.
Stefan wrote:
Could you explain to me what
On Nov 7, 2007 4:44 PM, David Benbennick [EMAIL PROTECTED] wrote:
And
once you do hGetContents, you have read all the data that will ever
exist on that handle, so there's nothing to read from it later on.
I completely misunderstood how hGetContents works. This now makes
sense. I first
On Nov 6, 2007 10:15 PM, David Benbennick [EMAIL PROTECTED] wrote:
What about using hGetContents to just read ALL of the input, as a lazy
string? Then you look through that string for success or failure. In
other words,
readACL2Answer pout = do
s - hGetContents pout
parse s here
Hi all,
I'm writing some code to interact with an ACL2 [0] process. I'd like
to be able to write a function
test :: String - IO Bool
that will attempt to prove something by forking an ACL2 process and
screen scraping its output, to see whether the conjecture was proved.
The code below [1]
70 matches
Mail list logo
