วีดีโอ

I thought this was a good overview. With modern tooling I sometimes find myself not thinking much about spacing and then getting frustrated when the tooling can’t be turned on and I still need to draft. I think the space leakages there are more about algorithmic reasoning, so it’s interesting to see those are more common problems. I didn’t follow the rationale about normal form and why that matters.

let p = unwords $ replicate 4 "Pedro," in p <> " " <> take 2 p Just "kidding a little bit"

80's th-cam.com/video/iMZOrEbS7cU/w-d-xo.html

Годнота пошла

Welsh?

Solid advice.

hi, the notion notes are from an Optics course not this.

In believe you got Interpretable and explainable terms the wrong way round

check out the machine ethics podcast

Dude looks severely distressed. 😢

Okay

hi

I loved her 80s Metal style hair. This is my Final Countdown to be hired Haskell rules!!! \m/

Thanks, that's a very beautiful explanation

How cool you explained this topic!

Thanks!!! That’s was very useful!!!

Can the HR lady brush her teeth?

Congratulations! I hope you guys make a tutorial series on understanding all of these features

Seems I missed definition of algebraic data types.

Great I will buy these. Any chance at adding courses on dependent types when you add that feature? And applied category theory and type theory videos would be great.

serokell.io/courses

Maybe this is too much of an ask.. But possible to improve compiler error messages ??. Rust does a great job of it .

Not clear.. so ?

Yes please

in which way would the specs be simplified and how would error messages be improved? without understanding how this would affect dependent type syntax i am against the breaking change. term and type variables have different scopes, as they should. if the answer to "does x act as its own type?" is "of course not" then the breaking change is unjustified.

if we consider that given any element in category theory this must have a morphism that maps to itself, the right side of the expression is correct because this respect the referential transparency constraint and furthermore can be intuitively understood as a lambda, a short expression to Id function without need using its name

Yes! Require them to be distinct.

Yes. Please. The code that may break should not have been written with the puns like this in the first place. And thanks for the re-upload of the video

The one woman on this channel and she's talking about giving the government more power to make laws and regulations for "human rights" aka postmodernist marxist ideology. Meanwhile everybody else is talking about math and technology. What a surprise 😂

GHC.Generics recently got Generically(1) newtypes. This allows more explicit deriving (ToJSON, FromJSON) via Generically T rather than deriving anyclass.

I have this on max volume and i can still barely hear you because you're mumbling.

Great work and i look forward to where this goes. Any plans on adding this to PureScript as well?

Prior to get known functor, I remember that I used to use a bind to "extract" the value in order to do some computation and then return it wrapped in a pure Particulary, this kind of thing helped me realize what a functor does when I was finally introduced to this concept

Hi Jay! This is an interesting topic, I always try to find out a little more about it when I find something related to this subject Nice shirt, I liked the vintage items around

amazing guy, thanks for this great conversation.

In what museum did record your videos?

nice presentation, tnx

Course sendpoint returns a 404

While the Optics and the Extension courses are present at Udemy at the price of $100. The monads course is not yet published.

I didnt know about some of those extensions. Thanks!

Hi Mr impure pics. Love your impure pics!! ❤

Consider my mind blown.. I'd known about cardinality of types such as Maybe and arrow but taking the cardinality of the list type as a geometric series blew mind.. not to mention using derivatives to build traversals of data types, truly insane stuff.. I love how the tree traversal was somewhat guided by the existing definitions rather than being handed down from the heavens as tree algorithms usually are.. great presentation of the material💯

I can perfectly visualize and understand why Haskell could consume a large chunk of memory. Haskell's laziness is a blessing and a curse at the same time. I mean the language surely is not suitable for system programming where memory is limited but correctness is the critical prize to achieve at all cost.

It would be nice to see how nix secret management can be configured and integrated with vault.

Shouldn't the bfs function be in the graph trait. I think it would have been easier to define the parameters if the function was in the graph trait

I *need* you to know that I love your content so much that I consider time I spent on Twitter worthwhile because I believe that's where I've found you 😻 There's so little material on Haskell programming - much less material that doesn't assume you meet the prerequisites of perfectly understanding lambda calc (though you definitely should strive for that), having written a PhD thesis on Category Theory and regularly converse with Alonzo Church's force ghost to gain insights into how functional programming works in general and in parts; thus, right now every piece of information on Haskell's workings is priceless (for me at least) and extremely helpful. Damn, who knows, maybe one day I'll be able to write actual working production code in Haskell, or at least some personal projects that would just butter my buns, making life so much more bearable. Well, if that happens, you'll be justified in assigning the lion's share of that success to your content being there for me 🥲

Where's the blog

the text animation is quite hard to read

Thank you. Obviously went quite above most heads, this is hardvore learning material, and that is why learning is hard. Some people in the industry tell that Haskell is inapt to manage the complex datatypes, so far not encountered cases what simple Haskell or lenses wouldn't manage. He seems to be active in the LessWrong community. Wanted to drill in the Rational Wiki for some time.

😂❤