Hi Jun Jie:
SBV uses some of the not-yet-officially-released features in Z3. The
version you have, while it's the latest official Z3 release, will not work.
To resolve, you need to install the development version of Z3 (something
that is at least 4.3.2 or better). Here're instructions from the
Hi Niklas,
* PSQueue throws a stack space overflow if you try to put in 10
* Ints
A slightly different implementation is used in GHC:
https://github.com/ghc/packages-base/blob/master/GHC/Event/PSQ.hs
Could you test it? If this code also has the same problem, I need to
fix it.
On Fri, 29 Mar 2013, Niklas Hambüchen wrote:
(This is a slightly detailed email. If you are the maintainer of one of
the packages benchmarked here, you might want to read it though.)
Could you please put your experiences the Wiki? This would help others to
choose a package.
Dear Levent,
Thank you for your support. I am very honoured to have the developer of the
SBV package to solve my elementary problem. I noticed that the
counter-example given by my Z3 differs from the one said on HackageDB:
sbv-2.10.
Code that is on Hackage:
Prelude Data.SBV prove $ forAll [x]
Thanks John.
I was indeed thinking to Maybe and the monad bindings,
and LYAH, or http://book.realworldhaskell.org/read/error-handling.html
the problems is I cannot uses these links in isolation ( to a Non haskellers)
because they mention Monads, Lazyness, Algebric types, all this
The link to LYAH that John provided,
http://learnyouahaskell.com/making-our-own-types-and-typeclasses ,
doesn't mention monad at all.
Laziness is mentionned only once while explaining recursive types, but
you could omit that line.
Now Algebraic is mentionned 6 times, but if you're afraid it
On Thu, 28 Mar 2013 19:08:46 +0100, Roger Mason rma...@mun.ca wrote:
I installed ghc (7.6.2) on an Arch Linux machine. I'm trying to install
pandoc via cabal but it fails:
...
Configuring text-0.11.2.3...
Warning: This package indirectly depends on multiple versions of the same
package.
Peter Althainz wrote:
Hi Heinrich:
Its simply the types are more cumbersome, now. In netwire you basically
have one type, which is Wire with some type parameters
(underlying monad, inhibition type, in-type, out-type), When underlying
monad and inhibition type is choosen, you can define
Thank you for your response. 'ghc-pkg check' shows some problems:
http://pastebin.ca/2344794
On 03/28/2013 08:01 PM, Patrick Wheeler wrote:
So I printed off the requirements for pandoc on a empty ghc-7.6.2
install you can find it at:
http://hpaste.org/84794
I do not see any odd package
Hello,
On 03/29/2013 06:47 AM, Henk-Jan van Tuyl wrote:
On Thu, 28 Mar 2013 19:08:46 +0100, Roger Mason rma...@mun.ca wrote:
I installed ghc (7.6.2) on an Arch Linux machine. I'm trying to
install pandoc via cabal but it fails:
...
Configuring text-0.11.2.3...
Warning: This package
You're welcome Jun Jie.
Regarding getting a different counter example: That's perfectly normal. When
SMT solvers build models they use random seeds. Furthermore, different versions
of the same solver can use different algorithms/heuristics to arrive at the
falsifying model. So, it's entirely
Sorry, there were a couple of typos in the last example. It should read:
allSat $ \(x::SWord8) - x `shiftL` 2 ./= x
Note that this will return all 255 values that satisfy this property; i.e.,
everything except 0. (Here, we're using sat/allSat as opposed to prove,
and hence the
Hello,
On 03/29/2013 08:13 AM, Roger Mason wrote:
Hello,
It appears in my case that cabal may be looking in a strange place for
installed pacckages. At least, that is how I interpret the output I
just pasted here:
http://pastebin.ca/2344794
Thanks,
Roger
ghc-pkg check showed that there
I do not know why it overflows. It's been a while, but isn't the answer
usually too much laziness? Maybe try changing the foldr in fromList to
foldr'? I would try it out quickly but do not have ghc installed on any
computers here.
I am happy start a repo for this library, but there is not much
Hey Scott,
I quickly tried your suggestion, plugging in foldr' from Data.Foldable
and sprinkling a few seqs in some places, but it doesn't help the stack
overflow.
On Fri 29 Mar 2013 16:23:55 GMT, Scott Dillard wrote:
I do not know why it overflows. It's been a while, but isn't the
answer
I had a 5 second look at the PSQueue implementation and here's what I got
so far:
* fromList should use foldl'.
* LTree should be spine strict (i.e. strict in the (LTree k p) fields).
* Winner should be strict in the (LTree k p) field and probably in all
other fields as well.
This is a nice
Hey Kazu,
I added GHC's PSQ to the benchmark, the new figures are on
http://htmlpreview.github.com/?https://raw.github.com/nh2/psqueue-benchmarks/master/report.html
No, it does not stack overflow, and it seems to perform slightly better
than the other implementations; it also doesn't suffer from
Corrected, little bit slower on 64 bit but much faster on 32 bit version.(also
made hashmap grow from small default size as it is becnh
req)http://benchmarksgame.alioth.debian.org/u32q/program.php?test=knucleotidelang=ghcid=228
secs for 32
Bearing in mind that I haven't looked at this in several years...
Why did you switch from queuelike to pqueue?
Because I liked the API better?
Could you put the code up somewhere manageable (repo)?
I had it up on darcs, but since that's not there any more, I don't have any
more source
On Fri, 29 Mar 2013, Louis Wasserman wrote:
Bearing in mind that I haven't looked at this in several years...
Why did you switch from queuelike to pqueue?
Because I liked the API better?
Could you put the code up somewhere manageable (repo)?
I had it up on darcs, but since that's not
Call for Copy: The Monad.Reader - Issue 22
Another ICFP submission deadline has come and gone: why not celebrate by
submitting something to The Monad.Reader? Whether you're an established
academic or have only just started learning Haskell, if you
Hey Louis,
I think that queuelike is still a nice psqueue implementation (and I
personally don't dislike the api), so may I ask two more questions:
* Do you have any clue why toList is 10 times slower than in the other
implementation? It is based on extract, and queuelike's extract is very
fast
I don't remember the answer to either of your questions, I'm afraid --
queuelike was last updated in 2009 (!), and that's really the last time I
looked at it. That said, I'm not sure I follow how queuelike is a psqueue
at all as opposed to a pqueue?
Louis Wasserman
wasserman.lo...@gmail.com
Does that mean the repo is still there without web access or gone?
On 29/03/13 20:14, Henning Thielemann wrote:
Was it on code.haskell.org? Then it might have been moved to a non-web
directory after the last attack 2011.
___
Haskell-Cafe mailing list
On Fri, 29 Mar 2013, Niklas Hambüchen wrote:
On 29/03/13 20:14, Henning Thielemann wrote:
Was it on code.haskell.org? Then it might have been moved to a non-web
directory after the last attack 2011.
Does that mean the repo is still there without web access
I assume that.
or gone?
If
Heinrich Apfelmus apfel...@quantentunnel.de wrote:
In the case of HGamer3D, the sink combinator would replace the need to
declare a final wire which runs all the wires at each step. It
feels a bit weird to me to have wires like guiSetPropW that perform
side effects, i.e. where it makes a
Here's an idea. For the -pgmF flag, because compile errors become
really obscure and line numbers rendered unhelpful, why don't we use
source maps as recently done for JavaScript in the browser?
Info:
https://wiki.mozilla.org/DevTools/Features/SourceMap
Hi Niklas,
No, it does not stack overflow, and it seems to perform slightly better
than the other implementations; it also doesn't suffer from the toList
slowness problem as does listlike.
Thanks. It's nice.
However, it is probably not as generally usable as it hardcodes the
priorities to
Hi, all,
Pen note-taking program hoodle, which is being developed entirely in
haskell, is updated to version 0.2.
The previous version was 0.1.1.
About what is hoodle, please refer to http://ianwookim.org/hoodle
The changes in this version are
- hoodle data format updated. now hoodle document
29 matches
Mail list logo
