Explore >> Select a destination
|
You are here 
|
kuruczgy.com | ||
| | | | |
bartoszmilewski.com
|
|
| | | | | This is part 9 of Categories for Programmers. Previously: Functoriality. See the Table of Contents. So far I've been glossing over the meaning of function types. A function type is different from other types. Take Integer, for instance: It's just a set of integers. Bool is a two element set. But a function type a->b... | |
| | | | |
sitr.us
|
|
| | | | | Dependent types provide an unprecedented level of type safety. A quick example is a type-safe printf implementation. They are also useful for theorem proving. According to the Curry-Howard correspondence, mathematical propositions can be represented in a program as types. An implementation that satisfies a given type serves as a proof of the corresponding proposition. In other words, inhabited types represent true propositions. | |
| | | | |
tcode2k16.github.io
|
|
| | | | | a random blog about cybersecurity and programming | |
| | | | |
emanueleviola.wordpress.com
|
|
| | | This is a book about computational complexity theory. However, it is perhaps sui generis for various reasons: 1. The presentation is also geared towards an algorithmic audience. Our default model is the RAM (Chapter 1), the standard model for algorithmic research. This is in contrast with other texts which focus on tape machines. I reduce... | ||
