Nun Aurbiz wrote:
Where do I find the documentation for the FFI for GHC? I've read the
FFI report, the GHC user guide and scoured haskell.org but they all
gloss over what commands you actually need to give GHC and how to give
them. foreign import blah blah just gives me undefined references.
2008/11/9 Johannes Waldmann [EMAIL PROTECTED]:
NB: Wasn't there a time (before do) when list notation (brackets)
would work in any monad? And map was a method in Functor,
and we had class Functor m = Monad m, etc. Well well well times have
changed.
Sure, I believe the feature was called monad
Maybe one subsumes the other?
What I want to know is if there is an easy way to emulate one with the
other, and how much convenience is lost in doing so.
For instance, is it possible to implement stream fusion with rank2
types, or the ST monad with existantials?
Is there any paper discussing
Hi all,
The HappS version on Hackage does not yet support ghc 6.10, since GADT
pattern matching and the Exception API have changed.
One sample error is:
src/HAppS/Data/Xml/Base.hs:281:23:
GADT pattern match with non-rigid result type `t1'
Solution: add a type signature
...
Adding a
Andrew Coppin wrote:
Assuming DPH ever becomes a reality, how would you implement the above
with it?
It seems I'm late to the party - the latest release of GHC claims to
include DHP! o_O
OTOH, I can't lay my hands on any documentation, so...? (The DPH wiki
page was last updated in August
like [(x, y) | x - xs | y - ys], and it's not clear how to define
zip for a monad - but perhaps there is some extension of a monad
where it makes sense?
Well, I question that the above notation makes sense (for lists).
It is trying to be too clever.
standard list comprehensions at least are
Derek Elkins wrote:
As far as I can tell, no one actually uses parallel list comprehensions.
With any luck, the same will be true for generalized list
comprehensions.
Generalised? Heck, I don't use list comprehension at all! :-P
___
Haskell-Cafe
hpacheco:
a new HAppS version [1]0.9.3.1 has been released, and gitit requires
HApps==[2]0.9.2.1. should ti be ok just to relax the dependency?
Seems like 0.9.x series should be ok.
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Sun, 2008-11-09 at 10:15 +, Max Bolingbroke wrote:
2008/11/9 Johannes Waldmann [EMAIL PROTECTED]:
NB: Wasn't there a time (before do) when list notation (brackets)
would work in any monad? And map was a method in Functor,
and we had class Functor m = Monad m, etc. Well well well
Reactive [1] is a library for functional reactive programming (FRP), similar
to the original Fran [2] but with a more modern interface (using standard
type classes) and a hybrid push/pull implementation. It is designed to be
used in a variety of contexts, such as interactive 2D and 3D graphics,
If anyone else has problems installing gitit, try updating your cabal-
install (and cabal). I had old versions on my computer, and updating
them solved my gitit build-problems.
-chris
On 9 nov 2008, at 22:41, John MacFarlane wrote:
I've just uploaded a new version (0.2.1) that requires
hpacheco:
Hi all,
The HappS version on Hackage does not yet support ghc 6.10, since GADT
pattern matching and the Exception API have changed.
One sample error is:
src/HAppS/Data/Xml/Base.hs:281:23:
GADT pattern match with non-rigid result type `t1'
Solution:
yes, 0.9.3 is out and it has compiled ok.thanks :)
hugo
On Sun, Nov 9, 2008 at 7:58 PM, Don Stewart [EMAIL PROTECTED] wrote:
hpacheco:
Hi all,
The HappS version on Hackage does not yet support ghc 6.10, since GADT
pattern matching and the Exception API have changed.
One
Thank you, everyone. You have addressed my concerns very accurately.
So in short, higer rank types subsume existentials. Good. And the burden
of emulating existentials can be lowered by a suitable macro system.
Very good.
2008/11/9 Derek Elkins [EMAIL PROTECTED]:
There are various rules for
Bas van Dijk wrote:
On Wed, Nov 5, 2008 at 12:43 AM, Bas van Dijk [EMAIL PROTECTED] wrote:
2008/11/5 Daryoush Mehrtash [EMAIL PROTECTED]:
Are there cases (function or list) where the result of foldl (or foldr)would
be different that foldl' (or foldr')?
Maybe this wiki article I wrote some
korcan_h:
I don't understand why there is no video of Frag online so I made one
here: http://uk.youtube.com/watch?v=0jYdu2u8gAU
Thanks! I've linked to the video on Frag's homepage,
http://haskell.org/haskellwiki/Frag
-- Don
___
What I mean by getCh is the non-buffered non-echoed version of getChar,
which Hugs used to provided as an extension but not any more.
Is there any way to have a non-buffered non-echoed single character
input function on MS Windows command line using only the libraries in
the MS Windows
On Sun, 2008-11-09 at 13:46 +0100, Loup Vaillant wrote:
Maybe one subsumes the other?
What I want to know is if there is an easy way to emulate one with the
other, and how much convenience is lost in doing so.
For instance, is it possible to implement stream fusion with rank2
types, or
I've just uploaded a new version (0.2.1) that requires HAppS = 0.9.3
0.9.4. (There are small API changes from 0.9.2 to 0.9.3, so I thought
it best not to allow 0.9.2.x, even though it still compiles with a
warning.)
+++ Hugo Pacheco [Nov 09 08 20:41 ]:
a new HAppS version [1]0.9.3.1 has
On 11/09/08 17:04, Loup Vaillant wrote:
[snip]
Err, where can I find such texts? I don't even understand
intuitionistic predicate logic :-(
I just googled that phrase and got many hits.
I think metaprl implements something like that:
http://metaprl.org/default.html
I've often wondered about
a new HAppS version 0.9.3.1 has been released, and gitit requires HApps==
0.9.2.1. should ti be ok just to relax the dependency?
On Sat, Nov 8, 2008 at 8:32 PM, John MacFarlane [EMAIL PROTECTED] wrote:
I've uploaded an early version of gitit, a Haskell wiki program, to
HackageDB. Gitit uses
흐壹o 鉅,
工賊嫂, 膠墮將奄 굅, 껐갭, 맏굡별9 죌, 闔u 破訂佯
羸受 I 張灑 戌 銳遷h 稶 淸e 全縡醇連奄抑 全縡憶寥抑 墮膣旭n 湞 銳遷矮枳
婆芋h 흽奧 出抑 剃 倧貞藕抑 修 灑 予輒塡旭n 醇t 全t 灑y 獐鎭.
괼 派姪s 烈r 張 彧 預屎
銳凸藕鴨狙矮r = 一厭M ⓦ嶢.說碇퇀蹴) 伸銳諜h
烈鎭遇n 勖卒蛭 娠刷l 軸愴蓮 ㏂禎旭.h 銳諜熬
伸銳諜h 볶 IO 촁塼
껍 暢踐祝蓮侄蹟工鴨 彩昻n 膠찢連奄彧g
全t 輒彩抑
낟 出e 彧輒賑辛. i 鴨鳶迹輒稔 鎭張將奄 淸受 i 矮d 臆蓮辛 闔u 赤抑 淸稶
投陂
* Mark Wassell [EMAIL PROTECTED] [2008-11-09 10:51:55+1100]
Has anyone thought about or embarked on the task of developing a 2D or
3D physics engine purely in Haskell?
There is Hipmunk but I'm wondering about a purely Haskell
implementation; possibly a port of Chipmunk to Haskell.
As Don
I don't understand why there is no video of Frag online so I made one here:
http://uk.youtube.com/watch?v=0jYdu2u8gAU
_
BigSnapSearch.com - 24 prizes a day, every day - Search Now!
There's a natural relation between higher rank types and existentials;
one way to think about it is this: if you have some existential type t
(subject to some constraints), you cannot operate on it except with
some function that accepts any type t subject to those constraints.
There is a simple
conal:
Reactive [1] is a library for functional reactive programming (FRP),
similar to the original Fran [2] but with a more modern interface (using
standard type classes) and a hybrid push/pull implementation. It is
designed to be used in a variety of contexts, such as
Derek Elkins wrote:
As far as I can tell, no one actually uses parallel list comprehensions.
With any luck, the same will be true for generalized list
comprehensions.
I second this.
-Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
27 matches
Mail list logo
