]> matita.cs.unibo.it Git - helm.git/blob - matita/matita/contribs/lambda-delta/Basic-2/grammar/item.ma
- the shift function is now defined and cpr_shift_fwd is proved
[helm.git] / matita / matita / contribs / lambda-delta / Basic-2 / grammar / item.ma
1 (**************************************************************************)
2 (*       ___                                                              *)
3 (*      ||M||                                                             *)
4 (*      ||A||       A project by Andrea Asperti                           *)
5 (*      ||T||                                                             *)
6 (*      ||I||       Developers:                                           *)
7 (*      ||T||         The HELM team.                                      *)
8 (*      ||A||         http://helm.cs.unibo.it                             *)
9 (*      \   /                                                             *)
10 (*       \ /        This file is distributed under the terms of the       *)
11 (*        v         GNU General Public License Version 2                  *)
12 (*                                                                        *)
13 (**************************************************************************)
14
15 (* THE FORMAL SYSTEM λδ - MATITA SOURCE SCRIPTS 
16  * Specification started: 2011 April 17
17  * - Patience on me so that I gain peace and perfection! -
18  * [ suggested invocation to start formal specifications with ]
19  *)
20
21 include "Ground-2/list.ma".
22 include "Basic-2/notation.ma".
23
24 (* BINARY ITEMS *************************************************************)
25
26 (* binary binding items *)
27 inductive bind2: Type[0] ≝
28 | Abbr: bind2 (* abbreviation *)
29 | Abst: bind2 (* abstraction *)
30 .
31
32 (* binary non-binding items *)
33 inductive flat2: Type[0] ≝
34 | Appl: flat2 (* application *)
35 | Cast: flat2 (* explicit type annotation *)
36 .
37
38 (* binary items *)
39 inductive item2: Type[0] ≝
40 | Bind: bind2 → item2 (* binding item *)
41 | Flat: flat2 → item2 (* non-binding item *)
42 .
43
44 coercion item2_of_bind2: ∀I:bind2.item2 ≝ Bind on _I:bind2 to item2.
45
46 coercion item2_of_flat2: ∀I:flat2.item2 ≝ Flat on _I:flat2 to item2.
47
48 (* Basic-1: removed theorems 19:
49             s_S s_plus s_plus_sym s_minus minus_s_s s_le s_lt s_inj s_inc
50             s_arith0 s_arith1
51             r_S r_plus r_plus_sym r_minus r_dis s_r r_arith0 r_arith1
52 *)