Strict semantics

From HaskellWiki
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Is the opposite of ... yeah guess what? ... the opposite of non-strict semantics. It means, that an undefined argument of a function leads to an undefined function value.

forall f.  f undefined = undefined

It may be implemented by eager evaluation.

Strict semantics is used e.g. in OCaml and LISP.