ModuleAgda-2.7.0.1Haskell2010

Agda.TypeChecking.Primitive.Cubical

4 types
36 values

PackageAgda-2.7.0.1
Exports40
LanguageHaskell2010
LicenceMIT
SourceCubical.hs

valueprimPOr :: TCM PrimitiveImpl

valueprimComp :: TCM PrimitiveImpl

CCHM primComp is implemented in terms of hcomp and transport. The definition of it comes from mkComp.

valueprimTransHComp

:: Command
-> [Arg Term]
-> Int
-> ReduceM (Reduced MaybeReducedArgs Term)

valueprimPartial' :: TCM PrimitiveImpl

valueprimPartialP' :: TCM PrimitiveImpl

valueprimSubOut' :: TCM PrimitiveImpl

valueprimTrans' :: TCM PrimitiveImpl

valueprimHComp' :: TCM PrimitiveImpl

valuemkComp

:: HasBuiltins m
=> String
-> NamesT m (NamesT m Term -> NamesT m Term -> NamesT m Term -> NamesT m Term -> NamesT m Term -> NamesT m Term)

Construct a helper for CCHM composition, with a string indicating what function uses it.

valuemkCompLazy

:: HasBuiltins m
=> String
-> NamesT m (NamesT m Term -> NamesT m Term -> NamesT m Term -> NamesT m Term -> NamesT m Term -> NamesT m Term)

Construct an application of buitlinComp. Use instead of mkComp if reducing directly to hcomp + transport would be problematic.

valuedoPiKanOp

:: KanOperation
Are we composing or transporting?
-> ArgName
Name of the binder
-> FamilyOrNot (Dom Type, Abs Type)
The domain and codomain of the Pi type.
-> ReduceM (Maybe Term)

Implementation of Kan operations for Pi types. The implementation of transp and hcomp for Pi types has many commonalities, so most of it is shared between the two cases.

valuedoPathPKanOp

:: KanOperation
-> FamilyOrNot (Arg Term)
-> FamilyOrNot (Arg Term, Arg Term, Arg Term)
-> ReduceM (Reduced MaybeReducedArgs Term)

Compute Kan operations in a type of dependent paths.

