[phd-thesis.git] / intro / intro.tex

\documentclass[../thesis.tex]{subfiles}

\input{subfilepreamble}
\setcounter{chapter}{-1}

\begin{document}
\chapter{Prelude}%
\label{chp:introduction}
\begin{chapterabstract}
        This chapter is the introduction of the dissertation and to the thesis.
        It first provides a general introduction to the topics and research venues taken in this document, ending with a reading guide.
        The sections that follow provide background material on the \glsxtrlong{IOT}, \glsxtrlongpl{DSL}, \glsxtrlong{TOP}, \gls{ITASK}, and \gls{MTASK}.
        Finally, it provides a detailed overview of the contributions.
\end{chapterabstract}

There are at least 13.4 billion devices connected to the internet at the time of writing\footnote{\url{https://transformainsights.com/research/tam/market}, accessed on: \formatdate{13}{10}{2022}}.
Each and every one of those devices senses, acts, or otherwise interacts with people, other computers, and the environment surrounding us.
Even though there is a substantial variety among these devices, they all have one thing in common: they are all computers and hence require software to operate.

An increasing amount of these connected devices are so-called \emph{edge devices} that operate in the \gls{IOT}.
Typically, these edge devices are powered by microcontrollers.
Said microcontrollers contain integrated circuits accommodating a microprocessor designed for use in embedded applications.
Typical edge devices are therefore tiny in size; have little memory; contain a slow, but energy-efficient processor; and allow for a lot of connectivity to connect peripherals such as sensors and actuators in order to interact with their surroundings.
%
%\begin{figure}[ht]
%       \centering
%       \includegraphics[width=.4\linewidth]{esp}
%       \caption{A typical ESP32 microcontroller prototyping board.}%
%       \label{fig:esp_prototype}
%\end{figure}

Programming and maintaining \gls{IOT} systems is a complex and error-prone process.
An \gls{IOT} programmer has to program each device and their interoperation using different programming paradigms, programming languages, and abstraction levels resulting in semantic friction.

This thesis describes the research carried out around taming these complex \gls{IOT} systems using \gls{TOP}.
\Gls{TOP} is an innovative tierless programming paradigm for interactive multi-tier systems.
By utilising advanced compiler technologies, much of the internals, communication, and interoperation of the applications is automatically generated.
From a single declarative specification of the work that needs to be done, the compiler makes a ready-for-work application.
For example, the \gls{TOP} system \gls{ITASK} can be used to program all layers of a multi-user distributed web applications from a single source specification.
Unfortunately, because the abstraction level is so high, the hardware requirements are too excessive for such systems to be suitable for the average \gls{IOT} edge device.

This is where \glspl{DSL} are brought into play.
\Glspl{DSL} are programming languages created with a specific domain in mind.
Consequently, jargon does not have to be expressed in the language itself, but they can be built-in features.
As a result, the hardware requirements can be drastically lower, even with high levels of abstraction for the specified domain.

To bridge the gap between the \gls{IOT} edge devices, the \gls{MTASK} \gls{DSL} is used.
\Gls{MTASK} is a novel programming language for programming \gls{IOT} edge devices using \gls{TOP}.
As it is integrated with \gls{ITASK}, it allows for all layers of an \gls{IOT} application to be programmed from a single source.
\todo{Kan deze \P\ weg? Aan\-ge\-zien het ook al in de volgende sectie staat}

\section{Reading guide}%
\label{lst:reading_guide}
The thesis is structured as a purely functional rhapsody.
On Wikipedia, a musical rhapsody is defined as follows \citep{wikipedia_contributors_rhapsody_2022}:
\begin{quote}\emph{%
        A \emph{rhapsody} in music is a one-movement work that is episodic yet integrated, free-flowing in structure, featuring a range of highly contrasted moods, colour, and tonality.}
\end{quote}
%The three episodes in this thesis are barded by the introduction and conclusion (\cref{chp:introduction,chp:conclusion}).
\Cref{prt:dsl} is a paper-based---otherwise known as cumulative---episode providing insights in advanced \gls{DSL} embedding techniques for \gls{FP} languages.
The chapters are readable independently.
\Cref{prt:top} is a monograph showing \gls{MTASK}, a \gls{TOP} \gls{DSL} for the \gls{IOT}.
Hence, the chapters are best read in order.
\Cref{prt:tvt} is a journal article in which traditional tiered \gls{IOT} programming is qualitatively and quantitatively compared to tierless programming using a real-world application.
The chapter is readable independently.

The following sections provide background material on the \gls{IOT}, \glspl{DSL}, and \gls{TOP} after which a detailed overview of the contributions is presented.
Text typeset as \texttt{teletype} represents source code.
Standalone source code listings are marked by the programming language used, e.g.\ \gls{CLEAN}\footnotemark, \gls{HASKELL}, \gls{CPP}, \etc.
\footnotetext{\Cref{chp:clean_for_haskell_programmers} contains a guide for \gls{CLEAN} tailored to \gls{HASKELL} programmers.}

\section{\texorpdfstring{\Glsxtrlong{IOT}}{Internet of things}}%
\label{sec:back_iot}
The \gls{IOT} is growing rapidly and it is changing the way people and machines interact with the world.
While the term \gls{IOT} briefly gained interest around 1999 to describe the communication of \gls{RFID} devices \citep{ashton_internet_1999,ashton_that_2009}, it probably already popped up halfway the eighties in a speech by \citet{peter_t_lewis_speech_1985}:

\begin{quote}
        \emph{The \glsxtrlong{IOT}, or \glsxtrshort{IOT}, is the integration of people, processes and technology with connectable devices and sensors to enable remote monitoring, status, manipulation and evaluation of trends of such devices.}
\end{quote}

CISCO states that the \gls{IOT} started when there where as many connected devices as there were people on the globe, i.e.\ around 2008 \citep{evans_internet_2011}.
Today, \gls{IOT} is the term for a system of devices that sense the environment, act upon it and communicate with each other and the world.
These connected devices are already in households all around us in the form of smart electricity meters, fridges, phones, watches, home automation, \etc.

When describing \gls{IOT} systems, a tiered---or layered---architecture is often used for compartmentalisation.
The number of tiers heavily depends on the required complexity of the model but for the intents and purposes of this thesis, the layered architecture as shown in \cref{fig:iot-layers} is used.

\begin{figure}
        \centering
        \includestandalone{iot-layers}
        \caption{A layered \gls{IOT} architecture.}%
        \label{fig:iot-layers}
\end{figure}

To explain the tiers, an example \gls{IOT} application---home automation---is dissected accordingly.
Closest to the end-user is the presentation layer, it provides the interface between the user and the \gls{IOT} system.
In home automation this may be a web interface or an app used on a phone or wall-mounted tablet to interact with the edge devices and view the sensor data.

The application layer provides the \glspl{API}, data interfaces, data processing, and data storage of the \gls{IOT} system.
A cloud server or local server provides this layer in a typical home automation application.

The perception layer---also called edge layer---collects the data and interacts with the environment.
It consists of edge devices such as microcontrollers equipped with various sensors and actuators.
In home automation this layer consists of all the devices hosting the sensors and actuators such as smart light bulbs, actuators to open doors or a temperature and humidity sensors.

All layers are connected using the network layer.
In some applications this is implemented using conventional networking techniques such as WiFi or Ethernet.
However, networks or layers on top of it---tailored to the needs of the specific interconnection between layers---have been increasingly popular.
Examples of this are BLE, LoRa, ZigBee, LTE-M, or \gls{MQTT} for connecting the perception layer to the application layer and techniques such as HTTP, AJAX, and WebSocket for connecting the presentation layer to the application layer.

Across the layers, the devices are a large heterogeneous collection of different platforms, protocols, paradigms, and programming languages often resulting in impedance problems or semantic friction between layers when programming \citep{ireland_classification_2009}.
Even more so, the perception layer itself often is a heterogeneous collections of microcontrollers in itself as well, each having their own peculiarities, language of choice, and hardware interfaces.
Moreover, as the edge hardware needs to be cheap, small-scale, and energy efficient, the microcontrollers used to power these devices do not have a lot of computational power, only a soup\c{c}on of memory, and little communication bandwidth.
Typically the devices are unable to run a full-fledged general-purpose \gls{OS} but use compiled firmwares that are written in an imperative language.
While devices are getting a bit faster, smaller, and cheaper, they keep these properties to an extent, greatly reducing the flexibility for dynamic systems where tasks are created on the fly, executed on demand, or require parallel execution.
As program memory is mostly flash based and only lasts a couple of thousand writes before it wears out, it is not suitable for rapid reconfiguring and reprogramming.

These problems can be mitigated by dynamically sending code to be interpreted to the microcontroller.
With interpretation, a specialized interpreter is flashed in the program memory once that receives the program code to execute at runtime.
Interpretation always comes with an overhead, making it challenging to create them for small edge devices.
However, the hardware requirements can be reduced by embedding domain-specific data into the programming language to be interpreted, so called \glspl{DSL}.

\section{\texorpdfstring{\Glsxtrlongpl{DSL}}{Domain-specific languages}}%
\label{sec:back_dsl}
% General
Programming languages can be divided up into two categories: \glspl{DSL}\footnotemark\ and \glspl{GPL} \citep{fowler_domain_2010}.
\footnotetext{Historically \glsxtrshortpl{DSL} have been called DSELs as well.}
Where \glspl{GPL} are not made with a demarcated area in mind, \glspl{DSL} are tailor-made for a specific domain.
Writing idiomatic domain-specific code in a \gls{DSL} is easy but this may come at the cost of the \gls{DSL} being less expressive to an extent that it may not even be Turing complete.
\Glspl{DSL} come in two main flavours: standalone and embedded (\cref{sec:standalone_embedded})\footnote{Standalone and embedded are also called external and internal respectively.} of which \glspl{EDSL} can further be classified into heterogeneous and homogeneous languages (\cref{sec:hetero_homo}).
This hyponymy is shown in \cref{fig:hyponymy_of_dsls}.

\begin{figure}
        \centering
        \includestandalone{hyponymy_of_dsls}
        \caption{A hyponymy of \glspl{DSL} (adapted from \citet[\citepage{2}]{mernik_extensible_2013})}%
        \label{fig:hyponymy_of_dsls}
\end{figure}

\subsection{Standalone and embedded}%
\label{sec:standalone_embedded}
\glspl{DSL} where historically created as standalone languages, meaning that all machinery is developed solely for the language.
The advantage of this approach is that the language designer is free to define the syntax and type system of the language as they wish, not being restricted by any constraint.
Unfortunately it also means that they need to develop a compiler or interpreter for the language, making standalone \glspl{DSL} costly to create.
Examples of standalone \glspl{DSL} are regular expressions, make, yacc, XML, SQL, \etc.

The dichotomous approach is embedding the \gls{DSL} in a host language, i.e.\ \glspl{EDSL} \citep{hudak_modular_1998}.
By defining the language as constructs in the host language, much of the machinery is inherited \citep{krishnamurthi_linguistic_2001}.
This greatly reduces the cost of creating embedded languages.
However, there are two sides to this coin.
If the syntax of the host language is not very flexible, the syntax of the \gls{DSL} may become clumsy.
Furthermore, \gls{DSL} errors shown to the programmer may be larded with host language errors, making it difficult for a non-expert of the host language to work with the \gls{DSL}.
\Gls{FP} languages are especially suitable for hosting embedded \glspl{DSL} because they often have strong and versatile type systems, minimal but flexible syntax and offer referential transparency.

\subsection{Heterogeneity and homogeneity}%
\label{sec:hetero_homo}
\Citet{tratt_domain_2008} applied a notion from metaprogramming \citep{sheard_accomplishments_2001} to \glspl{EDSL} to define homogeneity and heterogeneity of \glspl{EDSL} as follows:

\begin{quote}
        \emph{A homogeneous system is one where all the components are specifically designed to work with each other, whereas in heterogeneous systems at least one of the components is largely, or completely, ignorant of the existence of the other parts of the system.
}
\end{quote}

Homogeneous \glspl{EDSL} are therefore languages that are solely defined as an extension to their host language.
They often restrict features of the host language to provide a safer interface or capture an idiomatic pattern in the host language for reuse.
The difference between a library and a homogeneous \glspl{EDSL} is not always clear.
Examples of homogeneous \glspl{EDSL} are libraries such as ones for sets, regions, but also more complex tasks such as \glspl{GUI}.

On the other hand, heterogeneous \glspl{EDSL} are languages that are not executed in the host language.
For example, \citet{elliott_compiling_2003} describe the language Pan, for which the final representation in the host language is a compiler that will, when executed, generate code for a completely different target platform.
In fact, \gls{ITASK} and \gls{MTASK} are embedded \glspl{DSL}.
\Gls{ITASK} runs in its host language as well so it is a homogeneous \gls{DSL}.
Tasks written using \gls{MTASK} are serialised and executed on \gls{IOT} edge devices and it is therefore a heterogeneous \gls{DSL}.

\section{\texorpdfstring{\Glsxtrlong{TOP}}{Task-oriented programming}}%
\label{sec:back_top}
\Gls{TOP} is a recent declarative programming paradigm for modelling interactive systems \citep{plasmeijer_task-oriented_2012}.
\Citet{steenvoorden_tophat_2022} defines 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.
In \gls{TOP} languages, tasks are the basic building blocks and they represent the actual work.
Instead of dividing problems into \gls{LSOC} \gls{TOP} deals with separation of concerns in a novel way.
From the data types, utilising various \emph{type-parametrised} concepts, all other aspects are handled automatically (see \cref{fig:tosd}).
This approach to software development is called \gls{TOSD} \citep{wang_maintaining_2018}.

\begin{figure}
        \centering
        \begin{subfigure}[t]{.5\textwidth}
                \centering
                \includestandalone{traditional}
                \caption{\Gls{LSOC} approach.}
        \end{subfigure}%
        \begin{subfigure}[t]{.5\textwidth}
                \centering
                \includestandalone{tosd}
                \caption{\Gls{TOSD} approach.}
        \end{subfigure}
        \caption{Separation of concerns in a traditional setting compared to \gls{TOSD} (adapted from \citep[\citepage{20}]{wang_maintaining_2018}).}%
        \label{fig:tosd}
\end{figure}

\begin{description}
        \item[\Glsxtrshort{UI} (presentation layer):]
                The \gls{UI} of the system is automatically generated from the representation of the type.
                Though, practical \gls{TOP} systems allow tweaking afterwards to suit the specific needs of the application.
        \item[Tasks (business layer):]
                A task is an abstract representation of a piece of work that needs to be done.
                It provides an intuitive abstraction over work in the real world.
                Tasks are observable.
                During execution, it is possible to observe a---partial---result and act upon it, e.g.\ by starting new tasks
                Examples of tasks are filling forms, sending emails, reading sensors or even doing physical tasks.
                Just as with real-life tasks, multiple tasks can be combined in various ways such as in parallel or in sequence to form workflows.
                Such combination functions are called task combinators.
        \item[\Glsxtrshortpl{SDS} (resource access):]
                Tasks mainly communicate using their observable task values.
                However, some collaboration require tasks that are not necessarily related need to share data.
                \Glspl{SDS} fill this gap, they offer a safe and type safe abstraction over any data.
                An \gls{SDS} can represent typed data stored in a file, a chunk of memory, a database \etc.
                \Glspl{SDS} can also represent external impure data such as the time, random numbers or sensor data.
                In many \gls{TOP} langauges, combinators are available to filter, combine, transform, and focus \glspl{SDS}.
        \item[Programming language (\glsxtrshort{UOD}):]
                The \gls{UOD} is explicitly and separately modelled by the relations that exist in the functions of the host language.
\end{description}

Applying the concepts of \gls{LSOC} to \gls{IOT} systems can be done in two ways.
Firstly, edge devices can be seen as simple resources, thus accessed through the resource access layer.
The second view is that edge devices contain miniature \gls{LSOC} systems in itself as well.
In \gls{TOSD} the same can be applied.
The individual components in the miniature systems, the tasks, the \glspl{SDS}, are connected to the main system.
\todo{Is deze \P\ dui\-de\-lijk genoeg of \"uberhaupt nodig?}

\subsection{\texorpdfstring{\Gls{ITASK}}{ITask}}
The concept of \gls{TOP} originated from the \gls{ITASK} framework, a declarative interactive systems language and \gls{TOP} engine for defining multi-user distributed web applications implemented as an \gls{EDSL} in the lazy pure \gls{FP} language \gls{CLEAN} \citep{plasmeijer_itasks:_2007,plasmeijer_task-oriented_2012}.
From the structural properties of the data types, the entire user interface is automatically generated.
Browsers are powering \gls{ITASK}'s perception layer.
The framework is written using standard web techniques such as JavaScript, HTML, and CSS, \gls{ITASK} code running in the browser relies on an interpreter that operates on \gls{CLEAN}'s intermediate language \gls{ABC} \citep{staps_lazy_2019}.

As an example, \cref{lst:enter_person,fig:enter_person} show the \gls{ITASK} code and the corresponding \gls{UI} for a simple task for entering information about a person and viewing the entered result after completion.
From the data type definitions (\cref{lst:dt_fro,lst:dt_to}), using generic programming (\cref{lst:dt_derive}), the \glspl{UI} for the data types are automatically generated.
Using task combinators (e.g.\ \cleaninline{>>!} at \cref{lst:task_comb}), the tasks can be combined in sequence.
Only when the user enters a complete value in the web editor, then the continue button enables and the result can be viewed.
Special combinators (e.g.\ \cleaninline{@>>} at \cref{lst:task_ui}) are used to tweak the \gls{UI} so that informative labels are displayed.

\begin{figure}
        \includegraphics[width=.325\linewidth]{person0g}
        \includegraphics[width=.325\linewidth]{person1g}
        \includegraphics[width=.325\linewidth]{person2g}
        \caption{The \gls{UI} for entering a person in \gls{ITASK}.}%
        \label{fig:enter_person}
\end{figure}

\begin{lstClean}[numbers=left,caption={The code for entering a person in \gls{ITASK}.},label={lst:enter_person}]
:: Person = { name :: String, gender :: Gender, dateOfBirth :: Date }[+\label{lst:dt_fro}+]
:: Gender = Male | Female | Other String[+\label{lst:dt_to}+]

derive class iTask Person, Gender[+\label{lst:dt_derive}+]

enterPerson :: Task Person
enterPerson
        =            Hint "Enter a person:" @>> enterInformation [][+\label{lst:task_ui}+]
        >>! \result->Hint "You Entered:"    @>> viewInformation  [] result[+\label{lst:task_comb}+]
\end{lstClean}

\subsection{\texorpdfstring{\Gls{MTASK}}{MTask}}
\Gls{ITASK} seems an obvious candidate at first glance for extending \gls{TOP} to \gls{IOT} edge devices.
However, \gls{IOT} edge devices are in general not powerful enough to run or interpret \gls{CLEAN}\slash\gls{ABC} code, they just lack the processor speed and the memory.
To bridge this gap, \gls{MTASK} was developed, a \gls{TOP} system for \gls{IOT} edge devices that is integrated in \gls{ITASK} \citep{koopman_task-based_2018}.
\Gls{ITASK} abstracts away from details such as user interfaces, data storage, client-side platforms, and persistent workflows.
On the other hand, \gls{MTASK} offers abstractions for edge layer-specific details such as the heterogeneity of architectures, platforms, and frameworks; peripheral access; (multi) task scheduling; and lowering energy consumption.
The \gls{MTASK} language is written in \gls{CLEAN} as a multi-view \gls{EDSL} and hence there are multiple interpretations possible.
The byte code compiler is the most relevant for this thesis.
From an \gls{MTASK} task constructed at runtime, a compact binary representation of the work that needs to be done is compiled.
This byte code is then sent to a device that running the \gls{MTASK} \gls{RTS}.
This feather-light domain-specific \gls{OS} is written in portable \gls{C} with a minimal device specific interface and functions as a \gls{TOP} engine.
\Gls{MTASK} is seamlessly integrated with \gls{ITASK}: \gls{MTASK} tasks are integrated in such a way that they function as \gls{ITASK} tasks, and \glspl{SDS} in on the device can tether an \gls{ITASK} \gls{SDS}.
Using \gls{MTASK}, the programmer can define all layers of an \gls{IOT} system as a single declarative specification.

\Cref{lst:intro_blink} shows an interactive \gls{MTASK}\slash{}\gls{ITASK} application for blinking \pgls{LED} on the microcontroller every user-specified interval.
\Crefrange{lst:intro:itask_fro}{lst:intro:itask_to} show the \gls{ITASK} part.
First \pgls{SDS} is defined to communicate the blinking interval, then the \gls{MTASK} is connected using \cleaninline{withDevice}.
Once connected, the \cleaninline{intBlink} task is sent to the device (\cref{lst:intro_liftmtask}) and, in parallel, an editor is shown that updates the value of the interval \gls{SDS} (\cref{lst:intro_editor}).
The \cleaninline{intBlink} task (\crefrange{lst:intro:mtask_fro}{lst:intro:mtask_to}) is the \gls{MTASK} part of the application.
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}), followed by lifting the \gls{ITASK} \gls{SDS} to an \gls{MTASK} \gls{SDS} (\cref{lst:intro:liftsds}).
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.

\begin{lstClean}[numbers=left,caption={\Gls{MTASK}\slash{}\gls{ITASK} interactive blinking.},label={lst:intro_blink}]
interactiveBlink :: Task Int[+\label{lst:intro:itask_fro}+]
interactiveBlink =
        withShared 500 \iInterval->[+\label{lst:intro_withshared}+]
        withDevice {TCPSettings | host = ..., port = ...} \dev->
                    liftmTask (intBlink iInterval) dev[+\label{lst:intro_liftmtask}+]
                -|| Hint "Interval (ms)" @>> updateSharedInformation [] iInterval[+\label{lst:intro_editor}+][+\label{lst:intro:itask_to}+]

intBlink :: Shared sds Int -> MTask v Int | mtask, liftsds v & RWShared sds[+\label{lst:intro:mtask_fro}+]
intBlink iInterval =
           declarePin D13 PMOutput \d13->[+\label{lst:intro:declarePin}+]
           liftsds \mInterval=iInterval[+\label{lst:intro:liftsds}+]
        In fun \blink=(\st->[+\label{lst:intro:blink_fro}+]
                     getSds mInterval >>=. \i->delay i
                >>|. writeD d13 st >>|. blink (Not st))[+\label{lst:intro:blink_to}+]
        In {main = blink true}[+\label{lst:intro:mtask_to}+]
\end{lstClean}

\todo{Zal ik hier nog een soort conclusie maken van \gls{MTASK}.}

\subsection{Other \texorpdfstring{\glsxtrshort{TOP}}{TOP} languages}
While \gls{ITASK} conceived \gls{TOP}, it is not the only \gls{TOP} system.
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}.
Some \gls{TOP} languages were created to solve a practical problem.Toppyt \citep{lijnse_toppyt_2022} is a general purpose \gls{TOP} language written in \gls{PYTHON} used to host frameworks for modelling C2 systems, and hTask \citep{lubbers_htask_2022}, a vessel for experimenting with asynchronous \glspl{SDS}.
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} formally \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}.

