data PiInfo : Type -> TypeImplicit : PiInfo t Implicit Pi types (e.g. {0 a : Type} -> ...)
The argument is to be solved by unificationExplicit : PiInfo tExplicit Pi types (e.g. (x : a) -> ...)
The argument is to be passed explicitly
AutoImplicit : PiInfo tAuto Pi types (e.g. (fun : Functor f) => ...)
The argument is to be solved by proof search
DefImplicit : t -> PiInfo t Default Pi types (e.g. {default True flag : Bool} -> ...)
The argument is set to the default value if nothing is
passed explicitlyisImplicit : PiInfo t -> BooleqPiInfoBy : (t -> u -> Bool) -> PiInfo t -> PiInfo u -> BoolHeterogeneous equality, provided an heterogeneous equality
of default values
forgetDef : PiInfo t -> PiInfo t'record PiBindData : Type -> TypeA bound value along with its `PiInfo`.
We cannot use `PiInfo` as metadata for `WithData` because the record is functorial in both
`t` and `PiInfo`.
MkPiBindData : PiInfo t -> t -> PiBindData t.boundType : PiBindData t -> t.info : PiBindData t -> PiInfo tFoldable PiBindDataFunctor PiBindDataShow t => Show (PiBindData t)TTC t => TTC (PiBindData t)Traversable PiBindData.info : PiBindData t -> PiInfo tinfo : PiBindData t -> PiInfo t.boundType : PiBindData t -> tboundType : PiBindData t -> tmapType : (t -> t) -> PiBindData t -> PiBindData tdata Binder : Type -> TypeLam : FC -> RigCount -> PiInfo type -> type -> Binder typeLet : FC -> RigCount -> type -> type -> Binder typePi : FC -> RigCount -> PiInfo type -> type -> Binder typePVar : FC -> RigCount -> PiInfo type -> type -> Binder typePLet : FC -> RigCount -> type -> type -> Binder typePVTy : FC -> RigCount -> type -> Binder typeisLet : Binder t -> BoolbinderLoc : Binder tm -> FCbinderType : Binder tm -> tmmultiplicity : Binder tm -> RigCountpiInfo : Binder tm -> PiInfo tmisImplicit : Binder tm -> BoolsetMultiplicity : Binder tm -> RigCount -> Binder tmsetType : Binder tm -> tm -> Binder tmeqBinderBy : (t -> u -> Bool) -> Binder t -> Binder u -> Bool