valueredReturnNoSimpl :: a -> ReduceM (Reduced a' a)

valuehcomp

:: (HasBuiltins m, MonadError TCErr m, MonadReduce m, MonadPretty m)
=> NamesT m Type
-> [(NamesT m Term, NamesT m Term)]
-> NamesT m Term
-> NamesT m Term

valueprimFaceForall' :: TCM PrimitiveImpl

valuetranspTel

:: Abs Telescope
-> Term
-> Args
-> ExceptT (Closure (Abs Type)) TCM Args

Tries to primTransp a whole telescope of arguments, following the rule for Σ types. If a type in the telescope does not support transp, transpTel throws it as an exception.

valuetranspTel'

:: (PureTCM m, MonadError TCErr m)
=> Bool
-> Abs Telescope
-> Term
-> Args
-> ExceptT (Closure (Abs Type)) m Args

valuetranspSysTel'

:: (PureTCM m, MonadError TCErr m)
=> Bool
-> Abs Telescope
-> [(Term, Abs [Term])]
-> Term
-> Args
-> ExceptT (Closure (Abs Type)) m Args

typetype LM (m :: Type -> Type) a = NamesT (ExceptT (Closure (Abs Type)) m) a

valuetrFillTel'

:: (PureTCM m, MonadError TCErr m)
=> Bool
-> Abs Telescope
-> Term
-> Args
-> Term
-> ExceptT (Closure (Abs Type)) m Args

valuetrFillTel

:: Abs Telescope
-> Term
-> Args
-> Term
-> ExceptT (Closure (Abs Type)) TCM Args

Like transpTel but performing a transpFill.

valuepathTelescope

:: (PureTCM m, MonadError TCErr m)
=> Telescope
-> [Arg Term]
-> [Arg Term]
-> m Telescope

valuepathTelescope'

:: (PureTCM m, MonadError (Closure Type) m)
=> Telescope
-> [Arg Term]
-> [Arg Term]
-> m Telescope

datadata TranspError

Constructors

CannotTransp
- errorType :: Closure (Abs Type)

Instances2Show, Exception

Show TranspErrorDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical
Exception TranspErrorDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical

valuetryTranspError :: TCM a -> TCM (Either (Closure (Abs Type)) a)

valuetranspPathPTel'

:: NamesT TCM (Abs (Abs Telescope))
j.i.Δ const on φ
-> [NamesT TCM Term]
x : (i : I) → Δ[0,i] const on φ
-> [NamesT TCM Term]
y : (i : I) → Δ[1,i] const on φ
-> NamesT TCM Term
φ
-> [NamesT TCM Term]
p : PathP (λ j → Δ[j,0]) (x 0) (y 0)
-> NamesT TCM [Arg Term]

valuetranspPathTel'

:: NamesT TCM (Abs Telescope)
i.Δ const on φ
-> [NamesT TCM Term]
x : (i : I) → Δ[i] const on φ
-> [NamesT TCM Term]
y : (i : I) → Δ[i] const on φ
-> NamesT TCM Term
φ
-> [NamesT TCM Term]
p : Path (Δ[0]) (x 0) (y 0)
-> NamesT TCM [Arg Term]

valuetrFillPathTel'

:: NamesT TCM (Abs Telescope)
i.Δ const on φ
-> [NamesT TCM Term]
x : (i : I) → Δ[i] const on φ
-> [NamesT TCM Term]
y : (i : I) → Δ[i] const on φ
-> NamesT TCM Term
φ
-> [NamesT TCM Term]
p : Path (Δ[0]) (x 0) (y 0)
-> NamesT TCM Term
r
-> NamesT TCM [Arg Term]

valuetrFillPathPTel'

:: NamesT TCM (Abs (Abs Telescope))
j.i.Δ const on φ
-> [NamesT TCM Term]
x : (i : I) → Δ[0,i] const on φ
-> [NamesT TCM Term]
y : (i : I) → Δ[1,i] const on φ
-> NamesT TCM Term
φ
-> [NamesT TCM Term]
p : Path ( j -> Δ[j,0]) (x 0) (y 0)
-> NamesT TCM Term
r
-> NamesT TCM [Arg Term]

valueexpTelescope :: Type -> Telescope -> Telescope

valueexpS :: Nat -> Substitution

Γ, Δ^I, i : I |- expS |Δ| : Γ, Δ

datadata LType

A Type with sort Type l Such a type supports both hcomp and transp.

Constructors

LEl Level Term

Instances4Eq, Show, Subst, SubstArg

Eq LTypeDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical
Show LTypeDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical
Subst LTypeDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical
type SubstArg LType = TermDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical

datadata CType

A Type that either has sort Type l or is a closed definition. Such a type supports some version of transp. In particular we want to allow the Interval as a ClosedType.

Constructors

ClosedType Sort QName
LType LType

Instances5Eq, Show, Pretty, Subst, SubstArg

Eq CTypeDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical
Show CTypeDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical
Pretty CTypeDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical
Subst CTypeDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical
type SubstArg CType = TermDefined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical

valuefromLType :: LType -> Type

valuelTypeLevel :: LType -> Level

valuetoLType :: MonadReduce m => Type -> m (Maybe LType)

valuefromCType :: CType -> Type

valuetoCType :: MonadReduce m => Type -> m (Maybe CType)

valuetranspSys

:: (HasBuiltins m, MonadError TCErr m, MonadReduce m)
=> NamesT m (Abs Type)
-> [(NamesT m Term, NamesT m Term)]
-> NamesT m Term
-> NamesT m Term
-> NamesT m Term

valuedebugClause :: String -> Clause -> TCM ()

module Agda.TypeChecking.Primitive.Cubical.Id

module Agda.TypeChecking.Primitive.Cubical.Base

module Agda.TypeChecking.Primitive.Cubical.Glue

module Agda.TypeChecking.Primitive.Cubical.HCompU