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

Characterise static administrative redexes

Browse Source
This commit is contained in:
Daniel Hillerström
2020-09-23 13:01:50 +01:00
parent 0d349fb56d
commit de42fdc282
1 changed files with 14 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
thesis.tex
View File

@@ -2499,10 +2499,20 @@ whether it is \emph{static} or \emph{dynamic}. A static administrative
redex is a by-product of the translation that does not contribute to redex is a by-product of the translation that does not contribute to
the implementation of the dynamic behaviour of the preimage. the implementation of the dynamic behaviour of the preimage.
% %
In contrast, a dynamic administrative redex is a genuine The separation between value and computation terms in fine-grain
implementation detail that supports some part of the dynamic behaviour call-by-value makes it evident where static administrative redexes can
of the preimage. An example of such a detail is the implementation of arise. They arise from computation terms, which can clearly be seen
effect forwarding. In $\HCalc$ effect forwarding involves no auxiliary from the translation where each computation term induces a
$\lambda$-abstraction. Each induced $\lambda$-abstraction must
necessarily be eliminated by a unary application. These unary
applications are administrative; they do not correspond to reductions
in the preimage. Instead the applications that do correspond to
reductions in the preimage are the binary continuation applications.
A dynamic administrative redex is a genuine implementation detail that
supports some part of the dynamic behaviour of the preimage. An
example of such a detail is the implementation of effect
forwarding. In $\HCalc$ effect forwarding involves no auxiliary
reductions, any operation invocation is instantaneously dispatched to reductions, any operation invocation is instantaneously dispatched to
a suitable handler (if such one exists). a suitable handler (if such one exists).
% %
@@ -2517,11 +2527,6 @@ Section~\ref{sec:first-order-explicit-resump} administrative
reductions due to resumption invocation can be dealt with by choosing reductions due to resumption invocation can be dealt with by choosing
a more clever implementation of resumptions. a more clever implementation of resumptions.
% We can characterise static administrative redexes\dots
% \dhil{Characterise static redexes\dots}
% \dhil{Discuss dynamic and static administrative redex.}
\subsection{Resumptions as explicit reversed stacks} \subsection{Resumptions as explicit reversed stacks}
\label{sec:first-order-explicit-resump} \label{sec:first-order-explicit-resump}
% %