Explore >> Select a destination
|
You are here 
|
www.parsonsmatt.org | ||
| | | | |
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... | |
| | | | |
www.haskellforall.com
|
|
| | | | | Prelude Some time ago I asked a question on /r/haskell about what unique purpose GADTs served that other language features could not prov... | |
| | | | |
regex101.com
|
|
| | | Regular expression tester with syntax highlighting, explanation, cheat sheet for PHP/PCRE, Python, GO, JavaScript, Java, C#/.NET, Rust. | ||
