Rewording. THANKS AGAIN AMNA.

thesis.tex

@@ -299,7 +299,7 @@
 %% Acknowledgements
 \begin{acknowledgements}
   Firstly, I want to thank Sam Lindley for his guidance, advice, and
-  encouragement throughout my studies. He has been enthusiastic
+  encouragement throughout my studies. He has been an enthusiastic
   supervisor, and he has always been generous with his time. I am
   fortunate to have been supervised by him.
   %
@@ -309,12 +309,11 @@
   %
   Thirdly, I want to thank my academic brother Simon Fowler, who has
   always been a good friend and a pillar of inspiration. Regardless of
-  academic triumphs and failures, we have always been able to laugh at
-  it all and have our own fun.
+  academic triumphs and failures, we have always had fun.
 
-  I also want to thank KC Sivaramakrishnan for taking a genuine
-  interest in my research early on and for inviting me to come spend
-  some time at OCaml Labs in Cambridge. My initial visit to Cambridge
+  I am extremely grateful to KC Sivaramakrishnan, who took a genuine
+  interest in my research early on and invited me to come spend some
+  time at OCaml Labs in Cambridge. My initial visit to Cambridge
   sparked the beginning of a long-standing and productive
   collaboration. Also, thanks to Gemma Gordon, who I had the pleasure
   of sharing an office with during one of my stints at OCaml Labs.
@@ -324,25 +323,25 @@
   work is clearly reflected in this dissertation.
   %
   I also want to thank my other collaborators: Andreas Rossberg, Anil
-  Madhavapeddy, Leo White, and Stephen Dolan, Jeremy Yallop.
+  Madhavapeddy, Leo White, Stephen Dolan, and Jeremy Yallop.
 
-  I have had the absolute pleasure of working in LFCS at the same time
-  as James McKinna. James has always taken a genuine interest in my
-  work and challenged me with intellectually stimulating questions. I
-  have appreciate our many conversations even though I spent days,
-  weeks, sometimes months, and in some instances years to come up with
+  I have had the pleasure of working in LFCS at the same time as James
+  McKinna. James has always taken a genuine interest in my work and
+  challenged me with intellectually stimulating questions. I
+  appreciate our many conversations even though I spent days, weeks,
+  sometimes months, and in some instances years to come up with
   adequate answers. I also want to thank other former and present
-  members of LFCS and other institutes within Informatics: Brian
-  Campbell, Christophe Dubach, James Cheney, J. Garrett Morris, Gordon
-  Plotkin, and Michel Steuwer.
+  members of Informatics: Brian Campbell, Christophe Dubach, James
+  Cheney, J. Garrett Morris, Gordon Plotkin, Michel Steuwer, Philip
+  Wadler, and Stephen Gilmore.
 
-  My time as a student in Informatics Forum was an enjoyable
-  experience in large part thanks to my student peers and friends:
-  Amna Shahab, Chris Vasiladiotis, Craig McLaughlin, Dan Mills, Danel
-  Ahman, Frank Emrich, Emanuel Martinov, Floyd Chitalu, Larisa
-  Stoltzfus, Jakub Zalewski, Maria Gorinova, Marcin Szymczak, Rajkarn
-  Singh, Rudi Horn, Philip Ginsbach, Paul Piho, Stan Manilov, and
-  Vanya Yaneva-Cormack.
+  My time as a student in Informatics Forum has been enjoyable in
+  large part thanks to my friends: Amna Shahab, Chris Vasiladiotis,
+  Craig McLaughlin, Dan Mills, Danel Ahman, Frank Emrich, Emanuel
+  Martinov, Floyd Chitalu, Larisa Stoltzfus, Jakub Zalewski, Maria
+  Gorinova, Marcin Szymczak, Paul Piho, Philip Ginsbach, Radu Ciobanu,
+  Rajkarn Singh, Rudi Horn, Shayan Najd, Stan Manilov, and Vanya
+  Yaneva-Cormack.
 
   Thanks to Ohad Kammar for being a good friend, taking a genuine
   interest in my work, making it fun to attend virtual conferences,
@@ -2326,7 +2325,10 @@ synonymous.
 
 For a function $f : A \to B$ (or partial function $f : A \pto B$) we
 write $f(a) = b$ to mean $(a, b) \in f$, and say that $f$ applied to
-$a$ returns $b$. The notation $f(a)$ means the application of $f$ to
+$a$ returns $b$. We write $f(P) \defas M$ for the definition of a
+function with pattern $P$ and expression $M$, and sometimes we will
+use the anonymous notation $P \mapsto M$ to mean $f(P) \defas M$ for
+some fresh $f$.  The notation $f(a)$ means the application of $f$ to
 $a$, and we say that $f(a)$ is defined whenever $f(a) = b$ for some
 $b$.
 %
@@ -11339,6 +11341,12 @@ and eliminates extraneous terms at translation
 time~\cite{DanvyN03}. Extraneous terms come in various disguises as we
 shall see later in this chapter.
 
+The complete exposure of the control flow makes CPS a good fit for
+implementing control operators such as effect handlers. It is an
+established intermediate representation used by compilers, providing
+it with merits as a practical compilation
+target~\cite{Appel92,Kennedy07}.
+
 The purpose of this chapter is to use the CPS formalism to develop a
 universal implementation strategy for deep, shallow, and parameterised
 effect handlers. Section~\ref{sec:target-cps} defines a suitable
@@ -19476,8 +19484,9 @@ design space of deep and parameterised notions of multi handlers have
 yet to be explored as well as their applications domains. Thus an
 interesting future direction of research would be to extend $\HCalc$
 with multi handlers and explore their practical programming
-applicability. The effect system pose an interesting design challenge
-for multi handlers as any problematic quirks that occur with unary
+applicability. Retrofitting the effect system of $\HCalc$ to provide a
+good programmer experience for programming with multi handlers pose an
+interesting design challenge as any quirks that occur with unary
 handlers only get amplified in the setting of multi handlers.
 
 \paragraph{Handling linear resources} The implementation of effect