1
(************************************************************************)
2
(* v * The Coq Proof Assistant / The Coq Development Team *)
3
(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
4
(* \VV/ **************************************************************)
5
(* // * This file is distributed under the terms of the *)
6
(* * GNU Lesser General Public License Version 2.1 *)
7
(************************************************************************)
9
Fixpoint F (n:nat) : False := F (match F n with end).
11
(* de Bruijn mix-up *)
12
(* If accepted, Eval compute in f 0. loops *)
14
let f (f1 f2:nat->nat) := f1 in
17
let g (f1 f2:nat->nat) := f2 in
18
let h := f in (* h = Rel 4 *)
19
fix F (n:nat) : nat :=
20
h F S n. (* here Rel 4 = g *)