(* Fix *)
Canonical Structure add1Pnat n := mkP (plus n 1). Definition test_fix n := (refl_equal _ : W (my_getp _) = W (n + 1)).
(* Case *) Definition pred n := match n with 0 => 0 | S m => m end.
Canonical Structure predSS n := mkP (pred n). Definition test_case x := (refl_equal _ : W (my_getp _) = W (pred x)). Definition test_case' := (refl_equal _ : W (my_getp _) = W (pred 0)).
Canonical Structure letPnat' := mkP 0. Definition letin := (let n := 0 in n). Definition test4 := (refl_equal _ : W (getp _) = W letin). Definition test41 := (refl_equal _ : W (my_getp _) = W letin). Definition letin2 (x : nat) := (let n := x in n).
Canonical Structure letPnat'' x := mkP (letin2 x). Definition test42 x := (refl_equal _ : W (my_getp _) = W (letin2 x)).
Fail Definition test42' x := (refl_equal _ : W (my_getp _) = W x).
(* Simple tests to justify Sort and Prod as "named". They are already normal, so they cannot loose their names,
but still... *)
Structure Sot := mkS { T : Type }. Axiom R : Type -> Prop.
Canonical Structure tsot := mkS (Type). Definition test_sort := (refl_equal _ : R (T _) = R Type).
Canonical Structure tsot2 := mkS (nat -> nat). Definition test_prod := (refl_equal _ : R (T _) = R (nat -> nat)).
(* Var *) Section Foo. Variable v : nat. Definition my_v := v.
Canonical Structure vP := mkP my_v. Definition test_var := (refl_equal _ : W (getp _) = W my_v).
Canonical Structure vP' := mkP v. Definition test_var' := (refl_equal _ : W (my_getp _) = W my_v). End Foo.
(* Rel *) Definition test_rel v := (refl_equal _ : W (my_getp _) = W (my_v v)). Goal True. pose (x := test_rel 2). matchgoalwith x := _ : W (my_getp (vP 2)) = _ |- _ => idtacend. apply I. Qed.
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.