adamc@1180: con mem :: K --> Name -> K -> {K} -> Type
adamc@1180: 
adamc@1180: val mem : K --> nm :: Name -> t :: K -> r :: {K} -> [[nm] ~ r] => mem nm t ([nm = t] ++ r)
adamc@1180: val mp : K --> K2 --> f :: (K -> K2) -> nm ::: Name -> t ::: K -> r ::: {K} -> mem nm t r -> mem nm (f t) (map f r)
adamc@1180: 
adamc@1180: val proj : nm ::: Name -> t ::: Type -> r ::: {Type} -> mem nm t r -> $r -> t
adamc@1180: val replace : nm ::: Name -> t ::: Type -> r ::: {Type} -> mem nm t r -> $r -> t -> $r
adamc@1180: 
adamc@1180: val fold : K --> tf :: ({K} -> Type) -> r ::: {K}
adamc@1180:            -> (nm :: Name -> v :: K -> r' :: {K} -> [[nm] ~ r']
adamc@1180:                => mem nm v r -> tf r' -> tf ([nm = v] ++ r'))
adamc@1180:            -> tf []
adamc@1180:            -> folder r -> tf r