On Fri, 2009-10-02 at 20:00 -0700, Gregory Crosswhite wrote:
Sorry to reply to my own posting, but... AHA! I see now what's going
on. The purpose of the rank-2 qualifier is to prevent STRefs from
leaking outside of the runST call, and what the code does at the
lowest level is that it
Günther Schmidt wrote:
there are numerous examples on how to implement a DSL, but I haven't
been able to figure out how to design one.
I mean I have a pretty good idea of the problem domain, I've coded it
over and over again until I got it right. Now I'd like to express that
part as a DSL
On Fri, 2 Oct 2009, Gregory Crosswhite wrote:
Do you all have any thoughts on ways to solve this problem, and/or a
high-level explanation of what is going behind the scenes with STRefs and
MArrays?
http://www.haskell.org/haskellwiki/Monad/ST
___
В сообщении от 30 сентября 2009 23:42:57 Casey Hawthorne написал:
On Wed, 30 Sep 2009 21:24:11 +0200, you wrote:
I?m a physicist, so I think they would be attracted by something like
Haskell: high level physics modelling at Fortran speeds
Haskell: mathematics beyond numerical calculus
---
Haskell Weekly News
http://sequence.complete.org/hwn/20091003
Issue 134 - October 03, 2009
---
Welcome to issue 134 of HWN, a newsletter covering
Dear list,
I am trying to make a compiler and we are having a hard time getting Alex to
work. We have succeded to work out Alex using older version, but with the the
2.2 version we keep getting this error and we havent been able to figure it out.
So this is our tokens definition:
{
del_31416no:
Dear list,
I am trying to make a compiler and we are having a hard time getting Alex to
work. We have succeded to work out Alex using older version, but with the the
2.2 version we keep getting this error and we havent been able to figure it
out.
So this is our tokens
Yesterday I was at a talk by Pat Hanrahan on embedded DSLs and GPUs at
the nvidia GPU conference:
http://www.nvidia.com/object/gpu_technology_conference.html
Pat argued that the only way forward to achieve usable computing power
for physics on heterogeneous computers (eg. multicore+GPU) is
And note we are pushing precisely on the use of DSLs in or on Haskell
for *portability* of the domain-scientists code in a number of areas
right now:
* data parallel algorithms (targetting cpu , gpu)
Accelerate:
http://hackage.haskell.org/package/accelerate-0.6.0.0
dons:
And note we are pushing precisely on the use of DSLs in or on Haskell
for *portability* of the domain-scientists code in a number of areas
right now:
* data parallel algorithms (targetting cpu , gpu)
Accelerate:
$digit+ { \p s - TokenEntero p (read s) }
\' [$alpha $digit \_]* \' { \p s - TokenString p (read s)}
[$digit]+\.[$digit]+ { \p s - TokenDouble p (read s) }
$alpha [$alpha $digit \_]*{ \p s - TokenVar p (read s) }
You are using
Hi,
I've been writing a little binding from Ruby to Haskell called Hubris (http://github.com/mwotton/Hubris
) which I think has some potential both for making Haskell web apps
easier to write, and also for bringing the more adventurous Ruby
programmers into the Haskell community. Code-wise
I think having access to the parsec library would be a major plus that
you can show off. Eg: you can have a RoR based email web app that uses
parsec parsing to figure out which sections of an email thread belong
to which author...
Best
-Keith
On Sat, Oct 3, 2009 at 11:08 PM, Mark Wotton
Mark Wotton wrote:
Hi,
I've been writing a little binding from Ruby to Haskell called Hubris
(http://github.com/mwotton/Hubris) which I think has some potential both
for making Haskell web apps easier to write, and also for bringing the
more adventurous Ruby programmers into the Haskell
On 04/10/2009, at 4:22 PM, James Britt wrote:
Mark Wotton wrote:
So, I'm asking you guys. What are some really nice Haskell
libraries or
apps that could benefit from being shown off in one of the
plethora of
slick, mature web frameworks that exist in Ruby? Manuel Chakravarty
15 matches
Mail list logo
