dhil/phd-dissertation
1
0
Fork 0
mirror of https://github.com/dhil/phd-dissertation synced 2026-03-13 11:08:25 +00:00
Code Issues Releases Wiki Activity

fix typo

Browse Source
This commit is contained in:
Daniel Hillerström
2021-05-17 23:20:32 +01:00
parent 1129d2bb71
commit bce45f10e3
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
thesis.tex
View File

@@ -710,9 +710,9 @@ values. Figure~\ref{fig:comptree} depicts the computation tree for the
$\incrEven$ function. This particular computation tree has infinite $\incrEven$ function. This particular computation tree has infinite
width, because the operation $\getF$ has infinitely many possible width, because the operation $\getF$ has infinitely many possible
continuations (we take the denotation of $\Int$ to be continuations (we take the denotation of $\Int$ to be
$\mathbb{Z}$). Contrary, each $\putF$ node has only one outgoing edge, $\mathbb{Z}$). Conversely, each $\putF$ node has only one outgoing
because $\putF$ has only a single possible continuation, namely, the edge, because $\putF$ has only a single possible continuation, namely,
trivial continuation $\Unit$. the trivial continuation $\Unit$.
The meaning of a free monadic computation is ascribed by a separate The meaning of a free monadic computation is ascribed by a separate
function, or interpreter, that traverses the computation tree. function, or interpreter, that traverses the computation tree.