Description:
Dependent types can encode arbitrary mathematical propositions, a fact which defies the intuition of most programmers. You can express the type of “sorted lists,” “prime numbers,” “functions which return the max of two given numbers,” or even “programs which implement a particular specification”-and a type checker can enforce such properties statically! This talk will be a short motivational introduction to dependent types, how they work, and how they can be used to prove properties about programs.
slides:
github.com/lam...
13 окт 2017
