Agda.Syntax.Strict
Documentation
force is the recursive const 0 function, to force Haskell to evaluate.
Instances
| Strict Pragma | |
| Strict Declaration | |
| Strict Expr | |
| Strict Token | |
| Strict ClauseBody | |
| Strict LevelAtom | |
| Strict PlusLevel | |
| Strict Level | |
| Strict Sort | |
| Strict Type | |
| Strict Term | |
| Strict NiceDeclaration | |
| Strict a => Strict [a] | |
| Strict a => Strict (Maybe a) | |
| Strict a => Strict (Arg a) | |
| Strict a => Strict (Abs a) | |
| (Strict a, Strict b) => Strict (a, b) |