@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.
Carnap: An Open Framework for Formal Reasoning in the Browser
Announcing a Koka and Madoko Homebrew tap
I haven't been on Mastodon long, but I'm excited to make my first announcement of something I've been working on over the past week.
Formalizing 100 famous theorems in Coq
"This is an appendix to Freek Wiedijk's webpage on the 'top 100' mathematical theorems, to keep track of the statements of the theorems that are formalised in Coq."
Hello! I'm trying out Mastodon for the first time. I've been at https://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.cafe is an instance for people interested in functional programming and languages.