Personal tools

Strict semantics

From HaskellWiki

Revision as of 16:54, 28 December 2008 by Lemming (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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.