Explore >> Select a destination
|
You are here 
|
rakhim.org | ||
| | | | |
programmingmadecomplicated.wordpress.com
|
|
| | | | | There are these things that, depending on your definition, many or all programming languages use: 'types'. There's also a rich mathematical study of types in Type Theory which, along with related disciplines, has many connections to logic and proof. Why? Often, they take the form of explicit 'annotations' to program artefacts, big and small. For... | |
| | | | |
bartoszmilewski.com
|
|
| | | | | This is part 13 of Categories for Programmers. Previously: Limits and Colimits. See the Table of Contents. Monoids are an important concept in both category theory and in programming. Categories correspond to strongly typed languages, monoids to untyped languages. That's because in a monoid you can compose any two arrows, just as in an untyped... | |
| | | | |
cronokirby.com
|
|
| | | | | Exploring 3 different ways of encoding the natural numbers - Read more: https://cronokirby.com/posts/2020/08/encoding-the-naturals/ | |
| | | | |
daniellefong.com
|
|
| | | The following occurred to me on a run about two years ago: It's not given much press, but the the Halting Problem is intimately related to Gödel's First Incompleteness Theorem. Indeed it produces it as a correllary. Historically, Gödel's incompleteness results were proved by hacking arithmetic into a Turing complete system, and this is still... | ||
