Thank you all very much,
I am sitting now and collating all your responses. I'll revert with
questions if I may have.
Indeed, it may be better to have this kind of collateral ready for future
use.
I am going to put my stuff on github considering markdown + pandoc.
Regards,
Kashyap
On Sat,
So this is a good question, sorry for the late reply. It's tricky as
the way typeclasses are imported and exported in Haskell is confusing.
Basically, instances are hard to control access to as they aren't part
of import or export statements. Importing a module that defines an
instances gives you
I have the opportunity to make a presentation to folks (developers and
managers) in my organization about Haskell - and why it's important - and
why it's the only way forward.
Haskell is important, but not the only way forward. Also, there have been
other great languages, with limited impact - i
On 6/1/12 12:45 AM, Jonathan Geddes wrote:
> Thanks, Wren, I really appreciate the detailed response! Though I am
> surprised that Template Haskell isn't on your list. From the little I know
> of TH it seems like all of the interesting generic/generative stuff is done
> with TH. Do the other extens
On 6/1/12 6:11 AM, Gábor Lehel wrote:
> On Fri, Jun 1, 2012 at 6:29 AM, wren ng thornton wrote:
>>
>> TypeFamilies (aka TFs)
>> These are really nifty and they're all the rage these days. In
>> a formal sense they're equivalent to fundeps, but in practice
>> they're wea
Hi Benjamin,
On Fri, Jun 1, 2012 at 9:54 PM, Benjamin Redelings wrote:
>I have written an interpreter that operates on the lambda calculus
> augmented with letrec, constructors, case, primitive objects, and builtin
> operations. I'd like to display the internal state of the intepreter at
> v
Hi,
I have written an interpreter that operates on the lambda calculus
augmented with letrec, constructors, case, primitive objects, and
builtin operations. I'd like to display the internal state of the
intepreter at various points so that I can, um, debug the "programs"
that I've writte
We have recently delivered a two-day hands-on Haskell training at
Qualcomm. As Chris points out, parsing and concurrency/parallelism are
the undisputed strengths of Haskell, so we used them extensively. The
first day was dedicated to writing a parser of arithmetic expressions
with symbolic vari
> So anyway I'd like to request feedback: where can I use Haskell besides
> simple CLI utilities, dull server code, or project Euler problems? Even
> if it's just to contribute to getting Haskell in the environments
> mentioned above, any feedback is welcome!
Well I have used it for some not-so-ty
wren ng thornton writes:
> There are a bunch which are mostly just syntax changes. The important
> ones are:
Also, if you have new GHC, it will often tell you if/when you need to
enable extensions. E.g.:
Line 8: 1 error(s), 0 warning(s)
`Pos' has no constructors (-XEmptyDataDecls permits
C K Kashyap writes:
> c) Where's my inheritance?
I was of the impression that OO has crawled our way, for instance
frowing upon (implementation) inheritance and mutable data structures.
Maybe you could find appropriate references? Lots of language
development these days seems to be looking
Hi Cafe,
Is there a reason that the GHCi interpreter doesn't detect and report
infinite loops in statements like this (like compiled programs do) even
though no CPU time appears to be used? My (admittedly weak) searching for
an answer didn't turn much up.
let s | not $ null s = [] in s
GHCi v7.0
On Jun 1, 2012, at 6:11 AM, Gábor Lehel wrote:
> On Fri, Jun 1, 2012 at 6:29 AM, wren ng thornton wrote:
>>
>>TypeFamilies (aka TFs)
>>These are really nifty and they're all the rage these days. In
>>a formal sense they're equivalent to fundeps, but in practice
>>they
> > I love Haskell. It is my absolute favorite language.
> > But I have a very hard time finding places where I can actually use it!
>
> have you considered "your head" as such a place that should be easy to find.
Excellent advice. Haskell shines unusually brightly on
applications that have an a
> Then I wrote about a dozen lines of Haskell to do the job--and running
time turned out to be O(n^2).
Do you still have the code?
2012/6/1 Doug McIlroy
> > > I love Haskell. It is my absolute favorite language.
> > > But I have a very hard time finding places where I can actually use it!
> >
>
> > I love Haskell. It is my absolute favorite language.
> > But I have a very hard time finding places where I can actually use it!
>
> have you considered "your head" as such a place that should be easy to find.
An excellent reason. Haskell shines unusually brightly on
applications that have a
Hello,
2012/6/1 Iavor Diatchki :
> There is no problem if an instances uses a type family in it's
> assumption---the instances should be accepted only if GHC can see enough of
> the definition of the type family to ensure that the functional dependency
> holds. This is exactly the same as what it
Yes, it's that one, the first Quickcheck paper, thanks.
The link on the wikipedia page is also dead.
2012/6/1 Ivan Perez
> Is this the paper you are looking for:
> http://www.eecs.northwestern.edu/~robby/courses/395-495-2009-fall/quick.pdf
> ?
>
> On 1 June 2012 11:20, Yves Parès wrote:
> > Ye
Is this the paper you are looking for:
http://www.eecs.northwestern.edu/~robby/courses/395-495-2009-fall/quick.pdf
?
On 1 June 2012 11:20, Yves Parès wrote:
> Yes ^^ but I can't find this paper, Koen Claessen website doesn't mention it
> and the link on the page
> http://www.haskell.org/haskellwi
See the Further Reading section on the wikipedia page you provided
(http://en.wikipedia.org/wiki/Quickcheck), not all links are dead.
2012/6/1 Yves Parès :
> Yes ^^ but I can't find this paper, Koen Claessen website doesn't mention it
> and the link on the page
> http://www.haskell.org/haskellwiki
Yes ^^ but I can't find this paper, Koen Claessen website doesn't mention
it and the link on the page
http://www.haskell.org/haskellwiki/Introduction_to_QuickCheck is dead.
2012/6/1 Janis Voigtländer
> Am 01.06.2012 12:00, schrieb Yves:
>
>> Out of curiosity, does someone know if QuickCheck was
On Fri, Jun 1, 2012 at 6:29 AM, wren ng thornton wrote:
>
> TypeFamilies (aka TFs)
> These are really nifty and they're all the rage these days. In
> a formal sense they're equivalent to fundeps, but in practice
> they're weaker than fundeps.
Is that still true? The reason
Am 01.06.2012 12:00, schrieb Yves:
Out of curiosity, does someone know if QuickCheck was the first test
framework working through test by properties associated with random
generation or if it drew the idea from something else?
Because the idea has be retaken by a lot of frameworks in several lan
Out of curiosity, does someone know if QuickCheck was the first test
framework working through test by properties associated with random
generation or if it drew the idea from something else?
Because the idea has be retaken by a lot of frameworks in several languages
(see http://en.wikipedia.org/w
24 matches
Mail list logo
