Difference between revisions of "Strict semantics"
Jump to navigation
Jump to search
(Ocaml and LISP) |
m (Reverted edits by Tomjaguarpaw (talk) to last revision by Lemming) |
| (One intermediate revision by one other user not shown) | |
(No difference)
| |
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.