1
0
mirror of https://github.com/dhil/phd-dissertation synced 2026-03-13 11:08:25 +00:00

Rewording

This commit is contained in:
2020-09-10 01:20:21 +01:00
parent 1a41dc8e63
commit 3bf65269f7

View File

@@ -3288,7 +3288,7 @@ If $M \reducesto N$ then $\pcps{M} \reducesto^+ \areducesto^* \pcps{N}$.
\paragraph{Plotkin's colon translation} \paragraph{Plotkin's colon translation}
The defacto standard method for proving the correctness of a CPS The traditional method for proving the correctness of a CPS
translation is by way of a simulation result. Simulation states that translation is by way of a simulation result. Simulation states that
every reduction sequence in a given source program is mimicked by its every reduction sequence in a given source program is mimicked by its
CPS transformation. CPS transformation.
@@ -3300,10 +3300,10 @@ arise in the source program.
\citet{Plotkin75} uses the so-called \emph{colon translation} to \citet{Plotkin75} uses the so-called \emph{colon translation} to
overcome static administrative reductions. overcome static administrative reductions.
% %
Informally, it is defined such that given a source term $M$ and a Informally, it is defined such that given some source term $M$ and
continuation $k$, the term $M : k$ is the result of performing all some continuation $k$, then the term $M : k$ is the result of
static administrative reductions on $\cps{M}\,k$, that is performing all static administrative reductions on $\cps{M}\,k$, that
$\cps{M}\,k \reducesto^\ast M : k$. is to say $\cps{M}\,k \areducesto^* M : k$.
% %
Thus this translation makes it possible to bypass administrative Thus this translation makes it possible to bypass administrative
reductions and instead focus on the reductions inherited from the reductions and instead focus on the reductions inherited from the