Explore >> Select a destination
|
You are here 
|
adam.chlipala.net | ||
| | | | |
math.andrej.com
|
|
| | | | | ||
| | | | |
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. | |
| | | | |
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... | |
| | | | |
julesh.com
|
|
| | | This post picks up where the exposition in the first installment left off, before the sideline development in the second installment. I never intended to make a blog post in sonata form, but there we are. Code for this post can be found here. If we'd like both our forwards and backwards passes to live... | ||
