Hello,
Maybe you could have a look at Quasi
Quotationhttp://www.haskell.org/haskellwiki/Quasiquotation
.
Regards
J-C
On Sat, Aug 24, 2013 at 11:36 AM, TP paratribulati...@free.fr wrote:
Hi everybody,
I continue to learn and test Template Haskell (one more time thanks to John
Lato for his
Hello Café
I am running into problems when installing transformers-base-0.4.1.
Has anyone an idea about what is going on?
REM : this is a brand new debian install, I have just install ghc, cabal
install cabal-install etc.
Thank you
very much
J-C
cabal install transformers-base
Resolving
...
I am surely missing something here...
Regards
J-C
On Thu, May 9, 2013 at 4:13 PM, Sjoerd Visscher sjo...@w3future.com wrote:
There's a flag to turn it off, does that work? Try cabal install
transformers-base -f-OrphanInstances
Sjoerd
On May 9, 2013, at 2:47 PM, jean-christophe
-- Forwarded message --
From: jean-christophe mincke jeanchristophe.min...@gmail.com
Date: Thu, May 9, 2013 at 7:08 PM
Subject: Fwd: [Haskell-cafe] Error compiling transformers-base-0.4.1
(debian 64 bits, ghc-7.4.2)
To: haskell-cafe@haskell.org haskell-cafe@haskell.org
Thank you
Hello
GHC version : 7.4.2
When I do a cabal-dev instal yesod-core, I get the following error:
Loading package blaze-builder-conduit-0.5.0.3 ... linking ... done.
Loading package hashable-1.2.0.5 ... linking ... ghc:
lookupSymbol failed in resolveImports
Hello Café,
I am using quicheck for some kind of non trivial tests.
The general form of these tesst is summarized by the following code.
-- Function to be tested. Given a list of splitting functions, split the
given list
process :: [a] - [[a] - [a]] - [a]
process l splitFuns =
List.foldl
OK thanks everybody !
On Thu, May 26, 2011 at 12:14 PM, Brandon Allbery allber...@gmail.comwrote:
On Thu, May 26, 2011 at 06:10, Christopher Done
chrisd...@googlemail.com wrote:
This kicks everyone in the butt at least once. It would be good if GHC
could point it out, as mine (6.12.3) just
Hello,
Could anyone help me understand what is wrong with the definition of f2 in
the code below?
class C a b where
convert :: a - b
convertToInt :: (C a Int) = a - Int
convertToInt x = convert x
f1 x = convertToInt x
f2 = \x - convertToInt x
f3 :: (C a Int) = a - Int
f3 = \x -
Hello,
I have just discovered WebSharp, a .Net product for web development that
allows you to write client code in F# and have it translated into
javascript.
Does anyone know about somethig similar in Haskell?
Thank you
Regards
J-C
___
Haskell-Cafe
Oleg,
I am using GHC 6.12.3
Here a reproduction:
in the file Template.hs
proc () = runIO $ do runQ [|1+1|]
proc' () = [|1+1|]
In the file Main.hs
i1 = $(proc ()) -- fails at compile time with Segmentation
fault/access violation in generated code. Maybe is it the expected
behavior, I
Hello,
Does anyone know a clean solution to pass information between 2 executions
of splicers.
Ex.
$(splicer ) -- first invocation gather and store some data
$(splicer ...) -- second one use the data gathered above.
Thank you
Regards
J-C
Hello,
I am still playing with template-haskell...
I wonder, is there any reason why a quasiquoter cannot create haskell
statements and declarations in addition to expressions and patterns? Or more
generally create any legal Haskell syntax tree.
I.e Suppose I would like to create a quasiquoter
Hello,
I am still playing with template-haskell...
I wonder, is there any reason why a quasiquoter cannot create haskell
statements and declarations in addition to expressions and patterns? Or more
generally create any legal Haskell syntax tree.
I.e Suppose I would like to create a quasiquoter
Hello,
Is it possible for a quasi quoter to have access to information about
haskell identifiers declared before the quasi-quotation?
I tried the 'reify' function but without success.
Just as in the following exemple:
a = 6
x = [$expr|a|]
Where the generated haskell code is
a= 6
x = a
Hello Cafe,
More as an exercice than anything else I would like to write a small
database application which would allow a user to read/write data from/to a
DB.
The user would interact with the application via a web browser.
Which (reliable/stable/workable) packages are the best for this task? I
Hello,
Has there already been attempts to introduce lisp like symbols in haskell?
Thank you
Regards
J-C
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I think lisp like symbols could be quite useful in the context of embedded
DSL to create ... well... symbols that can be interpreted as variables in
that DSL.
I can imagine something such as a small relational DSL i.e
Without symbols we have several alternatives:
1. Symbols are written as
Hello,
I am writing a port to F# of some haskell standard libraries.
I would like to publish them under an open source license and mention the
origin of the initial code.
www.haskell.org is under the simple permissive license. Does this license
also cover the souce code available from that
Hello,
Thank everybody for the answers.
I must admit that I did not really emphasize the goal behind my initial
question. Which is better expressed this way:
'walk' is written is CPS and is tail recursive. Unless I am wrong , if the
continuation monad is used, the recursive calls to 'walk' are
Hello,
I would like to get some advice about state monad (or any other monad I
guess) and CPS.
Let's take a simple exemple (see the code below)
'walk' is a function written in CPS that compute the number of nodes
leaves in a tree. It use a counter which is explicitly passed through calls.
Hello Rouan
My bible : The dragon book of Aho, Sethi Ullman
http://en.wikipedia.org/wiki/Compilers:_Principles,_Techniques,_and_Tools
Regards
J-C
On Wed, May 6, 2009 at 8:07 AM, Rouan van Dalen rvda...@yahoo.co.uk wrote:
Hi everyone.
I am designing my own programming language.
I would
functions, P
Caspi, M Pouzet.
[2] Plugging a space leak with an arrow, H. Liu, P. Hudak
--
Regards,
Paul Liu
Yale Haskell Group
http://www.haskell.org/yale
On 4/20/09, jean-christophe mincke jeanchristophe.min...@gmail.com
wrote:
In a post in the *Elerea, another FRP library *thread*,* Peter
this, since they
just
use an Euler integrator, as do many games. As long as the time steps are
tiny enough this usually works good enough. But I wouldn't use these
FRPs
to
guide an expensive robot or spaceship at high precision :-)
On Tue, Apr 21, 2009 at 11:48 AM, jean-christophe mincke
In a post in the *Elerea, another FRP library *thread*,* Peter Verswyvelen
wrote:
*I think it would be nice if we could make a reactive benchmark or
something: some tiny examples that capture the essence of reactive systems,
and a way to compare each solution's pros and cons.* *
*
*For example
Hello
What do you think of this? There is perhaps a recursive call that should be
made tail recursive but it seems to work.
The 'group' function takes the list of pairs as input and outputs a list of
maps from key to sums.
The nth element of the list of maps corresponds to the grouping applied
I discovered Haskell about a year and half ago, along with F#.
Beginning with both languages was relatively easy but I already had
experience of FP in lisp and scheme.
And some years ago I took a course in FP (learning CAML which F# is closely
based on).
My study of haskell went smooth up to the
constraints are implicitly taken into account. If I remember well,
the magical trick is to use langrangian multipliers.
The difficult here (especially in the context of aFRP) is to derive the new
equations.
Hope it helps
Regards
Jean-Christophe Mincke
2009/3/6 Peter Verswyvelen bugf...@gmail.com
Regards
Jean-Christophe Mincke
2009/3/6 Peter Verswyvelen bugf...@gmail.com
Regarding hpysics, did anybody did some experiments with this? The blog
seems to be inactive since december 2008; has development ceased?
Do alternatives exist? Maybe good wrappers (hopefully pure...) around
- tn) * tc =
Collision_position
Once tc is known, replace your system as explained above with S'(t) , t= tc
The condition here is that [tn, tn+1] must be choosen small enough in order
that the assumption if linearity holds.
Regards
Jean-Christophe Mincke
On Fri, Mar 6, 2009 at 2:26 PM, jean
Hello,
Given a type T, this type identifies a set of values and this set can be
deduced from the structure of type T.
i.e the type String is the set of all possible lists of character whatever
their length.
This being said, I have the following question:
Given a type T, how is it possible to
Marc
What is this strange syntax
columns = [ (trackId, conT *''Int* )
It looks like a not ended string literal unless I still have sth to learn
about Haskell.
Thank you
J-C
On Thu, Sep 25, 2008 at 12:03 AM, Marc Weber [EMAIL PROTECTED] wrote:
On Wed, Sep 24, 2008 at 11:17:01PM +0200,
Hello,
I have installed GHC and cygwin on windows XP and I am trying to build the
unix package (required to install HApps)
** When I use .../ghc/gcc as c compiler I receive the following error during
the configure*
D:\temp\haskell\unix-2.3.0.0runhaskell Setup configure --ghc
32 matches
Mail list logo
