
Sign up to save your podcasts
Or
For programs to make sense as proofs, they need to be terminating (cannot run forever), since otherwise you can write infinite loops that have any type. Under Curry-Howard this means any formula is provable, which is one way to define inconsistency. (And logics have to be consistent to be useful.)
5
1717 ratings
For programs to make sense as proofs, they need to be terminating (cannot run forever), since otherwise you can write infinite loops that have any type. Under Curry-Howard this means any formula is provable, which is one way to define inconsistency. (And logics have to be consistent to be useful.)
274 Listeners
90,949 Listeners
30,845 Listeners
108 Listeners
4,144 Listeners
33 Listeners
15,335 Listeners
35 Listeners
13 Listeners
10,613 Listeners
3,289 Listeners
47 Listeners
28 Listeners