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

Agda.Syntax.Strict

Synopsis

class Strict a whereSource

force is the recursive const 0 function, to force Haskell to evaluate.

force

const 0

Methods

force :: a -> IntSource

Instances

($!!) :: Strict a => (a -> b) -> a -> bSource

strict :: Strict a => a -> aSource