A function f is strict in an argument if
f bottom = bottom
(See bottom). In other words, the result depends on the argument so evaluation of an application of the function cannot terminate until evaluation of the argument has terminated.
If the result is only bottom when the argument is bottom then the function is also bottom-unique.
See also strict evaluation, hyperstrict.