Strict semantics

The opposite of non-strict semantics; it means that an undefined argument of a function leads to an undefined function value:

∀ f . f undefined = undefined

It may be implemented by eager evaluation. Examples of programming languages which use strict semantics include OCaml and LISP.