+The \cleaninline{intBlink} task (\cref{lst:intro_blink_mtask}) is the \gls{MTASK} part of the application.
+It blinks \pgls{LED} on the edge device with the delay that is dynamically adjustable by the user via an \gls{ITASK} editor in the browser.
+It has its own tasks, \glspl{SDS}, and \gls{UOD}.
+This task first defines \gls{GPIO} pin 13 to be of the output type (\cref{lst:intro:declarePin}).
+Then the \gls{ITASK} \gls{SDS} is lifted to an \gls{MTASK} \gls{SDS} (\cref{lst:intro:liftsds}), enabling the machinery to keep the \gls{SDS} in sync both on the device and the server.
+The main expression of the program calls the \cleaninline{blink} function with an initial state.
+This function on \crefrange{lst:intro:blink_fro}{lst:intro:blink_to} first reads the interval \gls{SDS}, waits the specified delay, writes the state to the \gls{GPIO} pin, and calls itself recursively using the inverse of the state in order to run continuously.
+The \cleaninline{>>\|.} operator denotes the sequencing of tasks in \gls{MTASK}.
+
+\cleaninputlisting[linerange={24-,26-34},firstnumber=11,numbers=left,caption={The \gls{MTASK} code for the interactive blinking application.},label={lst:intro_blink_mtask}]{lst/blink.icl} %chktex 8
+
+\subsection{Other TOP languages}
+While \gls{ITASK} conceived \gls{TOP}, it is no longer the only \gls{TOP} system.
+Some \gls{TOP} languages were created to fill a gap encountered in practice.
+Toppyt \citep{lijnse_toppyt_2022} is a general purpose \gls{TOP} language written in \gls{PYTHON} used to host frameworks for modelling command \& control systems.
+The hTask system is a \gls{TOP} system written in \gls{HASKELL} used as a vessel for experimenting with asynchronous \glspl{SDS} \citep{lubbers_htask_2022}.
+Furthermore, some \gls{TOP} systems arose from Master's and Bachelor's thesis projects.
+For example, \textmu{}Task \citep{piers_task-oriented_2016}, a \gls{TOP} language for modelling non-interruptible embedded systems in \gls{HASKELL}, and LTasks \citep{van_gemert_task_2022}, a \gls{TOP} language written in the dynamically typed programming language Lua.
+Finally, there are \gls{TOP} languages with strong academic foundations.
+\Gls{TOPHAT} is a fully formally specified \gls{TOP} language designed to capture the essence of \gls{TOP} \citep{steenvoorden_tophat_2019}.
+Such a formal specification allows for symbolic execution, hint generation, but also the translation to \gls{ITASK} for actually performing the work \citep{steenvoorden_tophat_2022}.
+%\Citeauthor{steenvoorden_tophat_2022} distinguishes two instruments for \gls{TOP}: \gls{TOP} languages and \gls{TOP} engines.
+%The language is the \emph{formal} language for specifying interactive systems.
+%The engine is the software or hardware that executes these specifications as a ready-for-work application.
+%Defining comparable semantics for the \gls{MTASK} language is in progress \citep{antonova_mtask_2022}.
+
+\subsection{Tierless programming}
+Both \gls{ITASK} and \imtask{} are so called tierless systems.
+Tierless programming is an entirely different development paradigm compared to traditional, tiered, programming.
+In tiered programming, every component\slash{}tier is separately developed, possibly in different programming languages and programming paradigms, and integrated in the system as a whole.
+On the one hand, it is an advantage to be able to choose the most suitable programming language for the specific tier.
+But on the other, it increases the amount of integration work that needs to be done and it may increase the semantic friction between the tiers.
+In contrast, tierless programming languages synthesise all tiers of a software stack from a single high-level specification.
+Hence, reducing the semantic friction, increasing the maintainability costs, and reducing the possibility for runtime errors.
+The term tierless programming originated from the web programming system Links \citep{cooper2006links}.
+In Links, code for each tier simultaneously checked by the compiler, and compiled to HTML and JavaScript for the web client and to SQL on the server to interact with the database system.
+The \gls{ITASK} system is a tierless system taking care of both the presentation and application layer (see \cref{fig:iot-layers}).
+When \gls{ITASK} is used in conjunction with \gls{MTASK}, all layers of an \gls{IOT} system can be programmed from a single source and hence they are a tierless \gls{IOT} system.
+
+\section{Contributions}%
+\label{sec:contributions}
+This section provides a thorough overview of the relation between the scientific publications and the contents of this thesis.
+
+\subsection{\Fullref{prt:dsl}}
+The \gls{MTASK} system is an \gls{EDSL} and during the development of it, several novel basal techniques for embedding \glspl{DSL} in \gls{FP} languages were found.
+This paper-based episode is based on the following papers:
+\begin{enumerate}
+ \item \emph{Deep Embedding with Class} \citep*{lubbers_deep_2022} is the basis for \cref{chp:classy_deep_embedding}.
+ It shows a novel deep embedding technique for \glspl{DSL} where the resulting language is extendible both in constructs and in interpretation just using type classes and existential data types.
+ The related work section is updated with the research found after publication.
+ \Cref{sec:classy_reprise} was added after publication and contains a (yet) unpublished extension of the embedding technique for reducing the required boilerplate at the cost of requiring some advanced type system extensions.
+ The paper was published at the \tfp{} 2022 in Krakow, Poland (moved to online).
+ \item \emph{First-\kern-1ptClass Data Types in Shallow Embedded Domain-Specific Languages} \citep*{lubbers_first-class_2022}\label{enum:first-class} is the basis for \cref{chp:first-class_datatypes}.
+ It shows how to inherit data types from the host language in \glspl{EDSL} using metaprogramming by providing a proof-of-concept implementation using \gls{HASKELL}'s metaprogramming system: \glsxtrlong{TH}.
+ The chapter also serves as a gentle introduction to, and contains a thorough literature study on \glsxtrlong{TH}.
+ The paper was published at the \ifl{} 2022 in Copenhagen, Denmark.
+\end{enumerate}
+
+\paragraph{Contribution:}
+The papers are written by me, there were weekly meetings with co-authors in which we discussed and refined the ideas.
+
+\subsection{\crtCref{prt:top}: \hspace{8.28992pt}\nameref{prt:top}}
+This episode is a monograph that shows the design, properties, implementation and usage of the \gls{MTASK} system and \gls{TOP} for the \gls{IOT}.
+It is compiled from the following publications:
+
+\begin{enumerate}[resume]
+ \item \emph{A Task-\kern-1.25ptBased \glsxtrshort{DSL} for Microcomputers} \citep*{koopman_task-based_2018}
+ is the initial \gls{TOP}\slash{}\gls{MTASK} paper.
+ It provides an overview of the initial \gls{TOP} \gls{MTASK} language and shows first versions of some interpretations.
+ The paper was published at the \rwdsl{} 2018 in Vienna, Austria.
+ \item \emph{Task Oriented Programming for the Internet of Things} \citep*{lubbers_task_2018}\footnote{This work is an extension of my Master's thesis \citep{lubbers_task_2017}.}
+ shows how a simple imperative variant of \gls{MTASK} was integrated with \gls{ITASK}.
+ While the language differs a lot from the current version, the integration mechanism is still used.
+ The paper was published at the \ifl{} 2018 in Lowell, MA, {USA}.
+ \item \emph{Multitasking on Microcontrollers using Task Oriented Programming} \citep*{lubbers_multitasking_2019}\footnote{This work acknowledges the support of the \erasmusplus{} project ``Focusing Education on Composability, Comprehensibility and Correctness of Working Software'', no.\ 2017--1--SK01--KA203--035402.}
+ is a short paper on the multitasking capabilities of \gls{MTASK} comparing it to traditional multitasking methods for \gls{ARDUINO}.
+
+ The paper was published at the \fcows{} 2019 in Opatija, Croatia.
+ \item \emph{Simulation of a Task-\kern-1.25ptBased Embedded Domain Specific Language for the Internet of Things} \citep*{koopman_simulation_2023}\footnotemark[\value{footnote}]
+ are the revised lecture notes for a course on the \gls{MTASK} simulator provided at the 2018 \gls{3COWS} winter school in Ko\v{s}ice, Slovakia, January 22--26, 2018.
+ \item \emph{Writing Internet of Things Applications with Task Oriented Programming} \citep*{lubbers_writing_2023}\footnotemark[\value{footnote}]
+ are the revised lecture notes from a course on programming \gls{IOT} systems using \gls{MTASK} provided at the 2019 \gls{3COWS} summer school in Budapest, Hungary, June 17--21, 2019.
+ \item \emph{Interpreting Task Oriented Programs on Tiny Computers} \citep*{lubbers_interpreting_2019}
+ shows an implementation of the byte code compiler and \gls{RTS} of \gls{MTASK}.
+ The paper was published at the \ifl{} 2019 in Singapore.
+ \item \emph{Reducing the Power Consumption of IoT with Task-Oriented Programming} \citep*{crooijmans_reducing_2022}
+ shows how to create a scheduler so that devices running \gls{MTASK} tasks can go to sleep more automatically and how interrupts are incorporated in the language.
+ The paper was published at the \tfp{} 2022 in Krakow, Poland (moved to online).
+ \item \emph{Green Computing for the Internet of Things} \citep*{lubbers_green_2022}\footnote{This work acknowledges the support of the \erasmusplus{} project ``SusTrainable---Promoting Sustainability as a Fundamental Driver in Software Development Training and Education'', no.\ 2020--1--PT01--KA203--078646.}
+ are the revised lecture notes from a course on sustainable \gls{IOT} programming with \gls{MTASK} provided at the 2022 SusTrainable summer school in Rijeka, Croatia, July 4--8, 2022.
+\end{enumerate}
+
+\paragraph{Contribution:}
+The original \gls{MTASK} language, and their initial interpretations were developed by Pieter Koopman and Rinus Plasmeijer.
+I extended the language, developed the byte code interpreter, the integration with \gls{ITASK}, and the \gls{RTS}.
+The papers of which I am first author are solely written by me, there were weekly meetings with the co-authors in which we discussed and refined the ideas.
+
+\subsection{\Fullref{prt:tvt}}
+\Cref{prt:tvt} is based on a journal paper that quantitatively and qualitatively compares traditional \gls{IOT} architectures with \gls{TOP} \gls{IOT} architectures.
+\begin{enumerate}[resume]
+ \item \emph{Could Tierless Programming Reduce IoT Development Grief?} \citep*{lubbers_could_2023}
+ is an extended version of paper~\ref{enum:iot20}.
+ It compares programming traditional tiered architectures to tierless architectures by illustrating a qualitative and a quantitative four-way comparison of a smart-campus application.
+ The paper was published in the \tiot{} journal.
+ \item \emph{Tiered versus Tierless \glsxtrshort{IOT} Stacks: Comparing Smart Campus Software Architectures} \citep*{lubbers_tiered_2020}\footnote{This work was partly funded by the 2019 Radboud-Glasgow Collaboration Fund.}\label{enum:iot20} compares traditional tiered programming to tierless architectures by comparing two implementations of a smart-campus application.
+ The paper was published in the \iotconf{} 2020 in Malm\"o, Sweden (moved to online).
+\end{enumerate}
+
+\paragraph{Contribution:}