Difference between revisions of "Strict semantics"
From HaskellWiki
(short explanation) |
(Ocaml and LISP) |
||
| Line 6: | Line 6: | ||
It may be implemented by [[eager evaluation]]. | It may be implemented by [[eager evaluation]]. | ||
| + | |||
| + | [[Strict semantics]] is used e.g. in [[OCaml]] and [[LISP]]. | ||
[[Category:Glossary]] | [[Category:Glossary]] | ||
Revision as of 16:54, 28 December 2008
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.