\section{Contributions}%
\label{sec:contributions}
\todo{Dit heb ik sterk ingekort. Ok\'e?}
This section provides a thorough overview of the relation between the scientific publications and the episodes and chapters.

\subsection{\Fullref{prt:dsl}}
The \gls{MTASK} system is a heterogeneous \gls{EDSL} and during the development of it, several novel basal techniques for embedding \glspl{DSL} in \gls{FP} languages have been found.
This episode is paper based.

\Cref{chp:classy_deep_embedding} is based on the paper \emph{Deep Embedding with Class} \citep{lubbers_deep_2022}.
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\footnotemark.
\footnotetext{%
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.
}

\Cref{chp:first-class_datatypes} is based on the paper \emph{First-Class Data Types in Shallow Embedded Domain-Specific Languages} \citep{lubbers_first-class_2022}.
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}.
Besides showing the result, the paper also serves as a gentle introduction to, and contains a thorough literature study on \glsxtrlong{TH}.
%The research in this paper and writing the paper was performed by me, though there were weekly meetings with Pieter Koopman and Rinus Plasmeijer in which we discussed and refined the ideas.

\subsection{\Fullref{prt:top}}
There were many papers and revised lecture notes published on the design, implementation and usage of \gls{MTASK}.
This episode is a monograph compiled from the following publications and shows all aspects of the \gls{MTASK} system and \gls{TOP} for the \gls{IOT}.
\todo{Hier een over\-zicht van de chapters geven?}

