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

Mention equations

Browse Source
This commit is contained in:
Daniel Hillerström
2021-05-20 11:22:22 +01:00
parent 9e7c74ef0f
commit 1ede601435
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
thesis.tex
View File

@@ -843,7 +843,7 @@ programming~\cite{Claessen99,LiZ07,SymePL11}.
% %
The state monad is an instantiation of the monad interface that The state monad is an instantiation of the monad interface that
encapsulates mutable state by using the state-passing technique encapsulates mutable state by using the state-passing technique
internally. In addition it equip the monad with two operations for internally. In addition it equips the monad with two operations for
manipulating the state cell. manipulating the state cell.
% %
\begin{definition}\label{def:state-monad} \begin{definition}\label{def:state-monad}
@@ -1265,7 +1265,8 @@ the current state $st$. The recursive activation of $\runState$ will
force the thunk in order to compute the next computation tree node. force the thunk in order to compute the next computation tree node.
In the case of a $\Put$ operation the interpreter calls itself In the case of a $\Put$ operation the interpreter calls itself
recursively with new state value $st'$ and the continuation $k$ (which recursively with new state value $st'$ and the continuation $k$ (which
is a thunk). is a thunk). One may prove that this interpretation of get and put
satisfies the equations of Definition~\ref{def:state-monad}.
% %
By instantiating $S = \Int$ we can use this interpreter to run By instantiating $S = \Int$ we can use this interpreter to run