Difference between revisions of "Strict semantics"
Jump to navigation
Jump to search
Tomjaguarpaw (talk | contribs) (Deleting page that hasn't been edited for over 10 years) |
m (Reverted edits by Tomjaguarpaw (talk) to last revision by Lemming) |
||
Line 1: | Line 1: | ||
+ | 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. |
||
+ | <haskell> |
||
+ | forall f. f undefined = undefined |
||
+ | </haskell> |
||
+ | |||
+ | It may be implemented by [[eager evaluation]]. |
||
+ | |||
+ | [[Strict semantics]] is used e.g. in [[OCaml]] and [[LISP]]. |
||
+ | |||
+ | [[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.