\begin{itemize}
        \item \emph{A Task-Based \glsxtrshort{DSL} for Microcomputers} \citep{koopman_task-based_2018}.
                This 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 of the interpretations.
        \item \emph{Task Oriented Programming for the Internet of Things} \citep{lubbers_task_2018}\footnotetext{This work is an extension of my Master's thesis \citep{lubbers_task_2017}.}.
                It shows how a simple imperative variant of \gls{MTASK} was integrated with \gls{ITASK}.
                While the language was a lot different from later versions, the integration mechanism is still used in \gls{MTASK} today.
%               \paragraph{Contribution}
%               The research in this paper and writing the paper was performed by me, though there were weekly meetings with Pieter Koopman and Rinus Plasmeijer in which we discussed and refined the ideas.
        \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.}.
                This is a short paper on the multitasking capabilities of \gls{MTASK} comparing it to traditional multitasking methods for \gls{ARDUINO}.
%               \paragraph{Contribution}
%               The research in this paper and writing the paper was performed by me, though there were weekly meetings with Pieter Koopman and Rinus Plasmeijer.
        \item \emph{Simulation of a Task-Based Embedded Domain Specific Language for the Internet of Things} \citep{koopman_simulation_2018}\footnotemark[\value{footnote}].
                These revised lecture notes are from a course on the \gls{MTASK} simulator was provided at the 2018 \gls{CEFP}\slash{}\gls{3COWS} winter school in Ko\v{s}ice, Slovakia.
