[Gah, wrong From: email address given the list subscriptions, sorry
for the duplicates.]
I'm unclear why cpphs needs to be made a dependency of the GHC API and
included as a lib. Could you elaborate? (in the wiki page possibly)
Currently, GHC uses the system preprocessor, as a separate process.
principle, which I think is a good one. That is, I ought to be able to
swap in a different implementation of a map for the standard one in
the containers package without having to touch my code (especially if
the exported API's happen to match).
--
Mathieu Boespflug
Founder at http://tweag.io
Hi Christian,
as regards your question about sharing strings, there are a number of
libraries on Hackage to achieve this, e.g. in the context of compiler
symbols. To cite only a few: intern, stringtable-atom, simple-atom.
I'm sure there are others.
Best,
--
Mathieu Boespflug
Founder at http
Hi Carter,
On Tue, Jan 28, 2014 at 6:03 PM, Carter Schonwald
carter.schonw...@gmail.com wrote:
Theres actually a missing piece of information in this thread: what are the
example computations that are being sent?
Quite simply, the same as those considered in the original Cloud
Haskell paper,
Hi Eric,
On Wed, Jan 29, 2014 at 3:20 AM, Erik de Castro Lopo
mle...@mega-nerd.com wrote:
Mathieu Boespflug wrote:
thank you for the good points you raise. I'll try and address each of
them as best I can below.
0) I think you could actually implement this proposal as a userland
library
, a tool like
patchelf[3] would help immensely for moving executables+their
dependencies around in a 'bundle' style way.
[3] http://nixos.org/patchelf.html
--
Regards,
Austin Seipp, Haskell Consultant
Well-Typed LLP, http://www.well-typed.com/
--
Mathieu Boespflug
Founder at http
from any of the modules that were linked at build time were
missed, that is difficult.
By avoiding a RemoteTable entirely, we avoid having to solve that
difficult problem. :)
Best,
--
Mathieu Boespflug
Founder at http://tweag.io.
___
Glasgow-haskell-users
[Sorry for the multiple reposts - couldn't quite figure out which
email address doesn't get refused by the list..]
Hi Carter,
thank you for the good points you raise. I'll try and address each of
them as best I can below.
0) I think you could actually implement this proposal as a userland
Albert Y. C. Lai tre...@vex.net writes:
On 12-07-23 10:52 PM, Qi Qi wrote:
Foldl has the space leak effect, and that's why foldl' has been
recommended.
foldr (+) and foldl (+) for Int have the same asymptotic costs, both
time and space. See my http://www.vex.net/~trebla/haskell/lazy.xhtml
Hi John,
Why don't you use ulimit for this job?
$ ulimit -m 32M; ./cpsa
Regards,
Mathieu
On Fri, Dec 10, 2010 at 12:51 PM, John D. Ramsdell ramsde...@gmail.com wrote:
Please excuse the grammar errors in my last post. I was very tired.
The name of the package that supplies the free
Dear haskell-cafe,
I implemented the Floyd Warshall algorithm for finding the shortest
path in a dense graph in Haskell, but noted the performance was
extremely poor compared to C. Even using mutable unboxed arrays it was
running about 30 times slower. I rewrote the program several times, to
Hi Bulat,
ghc low-level code optimization cannot be compared with best modern C
compilers that's result of 20 years of optimization. ghc generates
machine code in rather simple idiomatic way, so it should be compared
to non-optimizing C compiler
Sure. But I was curious if to see whether
of the first
clause is irrefutable, so all calls to loop will return immediately.
What you were probably looking for is:
loop j | j == sIZE = return ()
| otherwise = ...
-- Mathieu
On Fri, Apr 16, 2010 at 04:41:06PM +0100, John Lato wrote:
From: Mathieu Boespflug mb...@tweag.net
Dear
On Nov 2, 2007 10:19 PM, nornagon [EMAIL PROTECTED] wrote:
On 03/11/2007, Greg Fitzgerald [EMAIL PROTECTED] wrote:
Anybody know of an ARM back end for any of the Haskell compilers?
If there's an arm-eabi port somewhere, I might be able to get Haskell
code running on the Nintendo DS...
2. How do you implement a program that is fundamentally about state
mutation in a programming language which abhors state mutation?
Its not clear games are fundamentally about mutation, anymore than, say,
window managers are. State we do with monads.
Indeed. Ignoring the concept of a monad
On 2/10/07, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
1) Use Hscolour to pretty-ifiy the Core so its more parsable:
ghc -O Foo.hs -ddump-simpl | HsColour -tty | less -r
will colourise the Core, and pipe it into less (which will display the
metachars). A screenshot:
that I had written quite a bit of
typechecked code on top of the erroneous CM monad declaration.
Thanks for your help Simon,
Mathieu
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:glasgow-haskell-users-
| [EMAIL PROTECTED] On Behalf Of Mathieu Boespflug
| Sent: 29 November 2006 00
Hi,
The following code compiles with GHC 6.4.2, but does not typecheck
with GHC HEAD pulled on Sunday.
module CompilerMonad where
import Control.Monad
import Control.Monad.Reader
import Control.Monad.Error
newtype CompilerError = CE String deriving Error
newtype CM r a = CM (ReaderT r
Hi everyone,
I'm running into trouble with type synonyms in instance heads and I
can't figure out what the resulting error message means. The case I'm
considering is as follows:
-- hoist a and b to class variables so that instances declarations may
-- constrain them.
class Map m a b where
19 matches
Mail list logo
