Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Hot stripping coqs

Name: Anonymous 2012-04-26 17:03

Hello proggers.

How do I discharge this goal in Coq?

Inductive type : nat -> Set := ctor : forall n, type n.
Goal forall n, type 0 <> type (S n).

Name: Anonymous 2012-04-26 18:20

discharge my anus

Name: Anonymous 2012-04-26 18:48

Name: Anonymous 2012-04-26 23:02

>>3
>coq-club
i diggity'd

Name: Anonymous 2012-04-26 23:27

Coq my anus

Name: Anonymous 2012-04-27 3:34

>>3

Thanks anon, but I just can't find a similar property for type.

Name: BG 2012-04-27 7:13

Clojure.

Name: Anonymous 2012-04-27 7:50

>>6

So now I've got this, but have a little problem interpreting the error message.

Error: Abstracting over the term "type 0" leads to a term
"fun P : Set => tZ P getn" which is ill-typed.


Inductive type : nat -> Set := ctor : forall n, type n.
Definition tZ X f := forall x : X, f x = 0.
Definition getn {n} (x : type n) := n.
Lemma tZO : tZ (type 0) getn. compute. auto. Qed.
Lemma tZS : forall n, ~tZ (type (S n)) getn. intro. intro. compute in H. assert (Hx := H (ctor (S n))). discriminate. Qed.
Require Import Setoid.
Goal forall n, type 0 <> type (S n). intro. intro. assert (HO := tZO). assert (HS := tZS n). rewrite H in HO.

Name: Anonymous 2012-04-27 11:14

>>2,5
[b]DISCHARGE COQ IN MY ANUS[b]

Name: Anonymous 2012-05-19 9:55

Wizards of the coed halp plox111 How do I make my coq to accept this?

Definition fb (x : bool) : Set := nat.
Definition fn (x : nat) : Set := nat.
Definition depx (b : bool) (x : if b then bool else nat) (y : if b then fb x else fn x) := 0.

Name: Anonymous 2012-05-19 10:59

My coq accepts lots of things, so there might be something wrong with your coq.

Name: Anonymous 2012-05-19 15:09

>>10
Definition fb (x : bool) : Set := nat.
Definition fn (x : nat) : Set := nat.

(* New decision procedure because bool_dec is annoying. *)
Lemma bool_true_false (b : bool) : {b = true} + {b = false}.
destruct b.
  left. reflexivity.
  right. reflexivity.
Defined.
(* Print bool_true_false. *)

Definition bool_or_nat (b : bool) := if b then bool else nat.

(* Use eq_rect to convert "x : bool_or_nat b" to "x : bool_or_nat true" using "b = true" *)
Definition depx
  (b : bool)
  (x : bool_or_nat b)
  (y : match bool_true_false b with
         | left H => fb (eq_rect b bool_or_nat x true H)
         | right H => fn (eq_rect b bool_or_nat x false H)
       end)
  := 0.

Name: Anonymous 2012-05-19 16:18

suck my coq

Name: Anonymous 2012-05-19 20:00

>>12
Thanks anon, you are a Gentleman and a Scholar!

Name: Anonymous 2012-05-21 16:05

All play and no work makes Jack a wise man.

Name: bampu pantsu 2012-05-29 4:39

bampu pantsu

Name: Anonymous 2013-06-18 4:13

I am currently in the process of porting Coq to Bonerlang.

Name: Anonymous 2013-06-18 4:20

I am currently making a Coq port into MyAnus.

Name: Anonymous 2013-06-18 7:10

I haven't been laid in a year. :( I think it's my coq. What version are you guys running?

Name: Anonymous 2013-06-18 7:17

Last time I had to hack my coq things got pretty messy.

Name: Anonymous 2013-06-18 8:08

Goddamnit, why did you have to bump this thread?  Any minute now L.A.Calculus is going to show up and call us all MATH NERDS and STACK BOYZ.

Name: Anonymous 2013-06-18 21:01

>>21
We'll just tell him to suck a coq.

Name: Anonymous 2013-06-20 6:09

I am offended by the usage of sexual humour in this thread on a public programming board. It is inappropriate and it creates a hostile environment to women.

Name: Anonymous 2013-06-20 8:09

you can't, this is independent of Coq

you can only disprove a <> b for a,b : Set if they have a different number of elements.

Name: Anonymous 2013-06-20 16:48

HARD COCKS

Don't change these.
Name: Email:
Entire Thread Thread List