%               \paragraph{Contribution}
%               Pieter Koopman wrote and taught it, I helped with the software and research.
        \item \emph{Writing Internet of Things Applications with Task Oriented Programming} \citep{lubbers_writing_2019}\footnotemark[\value{footnote}].
                These revised lecture notes are from a course on programming \gls{IOT} systems using \gls{MTASK} provided at the 2019 \gls{CEFP}\slash{}\gls{3COWS} summer school in Budapest, Hungary.
%               \paragraph{Contribution}
%               Pieter Koopman prepared and taught half of the lecture and supervised the practical session.
%               I taught the other half of the lecture, wrote the lecture notes, made the assignments and supervised the practical session.
        \item \emph{Interpreting Task Oriented Programs on Tiny Computers} \citep{lubbers_interpreting_2019}.
                This paper shows an implementation of the byte code compiler and \gls{RTS} of \gls{MTASK}.
%               \paragraph{Contribution}
%               The research in this paper and writing the paper was performed by me, though there were weekly meetings with Pieter Koopman and Rinus Plasmeijer.
        \item \emph{Reducing the Power Consumption of IoT with Task-Oriented Programming} \citep{crooijmans_reducing_2022}.
                This paper 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.
%               \paragraph{Contribution}
%               The research was carried out by \citet{crooijmans_reducing_2021} during his Master's thesis.
%               I did the daily supervision and helped with the research, Pieter Koopman was the formal supervisor and wrote most of the paper.
        \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.}.
                These revised lecture notes are from a course on sustainable \gls{IOT} programming with \gls{MTASK} provided at the 2022 SusTrainable summer school in Rijeka, Croatia.

