Hi Karel,
I'm a (the? ;-) very keen user of CAL (ex user at the moment, as work and
family doesn't leave me enough time for side projects).
Pro:
- Very solid and high quality, practically bug-free in my experience.
- Performs some useful optimisations (self tail recursion as iteration,
On 11/11/2010, at 7:42 AM, Padma wrote:
We are looking for a entry level Haskell programmer who has experience in
porting from Haskell to java. Please contact me by Email or you can call me
at 408-207-9367.
You could look at CAL/OpenQuark -- https://github.com/levans/Open-Quark --
which
On 05/11/2010, at 4:11 PM, Luke Palmer wrote:
Also they don't
scale well, which I guess means that they don't make it inconvenient
to design badly.
And they don't communicate enough information about the
preconditions/postconditions of their functions to easily allow large programs
to
On 20/09/2010, at 6:36 AM, Johannes Waldmann waldm...@imn.htwk-leipzig.de
wrote:
from time to time request for Haskell running on top of Java's VM pops
on the haskell related mailing list and then usually dies off when
someone mentions that JDK does not have proper support for tail-calls.
I use CAL for various hobby projects, and despite development being quiet I
find it robust. I suspect that the lack of extensions over Haskell 98 puts some
people off.
Tom
On 10/09/2010, at 5:31 AM, Karel Gardas karel.gar...@centrum.cz wrote:
Hello,
as this is really friendly forum, I'd
On 03/08/2010, at 10:09 PM, Ertugrul Soeylemez wrote:
Tom Davies tgdav...@gmail.com wrote:
I find it convenient sometimes to convert a Maybe value to an Either
thus (excuse the syntax, it's CAL, not Haskell):
maybeToEither :: a - Maybe b - Either a b;
maybeToEither errorValue = maybe
I find it convenient sometimes to convert a Maybe value to an Either thus
(excuse the syntax, it's CAL, not Haskell):
maybeToEither :: a - Maybe b - Either a b;
maybeToEither errorValue = maybe (Left errorValue) (\x - Right x);
but that seemingly obvious function isn't in Hoogle, AFAICT, so
On 28/05/2010, at 12:26 PM, Jens Petersen wrote:
On 16 May 2010 05:13, Henning Thielemann
schlepp...@henning-thielemann.de wrote:
http://resources.businessobjects.com/labs/cal/gemcutter-techpaper.pdf
Does anyone have the url to the source code?
(I guess businessobjects was acquired by
On 20/05/2010, at 9:53 AM, Richard O'Keefe wrote:
The key point is the 'that would NATURALLY have', which I take
to mean as a result of type inference without any forcibly
imposed type signatures.
In my second edition of Bird, the question just says: Give examples of
functions with the
On 18/04/2010, at 1:39 PM, Darrin Chandler wrote:
I recently purchased an Android phone and spent a little time looking
around to see if Haskellers were doing anything there, but no luck so
far. Has anyone here done anything with Android?
Not Haskell, but FP on Android:
On 30/03/2010, at 9:01 AM, Richard O'Keefe wrote:
There is some evidence that arrows may go back 60,000 years,
which is time enough for some evolutionary effect.
IIRC, Hughes defined arrows last millenium, which makes them no more than 1000
years old.
I certainly find that I have no innate
On 18/03/2010, at 9:49 AM, Matthias Görgens wrote:
Hi Peter,
Interesting. Your skip lists do not need re-balancing, but they do
destructive updates. I wonder which factor outweighs the other in
practise.
Isn't destructive update a feature in this case? i.e. these skip lists are
On 04/03/2010, at 8:28 PM, Curt Sampson wrote:
... I recommend reading The Typeclassopedia,[1], which will
introduce you to all of the monad's friends and family.
[1]: http://byorgey.wordpress.com/2009/03/16/monadreader-13-is-out/
I'd love to read a book-length version of the
On 10/02/2010, at 2:52 AM, Tim Wawrzynczak wrote:
Oops, you're right. It's not pure. Mea cupla for not reading more closely.
I wonder how it deals with I/O, then? I don't see anything like Haskell's
monads or Clean's uniqueness typing... but at a closer look it does appear
to have an
On 28/09/2009, at 7:38 AM, Peter Verswyvelen wrote:
That's not really true. Just use CAL from the Open Quark
framework... It's almost Haskell 98, with some extras, and compiles
to fast JVM code.
http://openquark.org/Open_Quark/Welcome.html
They even seem to do all kinds of advanced
On 29/09/2009, at 1:59 AM, Peter Verswyvelen wrote:
That's a really shame. Any idea why?
On Mon, Sep 28, 2009 at 3:02 PM, John A. De Goes j...@n-brain.net
wrote:
CAL is interesting, but unfortunately dead, and has no community.
I think Haskell users would miss too many of the post 98
On 12/08/2009, at 9:09 PM, Peter Verswyvelen wrote:
Is this really the case? Or is just hard to implement?
I mean, if...then...else is always kind of lazy in it's 2nd and 3rd
argument, but I think DDC handles this correctly even with the
presence of side effects (not sure, but it has a little
On 10/08/2009, at 6:34 PM, Sukit Tretriluxana wrote:
Hi all,
I start reading about Closure language (http://clojure.org) and it
seems an interesting language. I don't know much about this language
especially in comparison to Haskell feature by feature. Could it
perhaps be what Haskell
I'm not 100% clear on the behaviour of the STM function orElse. The
documentation says:
Compose two alternative STM actions (GHC only). If the first action
completes without retrying then it forms the result of the orElse.
Otherwise, if the first action retries, then the second action is
tried
Are there generally accepted English language names for the arrow combinators?
compose?
pair?
etc...
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Andrew Coppin andrewcoppin at btinternet.com writes:
[snip]
You might like to look at OpenQuark: http://labs.businessobjects.com/cal/
-- its 'GemCutter' provides a visual environment for linking together functions
written in a Haskell-like language.
I'm not sure if it would be flexible enough
Newbie question:
I was wondering the other day if type synonyms might be more useful
if they were more restricted, that is, with the definitions:
type Foo = String
type Bar = String
foo :: Foo
foo = a foo
bar :: Bar
bar = a bar
x :: Foo - ...
x f b = ...only valid for Foo Strings...
both 'x
Andrew Wagner wagner.andrew at gmail.com writes:
If you change your type declarations to 'newtype' declarations, I
believe you would get the effect that you want, depending on what you
mean by 'equivalent'. In that case, Foo and Bar would essentially be
strings, but you could not use either
Tom Davies tomdavies at exemail.com.au writes:
[snip]
Apologies for the complete misinformation! I don't know what I was thinking!
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Neil Rutland neilrutland2 at hotmail.com writes:
[snip]
type Bob = [(Int, Int)]
newLine :: Bob
newLine = [(1,4)]
i have tried to use the follwing but it returns the error below it.
newLine !! 0 - (so that should give it the newLine list and try and return
the 1st element of the list)
25 matches
Mail list logo
