[Agda] Strict application

[Andrés Sicard-Ramírez]

Hi,

In Haskell, a strict application can be defined by

($!) ∷ (a → b) → a → b
f $! x = x `seq` f x

Is it possible to define a strict application in Agda?

Thanks,

-- 
Andrés
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.chalmers.se/pipermail/agda/attachments/20140426/856fd065/attachment.html