Mercurial > urweb

annotate src/coq/Syntax.v @ 618:be88d2d169f6

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Most of expression semantics
author Adam Chlipala <adamc@hcoop.net>
date Sat, 21 Feb 2009 13:17:06 -0500
parents 5b358e8f9f09
children f38e009009bb
rev   line source
adamc@615 1 (* Copyright (c) 2009, Adam Chlipala
adamc@615 2 * All rights reserved.
adamc@615 3 *
adamc@615 4 * Redistribution and use in source and binary forms, with or without
adamc@615 5 * modification, are permitted provided that the following conditions are met:
adamc@615 6 *
adamc@615 7 * - Redistributions of source code must retain the above copyright notice,
adamc@615 8 * this list of conditions and the following disclaimer.
adamc@615 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@615 10 * this list of conditions and the following disclaimer in the documentation
adamc@615 11 * and/or other materials provided with the distribution.
adamc@615 12 * - The names of contributors may not be used to endorse or promote products
adamc@615 13 * derived from this software without specific prior written permission.
adamc@615 14 *
adamc@615 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@615 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@615 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@615 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@615 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@615 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@615 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@615 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@615 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@615 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@615 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@615 26 *)
adamc@615 27
adamc@617 28 Require Import String.
adamc@617 29
adamc@615 30 Set Implicit Arguments.
adamc@615 31
adamc@615 32
adamc@617 33 Definition name : Type := string.
adamc@617 34 Definition name_eq_dec : forall (x y : name), {x = y} + {x <> y} := string_dec.
adamc@615 35
adamc@615 36
adamc@615 37 (** Syntax of Featherweight Ur *)
adamc@615 38
adamc@615 39 Inductive kind : Type :=
adamc@615 40 | KType : kind
adamc@615 41 | KName : kind
adamc@615 42 | KArrow : kind -> kind -> kind
adamc@615 43 | KRecord : kind -> kind.
adamc@615 44
adamc@615 45 Section vars.
adamc@615 46 Variable cvar : kind -> Type.
adamc@615 47
adamc@615 48 Inductive con : kind -> Type :=
adamc@615 49 | CVar : forall k, cvar k -> con k
adamc@615 50 | Arrow : con KType -> con KType -> con KType
adamc@615 51 | Poly : forall k, (cvar k -> con KType) -> con KType
adamc@615 52 | CAbs : forall k1 k2, (cvar k1 -> con k2) -> con (KArrow k1 k2)
adamc@615 53 | CApp : forall k1 k2, con (KArrow k1 k2) -> con k1 -> con k2
adamc@615 54 | Name : name -> con KName
adamc@615 55 | TRecord : con (KRecord KType) -> con KType
adamc@615 56 | CEmpty : forall k, con (KRecord k)
adamc@615 57 | CSingle : forall k, con KName -> con k -> con (KRecord k)
adamc@615 58 | CConcat : forall k, con (KRecord k) -> con (KRecord k) -> con (KRecord k)
adamc@617 59 | CMap : forall k1 k2, con (KArrow (KArrow k1 k2) (KArrow (KRecord k1) (KRecord k2)))
adamc@615 60 | CGuarded : forall k1 k2, con (KRecord k1) -> con (KRecord k1) -> con k2 -> con k2.
adamc@615 61
adamc@615 62 Variable dvar : forall k, con (KRecord k) -> con (KRecord k) -> Type.
adamc@615 63
adamc@615 64 Section subs.
adamc@615 65 Variable k1 : kind.
adamc@615 66 Variable c1 : con k1.
adamc@615 67
adamc@615 68 Inductive subs : forall k2, (cvar k1 -> con k2) -> con k2 -> Type :=
adamc@615 69 | S_Unchanged : forall k2 (c2 : con k2),
adamc@615 70 subs (fun _ => c2) c2
adamc@615 71 | S_CVar : subs (fun x => CVar x) c1
adamc@615 72 | S_Arrow : forall c2 c3 c2' c3',
adamc@615 73 subs c2 c2'
adamc@615 74 -> subs c3 c3'
adamc@615 75 -> subs (fun x => Arrow (c2 x) (c3 x)) (Arrow c2' c3')
adamc@615 76 | S_Poly : forall k (c2 : cvar k1 -> cvar k -> _) (c2' : cvar k -> _),
adamc@615 77 (forall x', subs (fun x => c2 x x') (c2' x'))
adamc@615 78 -> subs (fun x => Poly (c2 x)) (Poly c2')
adamc@615 79 | S_CAbs : forall k2 k3 (c2 : cvar k1 -> cvar k2 -> con k3) (c2' : cvar k2 -> _),
adamc@615 80 (forall x', subs (fun x => c2 x x') (c2' x'))
adamc@615 81 -> subs (fun x => CAbs (c2 x)) (CAbs c2')
adamc@615 82 | S_CApp : forall k1 k2 (c2 : _ -> con (KArrow k1 k2)) c3 c2' c3',
adamc@615 83 subs c2 c2'
adamc@615 84 -> subs c3 c3'
adamc@615 85 -> subs (fun x => CApp (c2 x) (c3 x)) (CApp c2' c3')
adamc@615 86 | S_TRecord : forall c2 c2',
adamc@615 87 subs c2 c2'
adamc@615 88 -> subs (fun x => TRecord (c2 x)) (TRecord c2')
adamc@615 89 | S_CSingle : forall k2 c2 (c3 : _ -> con k2) c2' c3',
adamc@615 90 subs c2 c2'
adamc@615 91 -> subs c3 c3'
adamc@615 92 -> subs (fun x => CSingle (c2 x) (c3 x)) (CSingle c2' c3')
adamc@615 93 | S_CConcat : forall k2 (c2 c3 : _ -> con (KRecord k2)) c2' c3',
adamc@615 94 subs c2 c2'
adamc@615 95 -> subs c3 c3'
adamc@615 96 -> subs (fun x => CConcat (c2 x) (c3 x)) (CConcat c2' c3')
adamc@615 97 | S_CGuarded : forall k2 k3 (c2 c3 : _ -> con (KRecord k2)) (c4 : _ -> con k3) c2' c3' c4',
adamc@615 98 subs c2 c2'
adamc@615 99 -> subs c3 c3'
adamc@615 100 -> subs c4 c4'
adamc@615 101 -> subs (fun x => CGuarded (c2 x) (c3 x) (c4 x)) (CGuarded c2' c3' c4').
adamc@615 102 End subs.
adamc@615 103
adamc@615 104 Inductive disj : forall k, con (KRecord k) -> con (KRecord k) -> Prop :=
adamc@615 105 | DVar : forall k (c1 c2 : con (KRecord k)),
adamc@615 106 dvar c1 c2 -> disj c1 c2
adamc@615 107 | DComm : forall k (c1 c2 : con (KRecord k)),
adamc@615 108 disj c1 c2 -> disj c2 c1
adamc@615 109
adamc@615 110 | DEmpty : forall k c2,
adamc@615 111 disj (CEmpty k) c2
adamc@615 112 | DSingleKeys : forall k X1 X2 (c1 c2 : con k),
adamc@615 113 X1 <> X2
adamc@615 114 -> disj (CSingle (Name X1) c1) (CSingle (Name X2) c2)
adamc@615 115 | DSingleValues : forall k n1 n2 (c1 c2 : con k) k' (c1' c2' : con k'),
adamc@615 116 disj (CSingle n1 c1') (CSingle n2 c2')
adamc@615 117 -> disj (CSingle n1 c1) (CSingle n2 c2)
adamc@615 118
adamc@615 119 | DConcat : forall k (c1 c2 c : con (KRecord k)),
adamc@615 120 disj c1 c
adamc@615 121 -> disj c2 c
adamc@615 122 -> disj (CConcat c1 c2) c
adamc@615 123
adamc@615 124 | DEq : forall k (c1 c2 c1' : con (KRecord k)),
adamc@615 125 disj c1 c2
adamc@617 126 -> deq c1' c1
adamc@615 127 -> disj c1' c2
adamc@615 128
adamc@615 129 with deq : forall k, con k -> con k -> Prop :=
adamc@615 130 | Eq_Beta : forall k1 k2 (c1 : cvar k1 -> con k2) c2 c1',
adamc@615 131 subs c2 c1 c1'
adamc@615 132 -> deq (CApp (CAbs c1) c2) c1'
adamc@615 133 | Eq_Refl : forall k (c : con k),
adamc@615 134 deq c c
adamc@615 135 | Eq_Comm : forall k (c1 c2 : con k),
adamc@615 136 deq c2 c1
adamc@615 137 -> deq c1 c2
adamc@615 138 | Eq_Trans : forall k (c1 c2 c3 : con k),
adamc@615 139 deq c1 c2
adamc@615 140 -> deq c2 c3
adamc@615 141 -> deq c1 c3
adamc@615 142 | Eq_Cong : forall k1 k2 c1 c1' (c2 : cvar k1 -> con k2) c2' c2'',
adamc@615 143 deq c1 c1'
adamc@615 144 -> subs c1 c2 c2'
adamc@615 145 -> subs c1' c2 c2''
adamc@615 146 -> deq c2' c2''
adamc@615 147
adamc@615 148 | Eq_Concat_Empty : forall k c,
adamc@615 149 deq (CConcat (CEmpty k) c) c
adamc@617 150 | Eq_Concat_Comm : forall k (c1 c2 c3 : con (KRecord k)),
adamc@617 151 disj c1 c2
adamc@617 152 -> deq (CConcat c1 c2) (CConcat c2 c1)
adamc@615 153 | Eq_Concat_Assoc : forall k (c1 c2 c3 : con (KRecord k)),
adamc@615 154 deq (CConcat c1 (CConcat c2 c3)) (CConcat (CConcat c1 c2) c3)
adamc@615 155
adamc@617 156 | Eq_Map_Empty : forall k1 k2 f,
adamc@617 157 deq (CApp (CApp (CMap k1 k2) f) (CEmpty _)) (CEmpty _)
adamc@617 158 | Eq_Map_Cons : forall k1 k2 f c1 c2 c3,
adamc@616 159 disj (CSingle c1 c2) c3
adamc@617 160 -> deq (CApp (CApp (CMap k1 k2) f) (CConcat (CSingle c1 c2) c3))
adamc@617 161 (CConcat (CSingle c1 (CApp f c2)) (CApp (CApp (CMap k1 k2) f) c3))
adamc@615 162
adamc@615 163 | Eq_Guarded : forall k1 k2 (c1 c2 : con (KRecord k1)) (c : con k2),
adamc@617 164 (*disj c1 c2
adamc@617 165 ->*) deq (CGuarded c1 c2 c) c
adamc@615 166
adamc@615 167 | Eq_Map_Ident : forall k c,
adamc@617 168 deq (CApp (CApp (CMap k k) (CAbs (fun x => CVar x))) c) c
adamc@615 169 | Eq_Map_Dist : forall k1 k2 f c1 c2,
adamc@617 170 deq (CApp (CApp (CMap k1 k2) f) (CConcat c1 c2))
adamc@617 171 (CConcat (CApp (CApp (CMap k1 k2) f) c1) (CApp (CApp (CMap k1 k2) f) c2))
adamc@617 172 | Eq_Map_Fuse : forall k1 k2 k3 f f' c,
adamc@617 173 deq (CApp (CApp (CMap k2 k3) f')
adamc@617 174 (CApp (CApp (CMap k1 k2) f) c))
adamc@617 175 (CApp (CApp (CMap k1 k3) (CAbs (fun x => CApp f' (CApp f (CVar x))))) c).
adamc@618 176
adamc@618 177 Variable evar : con KType -> Type.
adamc@618 178
adamc@618 179 Inductive exp : con KType -> Type :=
adamc@618 180 | Var : forall t, evar t -> exp t
adamc@618 181 | App : forall dom ran, exp (Arrow dom ran) -> exp dom -> exp ran
adamc@618 182 | Abs : forall dom ran, (evar dom -> exp ran) -> exp (Arrow dom ran)
adamc@618 183 | ECApp : forall k (dom : con k) ran ran', exp (Poly ran) -> subs dom ran ran' -> exp ran'
adamc@618 184 | ECAbs : forall k (ran : cvar k -> _), (forall X, exp (ran X)) -> exp (Poly ran)
adamc@618 185 | Cast : forall t1 t2, deq t1 t2 -> exp t1 -> exp t2
adamc@618 186 | Empty : exp (TRecord (CEmpty _))
adamc@618 187 | Single : forall c t, exp t -> exp (TRecord (CConcat (CSingle c t) (CEmpty _)))
adamc@618 188 | Proj : forall c t c', exp (TRecord (CConcat (CSingle c t) c')) -> exp t
adamc@618 189 | Cut : forall c t c', disj (CSingle c t) c' -> exp (TRecord (CConcat (CSingle c t) c')) -> exp (TRecord c')
adamc@618 190 | Concat : forall c1 c2, disj c1 c2 -> exp (TRecord c1) -> exp (TRecord c2) -> exp (TRecord (CConcat c1 c2))
adamc@618 191 | Guarded : forall k (c1 c2 : con (KRecord k)) c, (dvar c1 c2 -> exp c) -> exp (CGuarded c1 c2 c).
adamc@615 192 End vars.