Differences
This shows you the differences between two versions of the page.
| Last revision Both sides next revision | |||
|
sav08:theorems_as_abstract_data_types [2008/05/28 05:29] vkuncak created |
sav08:theorems_as_abstract_data_types [2008/05/28 05:32] vkuncak |
||
|---|---|---|---|
| Line 13: | Line 13: | ||
| **Introduce theorem as an ADT whose operations correspond to axioms and proof rules.** | **Introduce theorem as an ADT whose operations correspond to axioms and proof rules.** | ||
| + | Then we can write arbitrary programs that compute values of 'theorem' type. All such values will be theorems. | ||
| + | |||
| + | Soundness of the approach: if a value of type 'theorem' is computed, we know there exists an expression formed from ADT operations. This means that there is a proof tree, so the value is a theorem. | ||