A function is strict in an argument if replacing that argument by the bottom value makes the result bottom. This semantic property does not prescribe evaluation order: a function that always diverges is strict without inspecting its argument. Strictness of a structured argument also does not mean evaluation of every component.[ref]

Ancestors (4)

  1. Functional programming
  2. Programming language
  3. Computer science
  4. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

In programming, particularly in the context of functional programming and certain languages like Haskell and JavaScript, the term "strict function" has a specific meaning. A strict function is a function that evaluates its arguments before executing its body. In other words, a strict function demands that its arguments must be fully determined before the function is applied.