Agda-2.5.2: A dependently typed functional programming language and proof assistant

Safe HaskellNone
LanguageHaskell2010

Agda.TypeChecking.Serialise.Instances.Internal

Contents

Documentation

Orphan instances

EmbPrj Permutation # 
EmbPrj Occurrence # 
EmbPrj ConPatternInfo # 
EmbPrj DBPatVar # 
EmbPrj Clause # 

Methods

icode :: Clause -> S Int32 #

icod_ :: Clause -> S Int32 #

value :: Int32 -> R Clause #

EmbPrj LevelAtom # 
EmbPrj PlusLevel # 
EmbPrj Level # 

Methods

icode :: Level -> S Int32 #

icod_ :: Level -> S Int32 #

value :: Int32 -> R Level #

EmbPrj Sort # 

Methods

icode :: Sort -> S Int32 #

icod_ :: Sort -> S Int32 #

value :: Int32 -> R Sort #

EmbPrj Term # 

Methods

icode :: Term -> S Int32 #

icod_ :: Term -> S Int32 #

value :: Int32 -> R Term #

EmbPrj ConHead # 
EmbPrj CompiledClauses # 
EmbPrj CtxId # 

Methods

icode :: CtxId -> S Int32 #

icod_ :: CtxId -> S Int32 #

value :: Int32 -> R CtxId #

EmbPrj MutualId # 
EmbPrj TermHead # 
EmbPrj Defn # 

Methods

icode :: Defn -> S Int32 #

icod_ :: Defn -> S Int32 #

value :: Int32 -> R Defn #

EmbPrj FunctionFlag # 
EmbPrj EtaEquality # 
EmbPrj ProjLams # 
EmbPrj Projection # 
EmbPrj ExtLamInfo # 
EmbPrj Polarity # 
EmbPrj Definition # 
EmbPrj RewriteRule # 
EmbPrj NLPType # 
EmbPrj NLPat # 

Methods

icode :: NLPat -> S Int32 #

icod_ :: NLPat -> S Int32 #

value :: Int32 -> R NLPat #

EmbPrj DisplayTerm # 
EmbPrj DisplayForm # 
EmbPrj Section # 
EmbPrj Signature # 
EmbPrj a => EmbPrj (Drop a) # 

Methods

icode :: Drop a -> S Int32 #

icod_ :: Drop a -> S Int32 #

value :: Int32 -> R (Drop a) #

EmbPrj a => EmbPrj (Pattern' a) # 

Methods

icode :: Pattern' a -> S Int32 #

icod_ :: Pattern' a -> S Int32 #

value :: Int32 -> R (Pattern' a) #

EmbPrj a => EmbPrj (Tele a) # 

Methods

icode :: Tele a -> S Int32 #

icod_ :: Tele a -> S Int32 #

value :: Int32 -> R (Tele a) #

EmbPrj a => EmbPrj (Type' a) # 

Methods

icode :: Type' a -> S Int32 #

icod_ :: Type' a -> S Int32 #

value :: Int32 -> R (Type' a) #

EmbPrj a => EmbPrj (Abs a) # 

Methods

icode :: Abs a -> S Int32 #

icod_ :: Abs a -> S Int32 #

value :: Int32 -> R (Abs a) #

EmbPrj a => EmbPrj (Elim' a) # 

Methods

icode :: Elim' a -> S Int32 #

icod_ :: Elim' a -> S Int32 #

value :: Int32 -> R (Elim' a) #

EmbPrj a => EmbPrj (Case a) # 

Methods

icode :: Case a -> S Int32 #

icod_ :: Case a -> S Int32 #

value :: Int32 -> R (Case a) #

EmbPrj a => EmbPrj (WithArity a) # 

Methods

icode :: WithArity a -> S Int32 #

icod_ :: WithArity a -> S Int32 #

value :: Int32 -> R (WithArity a) #

EmbPrj a => EmbPrj (Builtin a) # 

Methods

icode :: Builtin a -> S Int32 #

icod_ :: Builtin a -> S Int32 #

value :: Int32 -> R (Builtin a) #

EmbPrj a => EmbPrj (FunctionInverse' a) # 
EmbPrj a => EmbPrj (Local a) # 

Methods

icode :: Local a -> S Int32 #

icod_ :: Local a -> S Int32 #

value :: Int32 -> R (Local a) #

EmbPrj a => EmbPrj (Open a) # 

Methods

icode :: Open a -> S Int32 #

icod_ :: Open a -> S Int32 #

value :: Int32 -> R (Open a) #