Created
December 8, 2012 22:48
-
-
Save anonymous/4242358 to your computer and use it in GitHub Desktop.
Dealing with absurdity in Coq.
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 Fin : nat -> Set := | |
| | fzero : forall {n:nat}, Fin (S n) | |
| | fsucc : forall {n:nat}, Fin n -> Fin (S n). | |
| Lemma nonempty : forall f:Fin O, False. | |
| Proof. intros H; inversion H. Qed. | |
| Definition not_so_magic {A:Set} (f:Fin O) : A := | |
| match nonempty f with | |
| end. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment