Strict semantics: Difference between revisions
m (Reverted edits by Tomjaguarpaw (talk) to last revision by Lemming) |
mNo edit summary |
||
| Line 1: | Line 1: | ||
The opposite of [[non-strict semantics]]; it means that an undefined argument of a function leads to an undefined function value: | |||
<pre> | |||
< | ∀ f . f undefined = undefined | ||
</pre> | |||
</ | |||
It may be implemented by [[eager evaluation]]. | It may be implemented by [[eager evaluation]]. Examples of programming languages which use strict semantics include [[OCaml]] and LISP. | ||
[[Category:Glossary]] | [[Category:Glossary]] | ||
Revision as of 05:04, 1 January 2025
The opposite of non-strict semantics; it means that an undefined argument of a function leads to an undefined function value:
∀ f . f undefined = undefined
It may be implemented by eager evaluation. Examples of programming languages which use strict semantics include OCaml and LISP.