From: Mart Lubbers <mart@martlubbers.net>
Date: Mon, 25 Sep 2023 14:07:15 +0000 (+0200)
Subject: errata
X-Git-Url: https://git.martlubbers.net/?a=commitdiff_plain;h=f523436504952436ae434f300421f72f2b2e829f;p=phd-thesis.git

errata

errata
---

diff --git a/back/acknowledgements.tex b/back/acknowledgements.tex
index 3e9e8f0..e641d68 100644
--- a/back/acknowledgements.tex
+++ b/back/acknowledgements.tex
@@ -35,7 +35,7 @@ Simone Meeuwsen,
 Sjaak Smetsers,
 Steffen Michels,
 Sven-Bodo Scholz,
-Tim Steenvoorden, and everyone else from department.
+Tim Steenvoorden, and everyone else from the department.
 
 The many students that allowed and trusted me to (co) supervise them in their theses:
 Arjen Nederveen,
@@ -58,7 +58,7 @@ Pieter and Anouk;
 Chris and Maudy;
 Koen and Michelle;
 Alba;
-\foreignlanguage{russian}{Александер};
+\foreignlanguage{russian}{Александр};
 Annerieke;
 Camil and Devika;
 Emma;
diff --git a/dsl/class.tex b/dsl/class.tex
index 7bab63d..de5ef8a 100644
--- a/dsl/class.tex
+++ b/dsl/class.tex
@@ -82,7 +82,7 @@ The following function, transforming the \haskelllhstexinline{Expr_0} data type
 \begin{lstHaskellLhstex}
 print_0 :: Expr_0 -> String
 print_0 (Lit_0 v)     = show v
-print_0 (Add_0 e1 e2) = "(" ++ print_0 e1 ++ "-" ++ print_0 e2 ++ ")"
+print_0 (Add_0 e1 e2) = "(" ++ print_0 e1 ++ "+" ++ print_0 e2 ++ ")"
 \end{lstHaskellLhstex}
 
 While the language is concise and elegant, it is not very expressive.
diff --git a/intro/intro.tex b/intro/intro.tex
index 0e85faa..9f68f69 100644
--- a/intro/intro.tex
+++ b/intro/intro.tex
@@ -46,7 +46,7 @@ For example, the \gls{TOP} system \gls{ITASK} is used to program all layers of m
 It is implemented in the general-purpose lazy functional programming language \gls{CLEAN}, and therefore requires relatively powerful hardware.
 The inflated hardware requirements are no problem for regular computers but impractical for the average edge device.
 
-This is where an additional \glspl{DSL} must play its part.
+This is where additional \glspl{DSL} must play their part.
 \Glspl{DSL} are programming languages tailored to a specific domain.
 Consequently, jargon is not expressed in terms of the language itself, but is built into the language.
 Furthermore, the \gls{DSL} can eschew language or system features that are irrelevant for the domain.
diff --git a/top/lang.tex b/top/lang.tex
index 243733e..96c7b27 100644
--- a/top/lang.tex
+++ b/top/lang.tex
@@ -668,8 +668,8 @@ The task resulting from the \cleaninline{simulate} function presents the user wi
 The simulation allows the user to (partially) execute tasks, control the simulated peripherals, inspect the internal state of the tasks, and interact with \glspl{SDS}.
 
 \begin{lstClean}[caption={The entry point for the simulation interpretation.},label={lst:simulatemain}]
-:: TraceTask a // from the mTask simulator library
-simulate :: (Main (TraceTask a)) -> [String]
+:: TraceTask a; :: TT a // from the mTask simulator library
+simulate :: (Main (TT a)) -> Task (TraceTask a)
 \end{lstClean}
 
 \begin{figure}