dhil/phd-dissertation
1
0
Fork 0
mirror of https://github.com/dhil/phd-dissertation synced 2026-03-12 18:48:25 +00:00
Code Issues Releases Wiki Activity

Minor tweaks and typo fixes.

Browse Source
This commit is contained in:
Daniel Hillerström
2022-03-21 14:12:59 +00:00
parent 8679803146
commit 20551152b3
2 changed files with 7 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
thesis.bib
View File

@@ -1258,7 +1258,7 @@
@techreport{Remy93, @techreport{Remy93,
title = {{Syntactic theories and the algebra of record terms}}, title = {{Syntactic theories and the algebra of record terms}},
author = {Didier Remy}, author = {Didier R\'{e}my},
number = {RR-1869}, number = {RR-1869},
institution = {{INRIA}}, institution = {{INRIA}},
year = {1993}, year = {1993},

11
thesis.tex
View File

@@ -13570,10 +13570,10 @@ Figure~\ref{fig:bpcf} depicts the type syntax, type environment
syntax, and term syntax of $\BPCF$. syntax, and term syntax of $\BPCF$.
% %
The main difference in the type language between $\BCalc$ and $\BPCF$ The main difference in the type language between $\BCalc$ and $\BPCF$
is that the latter does feature polymorphism and an effect tracking is that the latter does not feature polymorphism nor an effect
system. At the term level, $\BPCF$ does not feature polymorphic tracking system. At the term level, $\BPCF$ does not feature
records and variants, but rather plain pairs and sums. For sums the polymorphic records and variants, but rather plain pairs and sums. For
left injection is introduced by $(\Inl~V)^B$, where the type sums the left injection is introduced by $(\Inl~V)^B$, where the type
annotation $B$ is the type of the right injection. Similarly, the annotation $B$ is the type of the right injection. Similarly, the
right injection is introduced by $(\Inl~W)^A$, where $A$ is the type right injection is introduced by $(\Inl~W)^A$, where $A$ is the type
of the left injection. The $\Case$-construct eliminates sums. The last of the left injection. The $\Case$-construct eliminates sums. The last
@@ -14258,7 +14258,8 @@ The syntax is extended as follows.
% %
The notion of configurations changes slightly as the continuation The notion of configurations changes slightly as the continuation
component is replaced by a generalised continuation component is replaced by a generalised continuation
$\kappa \in \MGContCat$, just as described in Chapter~\ref{ch:abstract-machine}% ; a continuation is now a list of $\kappa \in \MGContCat$, in the same way as described in
Chapter~\ref{ch:abstract-machine}.% ; a continuation is now a list of
% resumptions. A resumption is a pair of a pure continuation (as in the % resumptions. A resumption is a pair of a pure continuation (as in the
% base machine) and a handler closure ($\chi$). % base machine) and a handler closure ($\chi$).
% %