Difference between revisions of "Strict semantics"
Jump to navigation
Jump to search
(Ocaml and LISP) |
Tomjaguarpaw (talk | contribs) (Deleting page that hasn't been edited for over 10 years) |
||
| 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]] |
||