%               \paragraph{Contribution}
%               These revised lecture notes are from a course on sustainable programming using \gls{MTASK} provided at the 2022 SusTrainable summer school in Rijeka, Croatia.
%               Pieter prepared and taught a quarter of the lecture and supervised the practical session.
%               I prepared and taught the other three quarters of the lecture, made the assignments and supervised the practical session
\end{itemize}

\paragraph{Contribution:}
The original imperative predecessors of the \gls{MTASK} language and their initial interpretations were developed by Pieter Koopman and Rinus Plasmeijer.
I continued with the language; developed the byte code interpreter, the precursor to the \gls{C} code generation interpretation; the integration with \gls{ITASK}; and the \gls{RTS}.
The paper of which I am first author are solely written by me.

\subsection{\nameref{prt:tvt}}
\Cref{prt:tvt} is based on a journal paper that quantitatively and qualitatively compares traditional \gls{IOT} architectures with \gls{IOT} systems using \gls{TOP} and contains a single chapter.
This chapter is based on the journal paper: \emph{Could Tierless Programming Reduce IoT Development Grief?} \citep{lubbers_could_2022}\footnote{This work is an extension of the conference article: \emph{Tiered versus Tierless IoT Stacks: Comparing Smart Campus Software Architectures} \citep{lubbers_tiered_2020}\footnotemark.}.
\footnotetext{This work was partly funded by the 2019 Radboud-Glasgow Collaboration Fund.}
It compares programming traditional tiered architectures to tierless architectures by showing a qualitative and a quantitative four-way comparison of a smart-campus application.

\paragraph{Contribution:}
Writing the paper was performed by all authors.
I created the server application, the \gls{CLEAN}\slash{}\gls{ITASK}\slash{}\gls{MTASK} implementation (\glsxtrshort{CWS}), and the \gls{CLEAN}\slash{}\gls{ITASK} implementation (\glsxtrshort{CRS});
Adrian Ramsingh created the \gls{MICROPYTHON} implementation (\glsxtrshort{PWS}); the original \gls{PYTHON} implementation (\glsxtrshort{PRS}), and the server application were created by \citet{hentschel_supersensors:_2016}.

\input{subfilepostamble}
\end{document}