Explore >> Select a destination
|
You are here 
|
bartoszmilewski.com | ||
| | | | |
entropicthoughts.com
|
|
| | | | | ||
| | | | |
pressron.wordpress.com
|
|
| | | | | Abstract: Machine and language models of computation differ so greatly in the computational complexity properties of their representation that they form two distinct classes that cannot be directly compared in a meaningful way. While machine models are self-contained, the properties of the language models indicate that they require a computationally powerful collaborator, and are better... | |
| | | | |
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. | |
| | | | |
www.pl-enthusiast.net
|
|
| | | This post describes the structure, goals, and content of CMSC 330, UMD's sophomore-level programming languages course. This is part 1. | ||
