Alfredo Di Napoli alfredo.dinapoli at gmail.com writes:
Said that,has someone had any luck in running Threadscope on Mac OS X 10.8 at
all?
Thanks,
A.
I think I have encountered the same problem:
https://groups.google.com/d/msg/parallel-haskell/-lhrgNN8elw/KzqLM9BzoJwJ
In my
A while ago there was a framework Blobs for building box-connector
diagram editors.
It is probably a somewhat bit-rotted now:
http://www.cs.york.ac.uk/fp/darcs/Blobs/
I seem to remember a Haskell Workshop report about Dazzle (the
application that was the genesis of Blobs) but it doesn't appear
yes, the installation seems to work fine now. However, doing the
following test in ghci
Prelude :m +Foreign.CUDA
Prelude Foreign.CUDA props 0
Loading package bytestring-0.9.2.1 ... linking ... done.
Loading package cuda-0.5.0.0 ... linking ... done.
results in a crash. The CUDA version I am
That is not a very elucidating crash message, so I don't see how to
proceed. After ghci print Loading package cuda-0.5.0.0 ... linking
... done. it just exits? No error dialog, nothing? Did you try building
any of the examples in the cuda package that don't require ghci?
Is your graphics card
Hello Brent,
On 03/31/2013 04:53 PM, Brent Yorgey wrote:
It looks like your entire Haskell Platform installation is completely
hosed. Sad to say, but I think your best bet is to simply reinstall
the Haskell Platform.
-Brent
___
Haskell-Cafe mailing
Hi All,
Not particularly happy to announce the non-release of my latest
library, HBlog 0.1. I've been working on it steadily for a long time now,
but it's still not ready.
The library -- when it's finished -- will be a 100% Haskell
representation of blogs, from authors and posts up to
Hi Cafe,
I am trying to embed x86 assembly in Haskell. I'd like the EDSL to not
allow invalid movements into registers - for example, should not allow
moving into RIP. I was not able to get it to work. I ended up using
DataTypeContexts - which is considered misfeature anyway. I was wondering
if I
Hi
I think I've mastered much of functional programming with Haskell, or at
least I can write programs which process as desired.
However the existence of the let statement evades me apart from a quick
way to define a function. Then there is the in and where parts. Its
been suggested its to do
indeed, not very helpful ...
When I installed Cuda the latest driver (296.0) that was running on my
laptop (a W520 ThinkPad) was not sufficient for version 5.0. However as
I noticed today in February Lenovo released a driver update (311.0) and
with that 5.0 is in fact running. :-)
With that
You have fixed the type of list by move RAX RAX. Now it has type
Instruction SNDREG SNDREG
Make your Instruction a GADT and require that MOV should have appropriate
constraints:
{-# LANGUAGE DatatypeContexts, GADTs #-}
data SREG = RIP
data DREG = RBX
data SNDREG = RAX
data Instruction where
Fantastic, glad you got it working! Maybe it's time for me to send
Trevor a pull request...
Geoff
On 04/01/2013 04:27 PM, Peter Caspers wrote:
indeed, not very helpful ...
When I installed Cuda the latest driver (296.0) that was running on my
laptop (a W520 ThinkPad) was not sufficient for
Wow ... thanks Serguey that gets rid of DatatypeContexts as well!
Regards,
Kashyap
On Mon, Apr 1, 2013 at 9:12 PM, Serguey Zefirov sergu...@gmail.com wrote:
You have fixed the type of list by move RAX RAX. Now it has type
Instruction SNDREG SNDREG
Make your Instruction a GADT and
It might just be easiest for me to explain than to find another resource:
let and where are both ways of creating local variables in a function. They
serve similar purposes, and in most cases, it's your choice of which one to
use. (Comparing to C++, the choice of let vs. where is not too far
On Mon, Apr 1, 2013 at 9:32 AM, Richard Eisenberg e...@cis.upenn.edu wrote:
Normal let:
In a function (which does not use do), you can use let to make local
variables. The word in separates the local variable declaration from the
part of your function where you want to use that variable.
I'll be in Stockholm next month, so I'm curious about haskellers in
Stockholm.
I saw attempts to organize regular meetings in old mailing threads, but
can't find *up to date* information to correct my schedule and see
fellow haskellers.
Sorry, if this offtopic
--
Best regards,
Sergey
I now have a paper draft describing the system in more detail. It also
comes with a brief explanation of how GHC's profiling works, which should
also be helpful for people who haven't read the original profiling
paper.
http://ezyang.com/papers/ezyang13-rlimits.pdf
Edward
Excerpts from
Hej!
I live in Stockholm but don't know of any user group here. How long are you
going to stay?
Cheers!
2013/4/2 Vincent Ambo taz...@gmail.com
Hej!
I live in Stockholm but don't know of any user group here. How long are
you going to stay?
Cheers!
Vincent
2013/4/1 Sergey Bushnyak
Oh, and happy April 1!
On Mon, Apr 1, 2013 at 6:16 AM, Tom Murphy amin...@gmail.com wrote:
Hi All,
Not particularly happy to announce the non-release of my latest
library, HBlog 0.1. I've been working on it steadily for a long time now,
but it's still not ready.
The library --
On 13-04-01 06:26 AM, Roger Mason wrote:
It turned out that there was a stale version of 'array' lurking in the
ghc package db. In spite of reinstalling ghc it did not go away until I
unregistered it. I think it was persisting because re-installing ghc
simply unpacked over the old directory
You can use a general fold and unfold, without any type-specific
programming if you re-express Expr as the least fixed point of its
underlying base functor:
data ExprF a = Add a a | Sub a a | Mul a a | Eq a a | B Bool | I Int
deriving (Show,Functor)
data Expr = Fix ExprF
Then use the
20 matches
Mail list logo
