This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Inductive R : nat -> nat -> nat -> Prop := | |
| c1 : R 0 0 0 | |
| c2 : forall m n o, R m n o -> R (S m) n (S o) | |
| c3 : forall m n o, R m n o -> R m (S n) (S o) | |
| c4 : forall m n o, R (S m) (S n) (S (S o)) -> R m n o | |
| c5 : forall m n o, R m n o -> R n m o. | |
Require Import Omega. | |
Theorem R_is_plus : |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Require Import Arith List Omega Program. | |
Definition fvar : Type := nat. | |
Definition bvar : Type := nat. | |
Inductive sort : Type := | |
| N : sort | |
| ArrowS : sort -> sort -> sort. | |
Definition env := list (fvar * sort). |