@Nolansan It knows what to keep and what to forget, it's magic. For example tail recursion is internally treated as a loop and just overwrites all the values on each iteration. It looks like a function that's calling itself forever but actually it uses a fixed amount of memory since it "knows" that all the intermediate values are not accessible from anywhere else.
Pointless introduction (to Haskell). Haskell without monads and type classes is just optionally typed ML or Lisp with sugar. He barely touches upon the actually important (to Haskell) aspects.
Code samples=great, Functional=great, Haskell should be used a lot more inside ChromeOS and Chrome as a better way for the internals to be architected and strictly controlled. Great presentation since Haskell content is ALWAYS desired, enjoyed, and overly welcome to me and for use at Google itself.
I learned some Haskell last year and is one of the most amazings languages I've ever seen (like APL, but I've never been able to code a single line).
It includes other wonderful things such as list comprehensions, where you define a list just writing the conditions that every element must satisfy to be include in it.
y = [ x | con1, cond2, ... condN]
For example, x is an element of list y if it's included in the list of intergers 1 to 50, and also x is odd:
Impressive, this actually made me interested in Haskell! Could the questions be added as subtitles? Makes it easier to figure out what is actually being answered :)
Nice. I wonder how effective people will learn with this. Perhaps we could setup another tryhaskell tutorial that uses these examples, so you can watch the tutorial and play with the examples as you go along.
@cmatt85 I dunno. I work with Lisp professionally, and Lisp really lacks any of the guarantees that Haskell provides. Although Haskell is definitely derived from a lot of concepts created in Lisp, the resulting language is a different beast all together.
Watching it after learning category theory basics I feel really really smart :D
noobyfromhell 3 months ago
@noobyfromhell where did you learn it? i wish you'd say "an essay".
someman7 2 months ago
@someman7 Self-study. There's also a great YouTube channel TheCatsters.
noobyfromhell 2 months ago
if there is no state change, after a program is running for a long time don't you just accumulate a ton of data and then run out of memory?
Nolansan 3 months ago
@Nolansan It knows what to keep and what to forget, it's magic. For example tail recursion is internally treated as a loop and just overwrites all the values on each iteration. It looks like a function that's calling itself forever but actually it uses a fixed amount of memory since it "knows" that all the intermediate values are not accessible from anywhere else.
heloizyjhenifer 3 months ago
if you are fine with haskell, master the next step and use the coq programming language oder the agda programming language.
stvienna 3 months ago
This guy is win :D
6006133 4 months ago
This has been flagged as spam show
Pointless introduction (to Haskell). Haskell without monads and type classes is just optionally typed ML or Lisp with sugar. He barely touches upon the actually important (to Haskell) aspects.
shtole 4 months ago
Comment removed
shtole 4 months ago
Programming in Haskell isn't normal, but on meth it is.
lennyhome 4 months ago 8
Code samples=great, Functional=great, Haskell should be used a lot more inside ChromeOS and Chrome as a better way for the internals to be architected and strictly controlled. Great presentation since Haskell content is ALWAYS desired, enjoyed, and overly welcome to me and for use at Google itself.
heavensrevenge 4 months ago
I learned some Haskell last year and is one of the most amazings languages I've ever seen (like APL, but I've never been able to code a single line).
It includes other wonderful things such as list comprehensions, where you define a list just writing the conditions that every element must satisfy to be include in it.
y = [ x | con1, cond2, ... condN]
For example, x is an element of list y if it's included in the list of intergers 1 to 50, and also x is odd:
y = [ x | x<-[1..50], odd x ]
endermuabdib 4 months ago 2
Throws brain in garbage. Plays with genitals for rest of life.
r3bol 4 months ago
Impressive, this actually made me interested in Haskell! Could the questions be added as subtitles? Makes it easier to figure out what is actually being answered :)
JobLeonard 4 months ago 14
Nice. I wonder how effective people will learn with this. Perhaps we could setup another tryhaskell tutorial that uses these examples, so you can watch the tutorial and play with the examples as you go along.
ChristopherDone 4 months ago
So much of this sounds like lisp to me.
cmatt85 4 months ago
@cmatt85 I dunno. I work with Lisp professionally, and Lisp really lacks any of the guarantees that Haskell provides. Although Haskell is definitely derived from a lot of concepts created in Lisp, the resulting language is a different beast all together.
AshtonK1816 4 months ago
@AshtonK1816 Thanks for the reply. I look forward to learning more about Haskell.
cmatt85 4 months ago
kind of a rough start
dmh24 4 months ago