(* *)
(**************************************************************************)
-include "ground_2/notation/constructors/nil_1.ma".
-include "ground_2/notation/constructors/nil_2.ma".
+include "ground_2/notation/constructors/nil_0.ma".
+include "ground_2/notation/constructors/cons_2.ma".
include "ground_2/notation/constructors/cons_3.ma".
-include "ground_2/notation/constructors/cons_5.ma".
include "ground_2/notation/functions/append_2.ma".
include "ground_2/lib/arith.ma".
| nil : list A
| cons: A → list A → list A.
-interpretation "nil (list)" 'Nil A = (nil A).
+interpretation "nil (list)" 'Nil = (nil ?).
-interpretation "cons (list)" 'Cons A hd tl = (cons A hd tl).
+interpretation "cons (list)" 'Cons hd tl = (cons ? hd tl).
let rec all A (R:predicate A) (l:list A) on l ≝
match l with
| nil2 : list2 A1 A2
| cons2: A1 → A2 → list2 A1 A2 → list2 A1 A2.
-interpretation "nil (list of pairs)" 'Nil A1 A2 = (nil2 A1 A2).
+interpretation "nil (list of pairs)" 'Nil = (nil2 ? ?).
-interpretation "cons (list of pairs)" 'Cons A1 A2 hd1 hd2 tl = (cons2 A1 A2 hd1 hd2 tl).
+interpretation "cons (list of pairs)" 'Cons hd1 hd2 tl = (cons2 ? ? hd1 hd2 tl).
let rec append2 (A1,A2:Type[0]) (l1,l2:list2 A1 A2) on l1 ≝ match l1 with
[ nil2 ⇒ l2