Strict semantics

From HaskellWiki
Revision as of 15:18, 6 February 2021 by Gwern (talk | contribs) (Reverted edits by Tomjaguarpaw (talk) to last revision by Lemming)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to 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.

Retrieved from "https://wiki.haskell.org/index.php?title=Strict_semantics&oldid=63861"