On 04/ 9/12 01:03 AM, Francesco Mazzoli wrote:
No, it is not possible to build GHC without GHC. Building GHC on ARM is
going to be extremely tricky (I'm not sure anyone has ever done it).
It's not that tricky at the end. Just install LLVM 3.0 and some OS
supplied unregisterised GHC. Grab
On 04/ 9/12 10:35 AM, Graham Klyne wrote:
It ships with Debian, along with the full Haskell Platform built for ARM
and lots of other libraries. Other than speed, it's fine.
Hmmm... I wonder if it will squeeze onto a Raspberry Pi :)
It should, if not report a bug since I regularly test on
On 10/04/12 07:28, Karel Gardas wrote:
On 04/ 9/12 01:03 AM, Francesco Mazzoli wrote:
No, it is not possible to build GHC without GHC. Building GHC on ARM is
going to be extremely tricky (I'm not sure anyone has ever done it).
It's not that tricky at the end. Just install LLVM 3.0 and some OS
Hello,
I am manipulating labeled multiway trees, some kind of lightweight
XML notation. One thing I would like to be able to do is manipulating
a tree as a list of (Path, Value). Generating such a list is easy but
I am a little bit surprised to find it harder to reconstruct a tree,
given such a
Other than speed, it's fine.
Do we know what speed issues are due to?
Plus, I believed some had used GHC for smartphones?
Le 9 avril 2012 01:45, Joey Hess j...@kitenet.net a écrit :
Thomas DuBuisson wrote:
On Sun, Apr 8, 2012 at 4:03 PM, Francesco Mazzoli f...@mazzo.li wrote:
No, it is
On 10/04/12 09:55, Arnaud Bailly wrote:
Hello,
I am manipulating labeled multiway trees, some kind of lightweight
XML notation. One thing I would like to be able to do is manipulating
a tree as a list of (Path, Value). Generating such a list is easy but
I am a little bit surprised to find it
Hi,
Am Dienstag, den 10.04.2012, 11:00 +0200 schrieb Yves Parès:
Plus, I believed some had used GHC for smartphones?
do you refer to
http://www.joachim-breitner.de/blog/archives/300-Xmonad-on-my-mobile-phone.html
or something more serious?
Greetings,
Joachim
--
Joachim nomeata Breitner
For instance, yes.
I think I had seen some times on this mailing list or on blog posts (
http://ghcarm.wordpress.com/) people having used GHC on ARM platform.
I distinctly remember having seen on the mailing list that cross-compiling
wasn't working but that we now can compile with GHC on ARM,
Hi,
Am Dienstag, den 10.04.2012, 12:36 +0200 schrieb Yves Parès:
For instance, yes.
I think I had seen some times on this mailing list or on blog posts
(http://ghcarm.wordpress.com/) people having used GHC on ARM platform.
I distinctly remember having seen on the mailing list that
All these are not cross-compiled, but natively
compiled on the repective architecture, and I don’t think it is easily
possible to cross-compile GHC itself even today.
So how did they get compiled the first time? How do you get a GHC working
on *or* for an ARM platform if you don't use Debian?
Hi,
Am Dienstag, den 10.04.2012, 13:04 +0200 schrieb Yves Parès:
All these are not cross-compiled, but natively
compiled on the repective architecture, and I don’t think it is
easily
possible to cross-compile GHC itself even today.
So how did they get compiled the first time? How do
Hello Twan,
I have a rather clear idea of how I would do it (in Haskell or in
Java), but I feel this is something quite common that should have
already been handled in other contexts (eg. XML/XPath stuff, JSon, CSS
?), hence my question which was admittedly not clear enough.
Anyway, thanks a lot
Tillmann Rendel ren...@informatik.uni-marburg.de wrote:
I am curious what are interesting use-cases for that? Symbolic
analysis? self-compilers?
Optimization. For example, imagine the following definition of
function composition:
map f . map g = map (f . g)
f . g = \x - f (g x)
Okay, thanks for the explanation.
But that does not completely answer the original question: now, using
branch 7 of GHC what can you do to get a haskell program compiled on/for an
ARM platform without using Debian? You have to use LLVM? So you have to
compile your program on a regular x86/x64 PC
10.04.2012, 02:00, Ryan Ingram ryani.s...@gmail.com:
A concurring opinion here, and an example.
iff :: Bol - a - a - a
iff True x _ = x
iff False _ x = x
f, g :: Bool - Bool
f x = x
g x = iff x True False
Are these two functions equal? I would say yes, they are. Yet once you can
Apologies for duplicates.
CALL FOR PARTICIPATION
TESTS and PROOFS 2012 (TOOLS EUROPE 2012)
6th International Conference on Tests Proofs
May 31 - June
On 09/04/12 23:49, Paolo Capriotti wrote:
I'm pleased to announce the release of version 0.1.0 of pipes-core, a
library for efficient, safe and compositional IO, similar in scope to
iteratee and conduits.
http://hackage.haskell.org/package/pipes-core
I have some issues with the function
On Tue, Apr 10, 2012 at 4:50 PM, Twan van Laarhoven twa...@gmail.com wrote:
I have some issues with the function names used
firstP :: Monad m = Pipe a b m r
- Pipe (Either a c) (Either b c) m r
secondP :: Monad m = Pipe a b m r
- Pipe (Either c a) (Either c b)
Joachim Breitner wrote:
Most of these architectures do not have a native code generator (so they
are compiled via C) and are unregisterized, i.e. GHC knows nothing about
their registers. Both cause a performance penalty; I don’t know numbers.
I assume this is what Joey refers to. But maybe
On 04/10/12 07:03 PM, Joey Hess wrote:
BTW, the other problem with Haskell on arm is that AFAIK there is no
ghci, and so also no Template Haskell, and so if you're writing Real
World utilities that you want to be maximally portable, this means you
have to avoid using an increasing number of
On 12-04-07 05:35 PM, Myles C. Maxfield wrote:
So here are my questions:
...
3. Are there any parsers that support streaming semantics and being
used as a monad transformer? This would require rewriting my whole
program to use this new parser, but if that's what I have to do, then
so be it.
On 2012-04-07 23:35, Myles C. Maxfield wrote:
CC: Maintainers of STMonadTrans, Vector, and JuicyPixels
Hello,
I am writing a Haskell Attoparsec parser which will modify 2-d arrays
of small values (Word8, Int8, etc.).
My first idea was to simply parse all the deltas, and later apply them
to the
The first release of the webdriver package has been uploaded to Hackage.
Selenium is a test suite that allows you to automate web browsers on a
variety of platforms. The webdriver package acts as a client library that
speaks Selenium's WebDriver protocol, using a simple monadic interface. This
That looks great, Adam, thanks for sharing! I've been using
watir-webdriver but ruby tends to be a lot more painful to use than
Haskell (even though I use ruby only for the tests!). Looking forward
to see what I can do with your package =).
Cheers,
--
Felipe.
On 10/04/2012, at 7:55 PM, Arnaud Bailly wrote:
I am manipulating labeled multiway trees, some kind of lightweight
XML notation. One thing I would like to be able to do is manipulating
a tree as a list of (Path, Value). Generating such a list is easy but
I am a little bit surprised to find it
Hi folks,
I'm looking for suggestions for XMPP libraries. So far I have found
three on Hackage. Thanks to the authors of these - I think a lot of good
can come from XMPP in Haskell.
However, all of them appear to be minimally maintained, if at all:
* XMPP - only one upload, over 2 years
Hi, I am trying to use process-conduit on windows, but it appears to hang
when using the conduitCmd.
Is there a reason why this doesn't work?
Thanks for any help,
Grant
{-# LANGUAGE QuasiQuotes #-}
import System.Process.QQ
import Data.Conduit
import qualified Data.Conduit.Binary as CB
import
Ben Lippmeier b...@ouroborus.net wrote:
I pushed Repa 3.1 to Hackage on the weekend. It has a *much* cleaner API. I
can't recommend continuing to use Repa 2. You will just run into all the
problems that are now fixed in Repa 3.
I was going to ask about the wiki page, and saw that you've
You are right, of course. By sensible properties I simply meant the
list of (Path, Value) is assumed to represent a tree (eg. it has been
generated by a traversal of some original tree). By ordered I meant
Path(s) segments are lexicographically ordered and (Path, Value) are
enumerated from a tree
On 11/04/2012, at 4:23 PM, Arnaud Bailly wrote:
You are right, of course. By sensible properties I simply meant the
list of (Path, Value) is assumed to represent a tree (eg. it has been
generated by a traversal of some original tree). By ordered I meant
Path(s) segments are lexicographically
30 matches
Mail list logo
