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

WIP

Browse Source
This commit is contained in:
Daniel Hillerström
2021-05-20 01:04:44 +01:00
parent e46cd37b01
commit d00227a57b
1 changed files with 50 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

74
thesis.tex
View File

@@ -426,28 +426,53 @@ language.
\section{State of effectful programming} \section{State of effectful programming}
The evolution of effectful programming has gone through several Programming with effects can be done in basically three different
characteristic time periods. In this section I will provide a brief ways: 1) usage of builtin effects, 2) simulation via global program
programming perspective on how effectful programming has evolved as transformations, or 3) simulation via control effects.
well as providing an informal introduction to the core concepts %
concerned with each time period. We will look at the evolution of In this section I will provide a brief programming perspective on the
effectful programming through the lens of a singular effect, namely, various approaches to programming with effects. We will look at each
global mutable state. approach through the lens of a singular effect, namely, global mutable
state.
\subsection{Early days of direct-style} % how
% effectful programming has evolved as well as providing an informal
% introduction to the involved core concepts. We will look at the
% evolution of effectful programming through the lens of a singular
% effect, namely, global mutable state.
% The evolution of effectful programming has gone through several
% characteristic time periods. In this section I will provide a brief
% programming perspective on how effectful programming has evolved as
% well as providing an informal introduction to the core concepts
% concerned with each time period. We will look at the evolution of
% effectful programming through the lens of a singular effect, namely,
% global mutable state.
\subsection{Direct-style state}
% %
Programming in its infancy was effectful as the idea of first-class We can realise stateful behaviour by either using language-supported
control was conceived already during the design of the programming state primitives, globally structure our program to follow a certain
language Algol~\cite{BackusBGKMPRSVWWW60} -- one of the early style, or use first-class control in the form of delimited control to
high-level programming languages along with simulate state. As for simulating state with control effects we
Fortran~\cite{BackusBBGHHNSSS57} and Lisp~\cite{McCarthy60} -- when consider only delimited control, because undelimited control is
\citet{Landin98} sought to model unrestricted goto-style jumps using insufficient to express mutable state~\cite{FriedmanS00}.
an extended $\lambda$-calculus. The nature of \citeauthor{Landin98}'s % Programming in its infancy was effectful as the idea of first-class
control facility is undelimited; its power was recognised early by % control was conceived already during the design of the programming
\citet{Burstall69}, who used it to implement a thread scheduler. % language Algol~\cite{BackusBGKMPRSVWWW60} -- one of the early
% % high-level programming languages along with
\citeauthor{Landin98}'s control facility did not gain popularity as a % Fortran~\cite{BackusBBGHHNSSS57} and Lisp~\cite{McCarthy60} -- when
practical programming abstraction~\cite{Felleisen87b}. % \citet{Landin98} sought to model unrestricted goto-style jumps using
% an extended $\lambda$-calculus. The power of \citeauthor{Landin98}'s
% control facility was recognised early by \citet{Burstall69}, who used
% it to implement a control abstraction for tree-based search.
% %
% % \citeauthor{Landin98}'s control facility did not gain popularity as a
% % practical programming abstraction~\cite{Felleisen87b}.
% \citeauthor{Landin98}'s control facility is a precursor to the
% undelimited control operator $\Callcc$ (short for call with current
% continuation), which first appeared in the programming language
% Scheme~\cite{AbelsonHAKBOBPCRFRHSHW85}.
% %
% The power of \citeauthor{Landin98}'s control facility was recognised early The nature of the first-class control introduced by % The power of \citeauthor{Landin98}'s control facility was recognised early The nature of the first-class control introduced by
@@ -531,9 +556,9 @@ computation returns the boolean value paired with the final value of
the state cell. the state cell.
\subsubsection{Transparent state-passing purely functionally} \subsubsection{Transparent state-passing purely functionally}
It is possible to implement stateful behaviour even in a language It is possible to implement stateful behaviour in a language without
without any computational effects, e.g. simply typed any computational effects, e.g. simply typed $\lambda$-calculus, by
$\lambda$-calculus, by following a particular design pattern known as following a particular design pattern known as
\emph{state-passing}. The principal idea is to parameterise stateful \emph{state-passing}. The principal idea is to parameterise stateful
functions by the current state and make them return whatever result functions by the current state and make them return whatever result
they compute along with the updated state value. More precisely, in they compute along with the updated state value. More precisely, in
@@ -699,7 +724,8 @@ $\runState$ function to apply the $\incrEven$ function.
\runState~\incrEven~4~ \reducesto^+ \Record{\True;5} : \Bool \times \Int \runState~\incrEven~4~ \reducesto^+ \Record{\True;5} : \Bool \times \Int
\] \]
\subsection{Monadic epoch} % \subsection{Monadic epoch}
\subsection{Monadic state}
During the late 80s and early 90s monads rose to prominence as a During the late 80s and early 90s monads rose to prominence as a
practical programming idiom for structuring effectful practical programming idiom for structuring effectful
programming~\cite{Moggi89,Moggi91,Wadler92,Wadler92b,JonesW93,Wadler95,JonesABBBFHHHHJJLMPRRW99}. programming~\cite{Moggi89,Moggi91,Wadler92,Wadler92b,JonesW93,Wadler95,JonesABBBFHHHHJJLMPRRW99}.