mirror of
https://github.com/sdiehl/write-you-a-haskell.git
synced 2024-09-11 11:46:57 +03:00
note about strictness in terms of bottom terms
This commit is contained in:
parent
4579d109ba
commit
aa6143b7cb
@ -28,6 +28,13 @@ lambda expression are necessarily evaluated before a lambda is reduced. A
|
||||
language in which the arguments are not necessarily evaluated before a lambda is
|
||||
reduced is non-strict.
|
||||
|
||||
Alternatively expressed, diverging terms are represented by the *bottom* value,
|
||||
written as $\bot$. A function $f$ is non-strict if:
|
||||
|
||||
$$
|
||||
f \bot \neq \bot
|
||||
$$
|
||||
|
||||
Evaluation Models
|
||||
-----------------
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user