Definition iszero (n : nat) : bool :=
match n with
| O => true
| _ => false
end.
Functional Scheme iszero_ind := Induction for iszero Sort Prop.
intros x eg.
functional induction iszero x; simpl.
trivial.
inversion eg.
Qed.
Function ftest (n m : nat) : nat :=
match n with
| O => match m with
| O => 0
| _ => 1
end
| S p => 0
end.
(* MS: FIXME: apparently can't define R_ftest_complete. Rest of the file goes through. *)
intros n m.
functional induction ftest n m; auto.
Qed.
intros m.
functional induction ftest 0 m.
auto.
auto.
auto with *.
Qed.
Function lamfix (m n : nat) {struct n } : nat :=
match n with
| O => m
| S p => lamfix m p
end.
(* Parameter v1 v2 : nat. *)
intros v1 v2.
functional induction lamfix v1 v2.
trivial.
assumption.
Defined.
(* polymorphic function *)
Functional Scheme app_ind := Induction for app Sort Prop.
intros A l l'.
functional induction app A l l';  intuition.
rewrite <- H0; trivial.
Qed.
Require Export Arith.
Function trivfun (n : nat) : nat :=
match n with
| O => 0
| S m => trivfun m
end.
(* essaie de parametre variables non locaux:*)
Parameter varessai : nat.
functional induction trivfun varessai.
trivial.
assumption.
Defined.
Functional Scheme triv_ind := Induction for trivfun Sort Prop.
intros n'.
functional induction trivfun n'.
trivial.
assumption.
Qed.
Function iseven (n : nat) : bool :=
match n with
| O => true
| S (S m) => iseven m
| _ => false
end.
Function funex (n : nat) : nat :=
match iseven n with
| true => n
| false => match n with
| O => 0
| S r => funex r
end
end.
Function nat_equal_bool (n m : nat) {struct n} : bool :=
match n with
| O => match m with
| O => true
| _ => false
end
| S p => match m with
| O => false
| S q => nat_equal_bool p q
end
end.
Require Export Div2.
Functional Scheme div2_ind := Induction for div2 Sort Prop.
intros n.
functional induction div2 n.
auto.
auto.
apply le_S.
apply le_n_S.
exact IHn0.
Qed.
(* reuse this lemma as a scheme:*)
Function nested_lam (n : nat) : nat -> nat :=
match n with
| O => fun m : nat => 0
| S n' => fun m : nat => m + nested_lam n' m
end.
intros n m.
functional induction nested_lam n m; simpl;auto.
Qed.
Function essai (x : nat) (p : nat * nat) {struct x} : nat :=
let (n, m) := (p: nat*nat) in
match n with
| O => 0
| S q => match x with
| O => 1
| S r => S (essai r (q, m))
end
end.

Lemma essai_essai :
forall (x : nat) (p : nat * nat), let (n, m) := p in 0 < n -> 0 < essai x p.