@TheAspiringHacker @jmc Think about permutations. There are m^n ways to choose from a list of m things n times. For instance, there are 26^5 different 5-letter strings. A function between finite sets A and B chooses an element of B for each A. That is, it chooses from a list of b things a times. There are b^a ways to do this, so that’s how many possible functions there are.

Here's a digestible example of the practical benefit of type safety.

In this case of vs. , Rust bites the head off JavaScript because it forces you to check your pointers before you use them.


cc @codesections

Announcing a Koka and Madoko Homebrew tap Show more

Formalizing 100 famous theorems in Coq Show more

Why #functionalcafe? Show more

Hello! I'm trying out Mastodon for the first time. I've been at plus.google.com/+SeanLeather but Google announced it will shut down next year, so I thought I'd try something else. I tried Twitter a long time ago and didn't like it. So let's see how this experiment goes!

Functional Café

functional.cafe is an instance for people interested in functional programming and languages.