+1, better cabal support for UHC's JS backend would be a big win.
Daniel
2012/3/11 Jurriën Stutterheim j.stutterh...@me.com:
While I might be a bit biased (I spent a good deal of time working on
improving the UHC JS backend), I think there are a lot of opportunities to
get Haskell as a
Jurriën Stutterheim wrote:
Currently, however, it is still a bit of a pain to compile larger UHC
JS projects, since Cabal support for UHC's different backends is
limited. This could be one potential goal for your GSoC project: make
it possible to type `cabal configure cabal build` and find a
That sound like a really cool project. Where could I get more information
about what could I do?
You mention about contacting but I think it's better to keep the discussion
open for everybody.
Alejandro
2012/3/11 Jurriën Stutterheim j.stutterh...@me.com
While I might be a bit biased (I spent a
Once the Mac Haskell Platform installer is updated, it should no longer be
needed to install Xcode. Then it should be enough to install the Command Line
Tools package from https://developer.apple.com/downloads/ which is just a 171Mb
download instead of the 1.85Gb for the whole Xcode toolset.
The link I mentioned in my previous email contains pretty much all of the
currently available public information about the UHC JS backend (the Improving
the UHC JavaScript Backend report is already slightly outdated, due to an API
change, though). My report also contains some ideas for future
The Category law would be broken, though:
unawait x id == yield x !== unawait x
How did you get this equation? It's not even well-typed:
unawait :: a - Pipe a b m ()
yield :: b - Pipe a b m ()
Someone actually implemented a variation of Pipes with unawait:
On 2012-03-11 14:09, Paolo Capriotti wrote:
The Category law would be broken, though:
unawait x id == yield x !== unawait x
How did you get this equation? It's not even well-typed:
unawait :: a - Pipe a b m ()
yield :: b - Pipe a b m ()
I would expect that
(id unawait x) await
On Sun, Mar 11, 2012 at 1:25 PM, Twan van Laarhoven twa...@gmail.com wrote:
On 2012-03-11 14:09, Paolo Capriotti wrote:
The Category law would be broken, though:
unawait x id == yield x !== unawait x
How did you get this equation? It's not even well-typed:
unawait :: a - Pipe a b m ()
On Sun, Mar 11, 2012 at 7:09 AM, Paolo Capriotti p.caprio...@gmail.com wrote:
Someone actually implemented a variation of Pipes with unawait:
https://github.com/duairc/pipes/blob/master/src/Control/Pipe/Common.hs
(it's called 'unuse' there).
I actually agree that it might break associativity
On 12-03-11 09:09 AM, Paolo Capriotti wrote:
The Category law would be broken, though:
unawait x id == yield x !== unawait x
How did you get this equation? It's not even well-typed:
unawait :: a - Pipe a b m ()
yield :: b - Pipe a b m ()
You're right, it's completely wrong. I was
On Sun, Mar 11, 2012 at 10:30 AM, Mario Blažević blama...@acanac.net wrote:
It's difficult to say without having the implementation of both unawait
and all the combinators in one package. I'll assume the following equations
hold:
(p1 unawait x) p2 = (p1 p2) * unawait x -- this
Thanks for explaining the problem. I guess I have to ditch my preconceived
notions (based on using Java/.Net) that killing a thread is dangerous.
Thanks again,
Grant
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 12-03-11 12:39 PM, Chris Smith wrote:
On Sun, Mar 11, 2012 at 10:30 AM, Mario Blaževićblama...@acanac.net wrote:
(p1 unawait x) p2 = (p1 p2)* unawait x -- this one
tripped me up
I don't think this could reasonably hold. For example, you'd expect
that for any p, idP p == idP
Source is in Hackage and https://github.com/leksah
OS X Binary Installers
http://leksah.org/packages/leksah-0.12.0.3-ghc-7.0.4.dmg
http://leksah.org/packages/leksah-0.12.0.3-ghc-7.4.1.dmg
Windows Binary Installers
http://leksah.org/packages/leksah-0.12.0.3-ghc-6.12.3.exe
On Sun, Mar 11, 2012 at 11:22 AM, Mario Blažević blama...@acanac.net wrote:
No, idP does terminate once it consumes its input. Your idP p first
reproduces the complete input, and then runs p with empty input.
This is just not true. idP consumes input forever, and (idP p) =
idP, for all
Sun, Mar 11, 2012 at 05:16:06PM +, grant wrote
Thanks for explaining the problem. I guess I have to ditch my preconceived
notions (based on using Java/.Net) that killing a thread is dangerous.
Thanks again,
Grant
Don't know if it's a good way, but if you are afraid of killing thread
2012/3/11 Jeremy Shaw jer...@n-heptane.com:
Also, URIs are not defined in terms of octets.. but in terms
of characters. If you write a URI down on a piece of paper --
what octets are you using? None.. it's some scribbles on a
paper. It is the characters that are important, not the bit
So you can do smth like:
(sourceClient $= CL.map Left) =
(sourceTMChan communicationChannel $= CL.map Right)
Alexander V Vershilov
That's a great idea, I'll give that a try. I was having an odd problem with
killThread on windows where the first character would be lost in the next
On Sun, Mar 11, 2012 at 14:33, Jason Dusek jason.du...@gmail.com wrote:
The syntax of URIs is a mechanism for describing data octets,
not Unicode code points. It is at variance to describe URIs in
terms of Unicode code points.
You might want to take a glance at RFC 3492, though.
--
brandon
On 2012-03-11 14:46, Paolo Capriotti wrote:
On Sun, Mar 11, 2012 at 1:25 PM, Twan van Laarhoventwa...@gmail.com wrote:
I would expect that
(id unawait x) await !== unawait x await === return x
There are several type errors in this equation, so I'm not exactly
sure what you mean.
On 2012-03-11 17:30, Mario Blažević wrote:
It's difficult to say without having the implementation of both unawait and all
the combinators in one package. I'll assume the following equations hold:
unawait x await = return x
unawait x yield y = yield y unawait x
(p1 unawait x) p2 = (p1 p2)
Am new to haskell, but one thing I wanted to try out was the performance of
an app in haskel. Having issues getting it to compile under ghc 7.0.4. The
owner recommend trying to upgrade to 7.2/7.4
I see a warning that the haskell-platform isn't compatible with with 7.4.1,
or so my homebrew
Hi. What has worked for me is to install a binary package for 7.4.1:
http://www.haskell.org/ghc/download_ghc_7_4_1#binaries
You can install it someplace special by giving
--prefix=/someplace/special to the configure script. Then, adjust
your path to hit /someplace/special/bin before it hits
2012/3/11 Brandon Allbery allber...@gmail.com:
On Sun, Mar 11, 2012 at 14:33, Jason Dusek jason.du...@gmail.com wrote:
The syntax of URIs is a mechanism for describing data octets,
not Unicode code points. It is at variance to describe URIs in
terms of Unicode code points.
You might want
Ah, sounds a good idea. Thanks___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sounds good - but my build fails on ubuntu-11.10:
Building gtksourceview2-0.12.3...
Preprocessing library gtksourceview2-0.12.3...
./gtksourceview2.h:10:48: fatal error: gtksourceview/gtksourceundomanager.h: No
such file or directory
compilation terminated.
gtk2hsC2hs: Error during preprocessing
Hi,
I can confirm the issue with gtksourceview2.h
Also I have the next error with leksah-server:
src/IDE/Core/CTypes.hs:548:10:
Duplicate instance declarations:
instance NFData Version
-- Defined at src/IDE/Core/CTypes.hs:548:10-23
instance NFData Version -- Defined in
cabal install --extra-include-dirs=. gtksourceview2
Should get you up and running, but I think the correct fix might be to add
include-dirs:. to the .cabal file.
On 12 Mar 2012, at 11:01, Johannes Waldmann wrote:
Sounds good - but my build fails on ubuntu-11.10:
Building
cabal install --extra-include-dirs=. gtksourceview2
yes this works. thanks! - J.W.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sun, Mar 11, 2012 at 2:33 PM, Twan van Laarhoven twa...@gmail.com wrote:
I think you should instead move unwaits in and out of the composition on the
left side:
unawait x (p1 + p2) === (unawait x p1) + p2
This makes idP a left-identity for (+), but not a right-identity, since
you
Not a combination of deepseq and ghc we had tested. Thanks for the heads up.
I have uploaded leksah-server-0.12.0.4 to Hackage to fix this. Please do a
cabal update and try again.
On 12 Mar 2012, at 11:15, Yuras Shumovich wrote:
Hi,
I can confirm the issue with gtksourceview2.h
Also I
Hi,
I'm pleased to announce my first package, freesect, which is a Haskell
syntax extension to generalise sections.
Please visit the homepage http://www.fremissant.net/freesect for more
information. The package is also available on Hackage.
Some previous discussion occurred on the haskell-cafe
On 12-03-11 01:36 PM, Chris Smith wrote:
On Sun, Mar 11, 2012 at 11:22 AM, Mario Blaževićblama...@acanac.net wrote:
No, idP does terminate once it consumes its input. Your idP p first
reproduces the complete input, and then runs p with empty input.
This is just not true. idP consumes
2012/3/11 Thedward Blevins thedw...@barsoom.net:
On Sun, Mar 11, 2012 at 13:33, Jason Dusek jason.du...@gmail.com wrote:
The syntax of URIs is a mechanism for describing data octets,
not Unicode code points. It is at variance to describe URIs in
terms of Unicode code points.
This claim is
On Sun, Mar 11, 2012 at 8:53 PM, Mario Blažević blama...@acanac.net wrote:
May I enquire what was the reason for the non-termination of idP? Why was
it not defined as 'forP yield' instead? The following command runs the way I
expected.
With pipes-core (which, recall, is known to be
Hi all,
I've been playing with GHC's new generics features (see
http://www.haskell.org/ghc/docs/latest/html/users_guide/generic-programming.html).
All the documentation I've seen suggests creating a helper class -- for
instance, the GSerialize class in the above link -- on which one defines
Consider the following idea for implementing pure functions:
A pure function can allocate and modify memory as long as a) it never
returns a reference to the memory or b) it never again modifies the
memory once it returns (i.e. it returns an immutable object).
This is based on the idea of value
I'm sure others will want to chime in here, but I'll offer my two cents.
On Sun, 11 Mar 2012 22:38:56 -0500, E R pc88m...@gmail.com wrote:
snip
So, again, what is the Haskell philosophy towards using mutable data
structures in pure functions? Is it:
1. leave it to the compiler to find
On Sun, Mar 11, 2012 at 23:05, Jason Dusek jason.du...@gmail.com wrote:
Although the intent of the spec is to represent characters, I
contend it does not succeed in doing so. Is it wise to assume
more semantics than are actually there?
It is not; one of the reasons that many experts
Argh. Email fail.
Hopefully this time I have managed to reply-all to the list *and* keep the
unicode properly intact.
Sorry about any duplicates you may have received.
On Sun, Mar 11, 2012 at 1:33 PM, Jason Dusek jason.du...@gmail.com wrote:
2012/3/11 Jeremy Shaw jer...@n-heptane.com:
Also,
On Sun, Mar 11, 2012 at 8:38 PM, E R pc88m...@gmail.com wrote:
1. leave it to the compiler to find these kinds of opportunities
2. just use the immutable data structures - after all they are just as
good (at least asymptotically)
3. you don't want to use mutable data structures because of
2012/3/12 Jeremy Shaw jer...@n-heptane.com:
The syntax of URIs is a mechanism for describing data octets,
not Unicode code points. It is at variance to describe URIs in
terms of Unicode code points.
Not sure what you mean by this. As the RFC says, a URI is defined entirely
by the identity
42 matches
Mail list logo
