sdiehl/write-you-a-haskell
1
1
Fork 0
mirror of https://github.com/sdiehl/write-you-a-haskell.git synced 2024-09-11 11:46:57 +03:00
Code Issues Projects Releases Wiki Activity

note about strictness in terms of bottom terms

Browse Source
This commit is contained in:
Stephen Diehl 2015-01-07 14:02:10 -05:00
parent 4579d109ba
commit aa6143b7cb
1 changed files with 7 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
evaluation.md
View File

@ -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
-----------------