2009/3/31 John Lask jvl...@hotmail.com:
we get the following message when we load into ghci (6.8.2)
Var/Type length mismatch:
[]
[base:GHC.Base.(){(w) tc 40}]
is this a bug? if not, what is this message telling us ?
I can't reproduce it with 6.10.1, so I presume it is a now-fixed 6.8
Max Bolingbroke wrote:
2009/3/31 John Lask jvl...@hotmail.com:
we get the following message when we load into ghci (6.8.2)
Var/Type length mismatch:
[]
[base:GHC.Base.(){(w) tc 40}]
is this a bug? if not, what is this message telling us ?
I can't reproduce it with 6.10.1, so I presume
On Mon, Mar 30, 2009 at 9:46 PM, Gü?nther Schmidt gue.schm...@web.de wrote:
Thanks Don,
I followed some examples but have not yet seen anything that would show me
how, for instance, turn a nested Map like
Map Int (Map Int (Map String Double)
into a zipped version.
That is presuming of
Great work. However I am have a problem running on windows - it needs
librsvg:
Prelude System.Vacuum.Cairo view [1]
Loading package mtl-1.1.0.2 ... linking ... done.
Loading package parallel-1.1.0.0 ... linking ... done.
Loading package glib-0.10.0 ... linking ... done.
Loading package
I have this problem too, but I don't understand it because
librsvg-2-2.dll is in the same directory as the rest of the gtk2hs DLLs
- c:/gtk2hs/0.10.0/bin on my system. Yesterday I was also having trouble
with not being able to find the glib DLL but that problem has
mysteriously vanished today
Perhaps an example will help.
Here's a useful operation on lists:
grab :: [a] - [(a, [a])]
grab [] = []
grab (x:xs) = (x, xs) : [ (y, x : ys) | (y,ys) - grab xs ]
This takes a list and gives you a new list with one element extracted
from the original list:
ghci grab [1,2,3,4]
Hello café,
I want to replace the -fglasgow-exts in the snippet below by LANGUAGE
pragmas. Rank2Types alone doesn't suffice. Which do I need to get the
snippet to compile?
{-# OPTIONS -fglasgow-exts #-}
module RunMud where
import Control.Monad.State
type Mud = StateT MudState IO
On Mon, Mar 30, 2009 at 5:16 PM, Vlad Dogaru ddv...@anaconda.cs.pub.ro wrote:
Hello everyone,
I am writing to judge interest in a Summer of Code proposition: an XML
Schema[1] implementation, described as a possbile application here[2].
As both a tool and an inspiration, I intend to use
appendU is strict, insertWith just doesn't force it (follow the source link
in the haddocks to see why).
Ok, I see.
But, IMHO, this should be clearly documented.
There seems to be some agreement that strict variant operations should
also be provided, but it needs some more thinking, and
Can I close this ticket as not being to do with uvector?
-- Don
You did notice the suggestion that performance of uvector and bytestring
could be improved drastically if compile-time fusion would be augmented
with runtime fusion?
Claus
Vlad,
Some time ago I wrote a generic Haskell data type to XML/XSD
library[1]. It was based on an old singleton version of the
multirec[2] generic programming library. I never released any of it
because it is not really usable in a serious setting but you might
want to look at it for
Hi,
Martijn van Steenbergen martijn at van.steenbergen.nl writes:
Hello café,
I want to replace the -fglasgow-exts in the snippet below by LANGUAGE
pragmas. Rank2Types alone doesn't suffice. Which do I need to get the
snippet to compile?
Works for me with
{-# LANGUAGE Rank2Types,
On Mar 31, 2009, at 7:40 AM, Don Stewart wrote:
I am pleased to announce the release of vacuum-cairo, a Haskell
library
for interactive rendering and display of values on the GHC heap using
Matt Morrow's vacuum library.
Awesome! I want to try this.
I have problems though installing it on
Claus Reinke ha scritto:
appendU is strict, insertWith just doesn't force it (follow the
source link
in the haddocks to see why).
Ok, I see.
But, IMHO, this should be clearly documented.
There seems to be some agreement that strict variant operations should
also be provided, but it needs
Max,
If you want to look at a simple example, look at the Inf.hs example
included in the package.
It's very simple, and ghc generates fantastically bad code for it.
It would be great if you could nail down why it's so amazingly unoptimal.
Even with everything inlined and no overloading left, ghc
On Mon, Mar 30, 2009 at 11:03 PM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Sun, 29 Mar 2009, John Lato wrote:
On Sat, Mar 28, 2009 at 9:49 PM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Sat, 28 Mar 2009, John Lato wrote:
Honestly, me neither, until
Claus Reinke ha scritto:
Can I close this ticket as not being to do with uvector?
-- Don
You did notice the suggestion that performance of uvector and bytestring
could be improved drastically if compile-time fusion would be augmented
with runtime fusion?
The storablevector package
Hi,
I have tried to install the newest available binary distribution of GHC for
AIX (6.8.2).
Unfortunately, it didn't work properly. Following the trivial installation
steps as described
in INSTALL file I executed the following commands:
1) ./configure --prefix=/home/nik/local
2) gmake
On Mar 31, 2009, at 12:16 AM, Vlad Dogaru wrote:
More specifically, I would be interested in the degree the Haskell
community uses XML Schema, and if you were tempted to use it if we had
an implementation. To further expand the question, how useful do you
consider each of these components:
* a
I am reading the book The lambda calculus: Its syntax and Semantics in the
chapter about Godel Numbering but I am confused in some points.
We know for Church Numerals, we have Cn = \fx.f^n(x) for some n=0,
i.e. C0= \fx.x and C
1 = \fx.fx.
From the above definition, I could guess the
Is there anyone here with experience in screencasting of text-based
applications, who could offer advice on how to produce screencasts
on windows/xp? The basic screencasting (capture+annotation/editing)
is not the problem, eg, CamStudio seems ok, and Wink gives me
more control for mostly
On Mon, 2009-03-30 at 20:54 +0100, Lennart Augustsson wrote:
I wasn't questioning the utility of John's library.
But I saw him mentioning unary numbers and I think it's a mistake to
use those for anything practical involving even moderately sized
numbers.
Also agreed! tfp supports rational
Unfortunately the .DMG based frameworks do not have the cairo svg
framework (or the opengl framework), and it's non-trivial to get it
added on. If you need it, best bet right now is probably to go for a
macports install.
-Ross
On Mar 31, 2009, at 8:01 AM, Sebastian Fischer wrote:
On
What is the suggested (if any) convention for inserting an interactive
session in the documentation?
You may want to look at:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/DocTest
Wouter
___
Haskell-Cafe mailing list
On Tue, Mar 31, 2009 at 03:01:52PM +0100, Claus Reinke wrote:
Is there anyone here with experience in screencasting of text-based
applications, who could offer advice on how to produce screencasts
on windows/xp? The basic screencasting (capture+annotation/editing)
is not the problem, eg,
Is there a Mac OSX packaging team?
sebf:
On Mar 31, 2009, at 7:40 AM, Don Stewart wrote:
I am pleased to announce the release of vacuum-cairo, a Haskell
library
for interactive rendering and display of values on the GHC heap using
Matt Morrow's vacuum library.
Awesome! I want to try
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Claus Reinke
The problem comes when trying to scale down the size to
what would fit in a browser window (what a viewer would see,
without having to scroll around) - text becomes hard to read
(+ 1)
A year or so ago I wanted to create a Collada importer. Collada comes with
an XML Schema, so I wanted to automatically make a parser for that. But no
tool existed :(
Note that an existing tool from Microsoft failed on the Collada
Maybe GHCi has a bug when it comes to DLL lookup.
I had an application that worked fine when compiled with GHC, but failed
with GHCi (libglew.dll not found)
I used procmonhttp://technet.microsoft.com/en-us/sysinternals/bb896645.aspx
to
monitor which files the GHC* processes searched, and it
Wouter Swierstra ha scritto:
What is the suggested (if any) convention for inserting an interactive
session in the documentation?
You may want to look at:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/DocTest
Ah, ok, thanks.
So convention is to just use `-- `.
Manlio
This is AWESOME! If only I had this when I started learning Haskell :-)
On Tue, Mar 31, 2009 at 7:40 AM, Don Stewart d...@galois.com wrote:
I am pleased to announce the release of vacuum-cairo, a Haskell library
for interactive rendering and display of values on the GHC heap using
Matt
Robert Greayer wrote:
With some more context:
foo = ($expr 1 + 2)
v.
bar = [$expr| 1 + 2]
In the first example (assuming TH is enabled), $expr is a splice, which happens at compile
time. 'expr' is some value of type Q Exp (the AST for a Haskell expression, in the quotation
monad). The
On 2009 Mar 31, at 8:01, Sebastian Fischer wrote:
$ cabal install vacuum-cairo
Resolving dependencies...
cabal: cannot configure vacuum-cairo-0.3.1. It requires svgcairo -any
There is no available version of svgcairo that satisfies -any
This is looking for the Haskell svgcairo package, in
Don Stewart:
Is there a Mac OSX packaging team?
Unfortunately, it's not just a packaging problem. (Well, packing of
Haskell libraries, that is.)
There are two version of GTK+ Mac OS X: (1) the MacPorts version and
(2) a native GTK+ framework.
Unfortunately, both are not satisfactory.
On Mar 31, 2009, at 7:15 PM, Brandon S. Allbery KF8NH wrote:
cabal: cannot configure vacuum-cairo-0.3.1. It requires svgcairo -any
There is no available version of svgcairo that satisfies -any
This is looking for the Haskell svgcairo package, in other words the
Haskell binding for the
Andrew Coppin wrote:
| Is there some reason why you can't have antiquoting with normal TH?
|
| I'm just trying to make sure I've understood QQ correctly...
With TH, it might not be necessary (depending on the situation)...
{-# OPTIONS_GHC -XTemplateHaskell #-}
module QT where
import
Love it when I see synchronised announcements, and video. I'll reply
over here even though Dons posted the vids. Thanks guys, this is great
stuff and I already found it quite educational!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I ran the following program:
module Main where
main = do
putStrLn Key
c - getChar
print c
main
Unfortunately, it doesn't do what I was hoping. Specifically, it only
returns any data when I hit [return]. It also seems to be giving me a
command history somehow. Special keys (e.g.,
DISCLAIMER: The last I studied this was over 20 years ago, so my brain
is seriously rusty. You are warned...
you mean the godel function (denoted by # and generally will be in type,
#:term - number ?) is a kind of functions instead of a particular
function?
No. The Godel mirror function (as
Edward Kmett wrote:
You want to use:
main = do hSetBuffering stdin NoBuffering; c - getChar
Already tried that. It appears to make no difference.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
What I've learned: Zippers are structured collections[1] with a
focus. Through a Zipper you can O(1) change the value of the focused
element: that's the fundamental property. In addition, you can change
the focus through a series of moving functions.
To clarify: there is no magic that turns
On Tue, Mar 31, 2009 at 10:13 PM, Dan Weston weston...@imageworks.com wrote:
What I've learned: Zippers are structured collections[1] with a
focus. Through a Zipper you can O(1) change the value of the focused
element: that's the fundamental property. In addition, you can change
the focus
Dear all,
I am releasing a preliminary version of satchmo,
a monadic library for encoding boolean
and integral number constraints to CNF-SAT.
It uses minisat (http://minisat.se/) as a backend solver.
http://dfa.imn.htwk-leipzig.de/satchmo/
Andrew Coppin wrote:
Edward Kmett wrote:
You want to use:
main = do hSetBuffering stdin NoBuffering; c - getChar
Already tried that. It appears to make no difference.
Really? It fixes your first issue for me (data appears immediately
when the key is pressed) but obviously does nothing to
On Tue, Mar 31, 2009 at 12:53 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Edward Kmett wrote:
You want to use:
main = do hSetBuffering stdin NoBuffering; c - getChar
Already tried that. It appears to make no difference.
Sounds like you're on Windows, so it's probably this bug:
Judah Jacobson wrote:
Sounds like you're on Windows, so it's probably this bug:
http://hackage.haskell.org/trac/ghc/ticket/2189
I am on Windows. It looks like my programs are running editline or
something to give a command history. Ordinarily that would actually be
quite useful, but for
On Tue, Mar 31, 2009 at 2:11 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Judah Jacobson wrote:
Sounds like you're on Windows, so it's probably this bug:
http://hackage.haskell.org/trac/ghc/ticket/2189
I am on Windows. It looks like my programs are running editline or something
to
Hi everyone on haskell-cafe,
I am wondering about how to give a correctness prove of a simple parsing
algorithm. I tried to think of a simple example but even in this case I
don't know how. I have an abstract syntax:
data Parens = Empty | Wrap Parens | Append Parens Parens
assumption (A), in
I am trying to write out the execution of the recursive calls in mkDList
examplehttp:/http://www.haskell.org/haskellwiki/Tying_the_Knot/www.haskell.org/haskellwiki/Tying_the_Knotfor
different size lists. Is there a way in ghc, or ghci where for a
given
list I can see the intermediate recursive
Hi muad,
muad wrote:
I think I can write such a function in a few different ways, but I don't
know how to prove this code works, could anybody show me how?
Why don't you pick a specific implementation first and share it with us?
The proof heavily depends on the precise implementation.
Hi,
The Summer of Code student application deadline is April 3rd and we
need more applications! If you have an idea that you would like to
hack on this summer hurry up and apply.
Here's an idea that could be implemented in a summer:
A Sawzal [1]l like library that processes large volumes of
I'm proud to announce release 0.4.4 of Leksah, the Haskell IDE written
in Haskell.
Leksahs current features include:
* On the fly error reporting with location of compilation errors
* Completion
* Import helper for constructing the import statements
* Module browser with
I'm busy writing my first library for Hackage - a wrapper for QuesoGLC, yet
another OpenGL font renderer using Freetype2. So if someone else is already
doing this, stop doing so :-)
I've succesfully build the libquesoglc.a library from C source, and can
build my Haskell tutorial file using
ghc
J__rgen Nicklisch-Franken j...@arcor.de wrote:
So I please the members of the community to pause for a moment and try
out Leksah with a benevolent attitude.
I did (the previous version, tbh), and couldn't find anything to
seriously bicker about... a few problems regarding metadata generation,
Alberto G. Corona wrote:
however, It happens that fails in my windows box with ghc 6.10.1 , single
core
here is the code and the results:
---begin code:
module Main where
import Control.Concurrent.STM
import Control.Concurrent
import System.IO.Unsafe
import GHC.Conc
G'day all.
Quoting Gü?nther Schmidt gue.schm...@web.de:
my quest for data structures continues. Lately I came across Zippers.
Can anybody point be to some useful examples?
This is a good example, currently in use in GHC:
http://www.cs.tufts.edu/~nr/pubs/zipcfg-abstract.html
Cheers,
On 2009 Mar 31, at 13:52, Sebastian Fischer wrote:
On Mar 31, 2009, at 7:15 PM, Brandon S. Allbery KF8NH wrote:
cabal: cannot configure vacuum-cairo-0.3.1. It requires svgcairo -
any
There is no available version of svgcairo that satisfies -any
This is looking for the Haskell svgcairo
Cristiano Paris wrote:
On Tue, Mar 31, 2009 at 10:13 PM, Dan Weston weston...@imageworks.com wrote:
What I've learned: Zippers are structured collections[1] with a
focus. Through a Zipper you can O(1) change the value of the focused
element: that's the fundamental property. In addition, you
2009/4/1 Daryoush Mehrtash dmehrt...@gmail.com
I am trying to write out the execution of the recursive calls in mkDList
examplehttp:/http://www.haskell.org/haskellwiki/Tying_the_Knot/www.haskell.org/haskellwiki/Tying_the_Knotfor
different size lists. Is there a way in ghc, or ghci where for
I am interested in reasoning about a code, say for example:
data DList a = DLNode (DList a) a (DList a)
mkDList :: [a] - DList a
mkDList [] = error
http://haskell.org/ghc/docs/latest/html/libraries/base/Prelude.html#v:error
must have at least one element
mkDList xs = let (first,last
Manlio Perillo wrote:
By the way, about insertWith/alter; from IntMap documentation:
insertWithKey: O(min(n,W)
alter: O(log n)
So, alter is more efficient than insertWithKey?
And what is that `W` ?
As Claus says it's the maximum (value of Int; number of keys). It's in
an easily overlooked
Gü?nther Schmidt wrote:
Thanks Don,
I followed some examples but have not yet seen anything that would show
me how, for instance, turn a nested Map like
Map Int (Map Int (Map String Double)
into a zipped version.
You can't. Or rather, you can't unless you have access to the
John Tromp wrote:
I am reading the book The lambda calculus: Its syntax and Semantics in the
chapter about Godel Numbering but I am confused in some points.
We know for Church Numerals, we have Cn = \fx.f^n(x) for some n=0,
i.e. C0= \fx.x and C
1 = \fx.fx.
From the above definition, I could
I know its 1. of April, but when I wrote that I started with Leksah June 1997
it was no intentional joke, it was just late at night. I started June 2007.
Jürgen
jutaro wrote:
I'm proud to announce release 0.4.4 of Leksah, the Haskell IDE written
in Haskell.
Leksahs current features
On Tue, Mar 31, 2009 at 11:44 PM, wren ng thornton w...@freegeek.org wrote:
Another tricky thing for this particular example is answering the question
of what you want to call the focus. Usually zippered datastructures are
functors, so given F X we can pick one X to be the focus and then unzip
65 matches
Mail list logo
