adamc@1180: con mem' = K ==> fn (nm :: Name) (t :: K) (r :: {K}) (r' :: {K}) => adamc@1180: [[nm] ~ r'] => {Expose : f :: ({K} -> Type) -> f r -> f ([nm = t] ++ r'), adamc@1180: Hide : f :: ({K} -> Type) -> f ([nm = t] ++ r') -> f r} adamc@1180: adamc@1180: con mem = K ==> fn (nm :: Name) (t :: K) (r :: {K}) => adamc@1180: tp :: Type -> (r' :: {K} -> [[nm] ~ r'] => mem' nm t r r' -> tp) -> tp adamc@1180: adamc@1180: fun mem [K] [nm :: Name] [t :: K] [r :: {K}] [[nm] ~ r] = adamc@1180: fn [tp :: Type] (f : r' :: {K} -> [[nm] ~ r'] => mem' nm t ([nm = t] ++ r) r' -> tp) => adamc@1180: f [r] ! (fn [[nm] ~ r] => {Expose = fn [f :: {K} -> Type] x => x, adamc@1180: Hide = fn [f :: {K} -> Type] x => x}) adamc@1180: adamc@1180: fun mp [K] [K2] [f :: K -> K2] [nm ::: Name] [t ::: K] [r ::: {K}] (m : mem nm t r) = adamc@1180: m [mem nm (f t) (map f r)] (fn [r' :: {K}] [[nm] ~ r'] (m' : mem' nm t r r') => adamc@1180: fn [tp :: Type] (f : r' :: {K2} -> [[nm] ~ r'] => adamc@1180: mem' nm (f t) (map f r) r' -> tp) => adamc@1180: f [map f r'] ! (fn [[nm] ~ map f r'] => adamc@1180: {Expose = fn [f' :: {K2} -> Type] x => adamc@1180: m'.Expose [fn r => f' (map f r)] x, adamc@1180: Hide = fn [f' :: {K2} -> Type] x => adamc@1180: m'.Hide [fn r => f' (map f r)] x})) adamc@1180: adamc@1180: fun proj [nm ::: Name] [t ::: Type] [r ::: {Type}] (m : mem nm t r) (r : $r) = adamc@1180: m [t] (fn [r' :: {Type}] [[nm] ~ r'] (m' : mem' nm t r r') => adamc@1180: (m'.Expose [fn r => $r] r).nm) adamc@1180: adamc@1180: fun replace [nm ::: Name] [t ::: Type] [r ::: {Type}] (m : mem nm t r) (r : $r) (v : t) = adamc@1180: m [$r] (fn [r' :: {Type}] [[nm] ~ r'] (m' : mem' nm t r r') => adamc@1180: m'.Hide [fn r => $r] (m'.Expose [fn r => $r] r -- nm ++ {nm = v})) adamc@1180: adamc@1180: fun fold [K] [tf :: ({K} -> Type)] [r ::: {K}] adamc@1180: (f : nm :: Name -> v :: K -> r' :: {K} -> [[nm] ~ r'] adamc@1180: => mem nm v r -> tf r' -> tf ([nm = v] ++ r')) adamc@1180: (i : tf []) (fl : folder r) = adamc@1180: @@Incl.fold [tf] [r] adamc@1180: (fn [nm :: Name] [v :: K] [r' :: {K}] [[nm] ~ r'] (i : Incl.incl ([nm = v] ++ r') r) acc => adamc@1182: f [nm] [v] [r'] ! (Incl.inv1 [nm] [v] [r'] [r] [mem] i mem) acc) adamc@1180: i fl