Difference between revisions of "Strict semantics"
Jump to navigation
Jump to search
(short explanation) |
m (Reverted edits by Tomjaguarpaw (talk) to last revision by Lemming) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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]] |
||
Latest revision as of 15:18, 6 February 2021
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.