vvalueftvTyCtx :: HasUnique tyname unique=> UniqueSet unique-> Traversal' (Type tyname uni ann) tynamePeek#
vvalueprogramMapNames :: tyname -> tyname'-> name -> name'-> Program tyname name uni fun ann-> Program tyname' name' uni fun annPeek#
vvaluesubstConstant :: ann -> Some (ValueOf uni) -> Maybe (Term tyname name uni fun ann)-> Term tyname name uni fun ann-> Term tyname name uni fun annPeek#
vvaluesubstConstantA :: Applicative f=> ann -> Some (ValueOf uni) -> f (Maybe (Term tyname name uni fun ann))-> Term tyname name uni fun ann-> f (Term tyname name uni fun ann)Peek#
vvaluesubstTyVar :: tyname -> Maybe (Type tyname uni ann)-> Type tyname uni ann-> Type tyname uni annPeek#
vvaluesubstTyVarA :: Applicative f=> tyname -> f (Maybe (Type tyname uni ann))-> Type tyname uni ann-> f (Type tyname uni ann)Peek#
vvaluesubstVar :: name -> Maybe (Term tyname name uni fun ann)-> Term tyname name uni fun ann-> Term tyname name uni fun annPeek#
vvaluesubstVarA :: Applicative f=> name -> f (Maybe (Term tyname name uni fun ann))-> Term tyname name uni fun ann-> f (Term tyname name uni fun ann)Peek#
vvaluetermMapNames :: tyname -> tyname'-> name -> name'-> Term tyname name uni fun ann-> Term tyname' name' uni fun annPeek#
vvaluetermSubstClosedTerm :: Eq name=> name-> Term tyname name uni fun a-> Term tyname name uni fun a-> Term tyname name uni fun aPeek#
vvaluetermSubstClosedType :: Eq tyname=> tyname-> Type tyname uni a-> Term tyname name uni fun a-> Term tyname name uni fun aPeek#
vvaluetermSubstConstants :: ann -> Some (ValueOf uni) -> Maybe (Term tyname name uni fun ann)-> Term tyname name uni fun ann-> Term tyname name uni fun annPeek#
vvaluetermSubstConstantsM :: Monad m=> ann -> Some (ValueOf uni) -> m (Maybe (Term tyname name uni fun ann))-> Term tyname name uni fun ann-> m (Term tyname name uni fun ann)Peek#
vvaluetermSubstNames :: name -> Maybe (Term tyname name uni fun ann)-> Term tyname name uni fun ann-> Term tyname name uni fun annPeek#
vvaluetermSubstNamesM :: Monad m=> name -> m (Maybe (Term tyname name uni fun ann))-> Term tyname name uni fun ann-> m (Term tyname name uni fun ann)Peek#
vvaluetermSubstTyNames :: tyname -> Maybe (Type tyname uni ann)-> Term tyname name uni fun ann-> Term tyname name uni fun annPeek#
vvaluetermSubstTyNamesM :: Monad m=> tyname -> m (Maybe (Type tyname uni ann))-> Term tyname name uni fun ann-> m (Term tyname name uni fun ann)Peek#
vvaluetvTerm :: (Contravariant f, Applicative f)=> tyname -> f tyname-> Term tyname name uni fun ann-> f (Term tyname name uni fun ann)Peek#
vvaluetvTy :: (Contravariant f, Applicative f)=> tyname -> f tyname-> Type tyname uni ann-> f (Type tyname uni ann)Peek#
vvaluetypeSubstClosedType :: Eq tyname=> tyname-> Type tyname uni a-> Type tyname uni a-> Type tyname uni aPeek#
vvaluetypeSubstTyNames :: tyname -> Maybe (Type tyname uni ann)-> Type tyname uni ann-> Type tyname uni annPeek#
vvaluetypeSubstTyNamesM :: Monad m=> tyname -> m (Maybe (Type tyname uni ann))-> Type tyname uni ann-> m (Type tyname uni ann)Peek#
vvaluevTerm :: (Contravariant f, Applicative f)=> name -> f name-> Term tyname name uni fun ann-> f (Term tyname name uni fun ann)Peek#