Explore >> Select a destination
|
You are here 
|
adam.chlipala.net | ||
| | | | |
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. | |
| | | | |
math.andrej.com
|
|
| | | | | ||
| | | | |
www.artima.com
|
|
| | | | | ||
| | | | |
mmhaskell.com
|
|
| | | |||
