1) hvac 0.1b: transactional, declarative framework for lightweight
web applications.
2) HStringTemplate 0.3
1) hvac 0.1b
hvac (short for http view and controller) has been my project for the
last little while, and is finally in a fairly usable state, so I'm
opening up the repo (darcs get
On Fri, Mar 21, 2008 at 11:21:26PM -0500, Galchin Vasili wrote:
In my blah.hsc, I have allocbytes (#const (struct bozo)) .. where
you probably meant allocBytes (#const sizeof(struct bozo))
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
On Sat, Mar 22, 2008 at 08:48:20PM +0100, Peter Verswyvelen wrote:
Amazing, I downloaded and installed this release for Windows and it works
out of the box, just as a lazy Windows user expects! Woohoo! Great work.
I've had this success adding wxhaskell to nixos using the new distribution as
Hi Sebastian Sylvan,
Thank you very much! I thick the last column return a string because
of the Haskell Show function, for when I made test, I got such an
error message: Show ([SqlValue] - IO [[SqlValue]]). Any way, thank you
very much!
Deng Chao
在 2008-03-22六的 13:55 [EMAIL PROTECTED]
Send
I fixed the code, see below. In fact, it works now for any listst of
type (YOrd a) = [a]. It works for things like
ysort [[1..],[1..],[2..],[1..]]
Unfortunately, the performance of ysort is rather low. I belive that
it is impossible to create any sorting algorithm that uses ycmp
instead of
On Mar 23, 2008, at 1:21 AM, Sterling Clover wrote:
1) hvac 0.1b: transactional, declarative framework for lightweight
web applications.
2) HStringTemplate 0.3
Excellent! Thanks for these.
-johnnn
___
Haskell-Cafe mailing list
Hi Shaun,
I've read the whole thread till now.
If you only look at the testing side Cabal is a possible target to run your
tests.
(I think you've already met it?)
Adding documentation ficilities to ghci is nice,
however my experience is that documentation is not complete everywhere.
That's why
Robert Vollmert wrote:
In short, I'm constantly running into what appear to be artificial type
restrictions in Control.Arrow.ArrowTree. For example, the signature of
deep is
deep :: (Tree t, ArrowTree a) = a (t b) (t b) - a (t b) (t b)
instead of the more general
deep :: (Tree t, ArrowTree
Hi,
Happy Easter!
I've been using monad transformers for the first time in anger this week. They
certainly do the job. However, there's an operation that I keep defining over
and over again. It is sort of like lift and return in that it's glue to get
operations and values into the monad from
On Sun, Mar 23, 2008 at 5:09 PM, Marc Weber [EMAIL PROTECTED] wrote:
Adding documentation ficilities to ghci is nice,
however my experience is that documentation is not complete everywhere.
That's why I'm looking at source code directly (thus having doc strings if
given
else I can have
Matthew Pocock wrote:
I've been using monad transformers for the first time in anger this week.
I hope your enjoyment in using monads has helped your anger
to subside. :)
...there's an operation that I keep defining over
and over again...
hoistList :: (Monad m) = [a] - ListT m a
So a number of people responded with various ways this is already possible.
Of course GHC can already do this... it's type inference. The part I'm
interested in working on is exposing the functionality in GHC's API to make
this as easy as possible.
-Abram
Hi Yitz,
I was thinking along the lines of a class linking the monad transformer with
the base monad:
class (MonadTrans mt, Monad b) = MonadTForm mt b | mt - b
where
hoist :: (Monad m) = b a - mt m a
This is to restrict it directly between the base monad and the transformed
version. If
L.S.,
I am trying GLUT and GLFW (on Windows XP, with GHC 6.8.2); the sample
programs do not terminate when I close the window by clicking on the cross
in the upper right corner of the window.
The sample program for GLUT is at
line #102 ...
allocaBytes (#const sizeof(struct mq_attr)) $ \ p_attrs - do
definition of struct mq_attr on Linux ...
struct mq_attr
{
long int mq_flags;/* Message queue flags. */
long int mq_maxmsg; /* Maximum number of messages. */
long int mq_msgsize; /* Maximum message
Claus Reinke:
type family F a :: * - *
..
We made the design choice that type functions with a higher-kinded
result type must be injective with respect to the additional
paramters. I.e. in your case:
F x y ~ F u v = F x ~ F u /\ y ~ v
i'm still trying to understand this remark:
- if we
Tom Schrijvers:
could you please help me to clear up this confusion?-)
Let me summarize :-)
The current design for type functions with result kinds other than *
(e.g. * - *) has not gotten very far yet. We are currently
stabilizing the ordinary * type functions, and writing the story up.
Claus Reinke:
type family F a :: * - *
..
We made the design choice that type functions with a higher-kinded
result type must be injective with respect to the additional
paramters. I.e. in your case:
F x y ~ F u v = F x ~ F u /\ y ~ v
actually, i don't even understand the first part of
18 matches
Mail list logo
