A function which is hyperstrict in some argumeNT will fully evaluate that argumeNT. To fully evaluate an object, evaluate it to WHNF and if it is a constructed data object (e.g. a list or tuple) then fully evaluate every componeNT and so on recursively. Thus a hyperstrict function will fail to terminate if its argumeNT or any componeNT or sub-componeNT of its argumeNT fails to terminate (i.e. if its argumeNT is not "total").

In addition suitable coNTeNTs:
[ ai ] [ al ] [ an ] [ ar ] [ arg ] [ argumeNT ] [ at ] [ b ] [ bj ] [ ch ] [ co ] [ com ] [ componeNT ] [ con ] [ cons ] [ cu ] [ data ] [ ec ] [ ed ] [ er ] [ function ] [ gu ] [ h ] [ hat ] [ hu ] [ il ] [ in ] [ io ] [ is ] [ it ] [ li ] [ list ] [ ls ] [ lu ] [ ly ] [ mp ] [ N ] [ na ] [ nc ] [ ne ] [ no ] [ ns ] [ object ] [ om ] [ pe ] [ pl ] [ re ] [ recursive ] [ ru ] [ si ] [ so ] [ st ] [ strict ] [ struct ] [ su ] [ T ] [ th ] [ to ] [ tr ] [ tuple ] [ ua ] [ um ] [ up ] [ us ] [ va ] [ ve ] [ WHNF ]