On Tue, 13 Dec 2011 18:16:17 +0100, Sh NJP shayan@gmail.com wrote:
I do some pre-processing on a normal Haskell code ( -F ). The pre-processor
needs to know the type of each expression.
What are the possibilities to do so?
Can I use GHC API to employ GHC type checker? If yes, any good
On Sat, 12 Nov 2011 17:05:51 +0100, Robert Clausecker fuz...@gmail.com wrote:
Most time, it is not really difficult to find an appropriate term for
concepts of Haskell, like types (Typen) or type classes (Typklassen).
But I really don't know how to call kinds and sorts in German. Any
ideas?
On Wed, 9 Nov 2011 20:34:11 +0300, dokondr doko...@gmail.com wrote:
I am wondering if Database.Persist can work with key/value storage such as
Riak or SimpleDB where records are lists of key/value pairs and any two
lists can have different keys?
Is simple implementation of 'persistent' based
On Wed, 9 Nov 2011 13:59:46 +0300, dokondr doko...@gmail.com wrote:
Hi,
What Haskell package to work with NoSQL storage is both mature and easiest
to use?
I need persistent storage for simple key/value lists (not complex JSON
docs).
CouchDB and Cassandra seems to be overkill for my needs.
On Fri, 4 Nov 2011 11:24:37 -0700, Jason Dagit dag...@gmail.com wrote:
The default buffer manipulation in emacs is not great. Take a look at
things like ido mode:
http://www.emacswiki.org/emacs/InteractivelyDoThings
It's approximately 3 orders of magnitude better than the default way
:)
On Fri, 7 Oct 2011 15:29:50 -0400, Alex Rozenshteyn rpglove...@gmail.com
wrote:
I'm looking for things like minimization, completion, etc. kinda like
http://www.cis.upenn.edu/~cis639/docs/xfst.html
This library's main purpose seems to be educational, but perhaps it's
useful to you anyway:
On Sun, 10 Jul 2011 11:49:44 +0100, Patrick Browne patrick.bro...@dit.ie
wrote:
My main question is in understanding the relationship between the
arguments of the functions getX and getY in the class and in the
instance. It seems to me that the constructor Pt 1 2 produces one
element of type
On Fri, 10 Jun 2011 17:28:22 +0100, Patrick Browne patrick.bro...@dit.ie
wrote:
-- Not OK
-- insert 2 [9,2]
This causes an error, because numeric literals like 2 are polymorphic:
:t 2
2 :: Num a = a
If you fix the type to Integer, it works as expected:
insert (2 :: Integer) [9,2]
By the
On Fri, 03 Jun 2011 12:19:31 +0300, Guy guytsalmave...@yahoo.com wrote:
On 03/06/2011 12:01, Malcolm Wallace wrote:
I believe the motivating example that persuaded the Language Committee to
allow these symbols was
--
which is not of course used anywhere in the standard libraries,
Excerpts from Michael Litchard's message of Tue Nov 02 22:40:27 +0100 2010:
Daniel,
Thank you for your reply. I'm still confused.
When I see a code sample like this
main = do
posts - liftM parseTags (readFile posts.xml)
print $ head $ map (fromAttrib Id) $
Excerpts from Ozgur Akgun's message of Tue Apr 13 12:02:06 +0200 2010:
Cafe,
Is there a way (without going into the IO lands) to achieve this:
[..]
There's package for that on hackage:
http://hackage.haskell.org/packages/archive/spoon/0.3/doc/html/Control-Spoon.html
However, this is
On Thu, Jul 23, 2009 at 08:17:34PM +0100, Iain Barnett wrote:
[..]
against the empty list it's not really a problem to have it there. I didn't
realise I could use Maybe in the constructor because it's a monad, but
that's good because I was wondering about the best way to make a nullable
12 matches
Mail list logo
