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

Agda.Compiler.MAlonzo.Compiler

Synopsis

Documentation

definition :: Maybe CoinductionKit -> Definition -> TCM [HsDecl]Source

Note that the INFINITY, SHARP and FLAT builtins are translated as follows (if a CoinductionKit is given):

   type Infinity a b = b

sharp :: forall a. () -> forall b. () -> b -> b
   sharp _ _ x = x

flat :: forall a. () -> forall b. () -> b -> b
   flat _ _ x = x

constructorArity :: MonadTCM tcm => QName -> tcm NatSource

Move somewhere else!

tvaldeclSource

Arguments

:: QName 
-> Induction

Is the type inductive or coinductive?

-> Nat 
-> Nat 
-> [HsConDecl] 
-> Maybe Clause 
-> [HsDecl]