Articles

Defunctionalization and Freyd’s Theorem

(Aug 03) #haskell #cpp Save to Pocket

Functional programming finds its basis in functional algebra. Being so closely tied to mathematics means there are quite a few concepts that aren't practically clear, but are still fundamental to its existence. In this extensive article, Bartosz Milewski discusses function objects, Adjoint Functor Theorem, counit, CPS transformation, and defunctionalization.

Monads and Intensionality – Lucid is not an abberation

(Aug 04) #haskell #lucid Save to Pocket

Monads are notorious for being difficult to understand. Maybe they're like quantum physics, where you can assume someone doesn't understand it if they say they do. Well Bill Wadge might have been one of the first to stumble upon the idea of a monad accidentally while cocreating the Lucid programming language. In this articld Bill gives his description of what a monad is, while still claiming to not know what it is.

Alive2 Part 3: Things You Can and Can’t Do with Undef in LLVM

(Jul 31) #llvm #cpp Save to Pocket

Guess how many possible values a boolean could have for an LLVM function. Did you say two? Good job! You're wrong. The correct answer is four, and one of those is undef. If you don't know what that is, John Regehr gives a thorough explanation, highlighting all the things it can and can't do. It's a quick way to get a basis on an unfamiliar topic.

And that's it for today! Discuss this issue at our subreddit r/morningcupofcoding.

Did you like what you read? Let us know by clicking one of the links below.

Liked - Disliked

I hope you enjoyed reading the latest issue of Morning Cup of Coding. If you did, consider supporting us by becoming a patron (Patreon) for perks like ad-free issues, or via a one-time donation via PayPal.

Interested in sponsoring our newsletter? Click here to send us an email.

Cheers,
Alex