1 \documentclass[../thesis.tex
]{subfiles
}
3 \input{subfilepreamble
}
7 \label{chp:introduction
}
8 \begin{chapterabstract
}
11 \item introduces the topic and research ventures of this dissertation;
12 \item shows a reading guide;
13 \item provides background material on the
\glsxtrlong{IOT
},
\glsxtrlongpl{DSL
},
\glsxtrlong{TOP
},
\gls{ITASK
}, and
\gls{MTASK
}.
14 \item and concludes with a detailed overview of the contributions.
18 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}}
19 Each and every one of those devices senses, acts, or otherwise interacts with people, other computers, and the environment surrounding us.
20 Even though there is a substantial variety among these devices, they have one thing in common: they are all computers to some degree and hence require software to operate.
22 An increasing amount of these connected devices are so-called
\emph{edge devices
} that operate in the
\gls{IOT
}.
23 Typically, these edge devices are powered by microcontrollers.
24 Said microcontrollers contain integrated circuits accommodating a microprocessor designed for use in embedded applications.
25 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 to interact with their surroundings.
29 % \includegraphics[width=.4\linewidth]{esp}
30 % \caption{A typical ESP32 microcontroller prototyping board.}%
31 % \label{fig:esp_prototype}
34 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.
35 Programming and maintaining
\gls{IOT
} systems is therefore a very complex and an error-prone process.
37 This thesis describes the research carried out around taming these complex
\gls{IOT
} systems using
\gls{TOP
}.
38 \Gls{TOP
} is an innovative tierless programming paradigm for programming multi-tier interactive systems using a single declarative specification of the work that needs to be done.
39 By utilising advanced compiler technologies, much of the internals, communication, and interoperation of the multi-tiered applications is automatically generated.
40 The result of this compilation is a ready-for-work application.
41 Unfortunately, because the abstraction level is so high, the hardware requirements are too excessive for a general purpose
\gls{TOP
} system to be suitable for the average edge device.
43 This is where
\glspl{DSL
} are brought into play.
44 \Glspl{DSL
} are programming languages created with a specific domain in mind.
45 Consequently, jargon does not have to be expressed in the language itself, but they can be built-in features.
46 As a result, the hardware requirements can be drastically lower, even with high levels of abstraction.
48 Using
\gls{MTASK
}, a novel domain-specific
\gls{TOP
} \gls{DSL
} fully integrated with
\gls{ITASK
}, all layers of the
\gls{IOT
} can be orchestrated from a single source.
49 \todo[inline
]{uitbreiden
}
51 \section{Reading guide
}
52 The thesis is structured as a purely functional rhapsody.
53 On Wikipedia, a musical rhapsody is defined as follows
\citep{wikipedia_contributors_rhapsody_2022
}:
55 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.
}
57 The three episodes in this thesis are barded by the introduction and conclusion (
\cref{chp:introduction,chp:conclusion
}).
58 \Cref{prt:dsl
} is a paper-based---otherwise known as cumulative---episode providing insights in advanced
\gls{DSL
} embedding techniques for
\gls{FP
} languages.
59 The chapters are readable independently.
60 \Cref{prt:top
} is a monograph showing
\gls{MTASK
}, a
\gls{TOP
} \gls{DSL
} for the
\gls{IOT
}.
61 Hence, the chapters are best read in order.
62 \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.
63 The chapter is readable independently.
65 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.
66 Text typeset as
\texttt{teletype
} represents source code.
67 Standalone source code listings are marked by the programming language used.
68 Specifically for the
\gls{FP
} language
\gls{CLEAN
}, a guide tailored to
\gls{HASKELL
} programmers is available in
\cref{chp:clean_for_haskell_programmers
}.
70 \section{\texorpdfstring{\Glsxtrlong{IOT
}}{Internet of things
}}\label{sec:back_iot
}
71 The
\gls{IOT
} is growing rapidly and it is changing the way people and machines interact with the world.
72 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
}:
75 \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.
}
78 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
}.
79 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.
80 These connected devices are already in households all around us in the form of smart electricity meters, fridges, phones, watches, home automation,
\etc.
82 When describing
\gls{IOT
} systems, a tiered---or layered---architecture is often used for compartmentalisation.
83 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.
87 \includestandalone{iot-layers
}
88 \caption{A layered
\gls{IOT
} architecture.
}%
89 \label{fig:iot-layers
}
92 To explain the tiers, an example
\gls{IOT
} application---home automation---is dissected accordingly.
93 Closest to the end-user is the presentation layer, it provides the interface between the user and the
\gls{IOT
} system.
94 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.
96 The application layer provides the
\glspl{API
}, data interfaces, data processing, and data storage of the
\gls{IOT
} system.
97 A cloud server or local server provides this layer in a typical home automation application.
99 The perception layer---also called edge layer---collects the data and interacts with the environment.
100 It consists of edge devices such as microcontrollers equipped with various sensors and actuators.
101 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.
103 All layers are connected using the network layer.
104 In some applications this is implemented using conventional networking techniques such as WiFi or Ethernet.
105 However, networks or layers on top of it---tailored to the needs of the specific interconnection between layers---have been increasingly popular.
106 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.
108 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
}.
109 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.
110 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.
111 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.
112 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.
113 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.
115 These problems can be mitigated by dynamically sending code to be interpreted to the microcontroller.
116 With interpretation, a specialized interpreter is flashed in the program memory once that receives the program code to execute at runtime.
117 Interpretation always comes with an overhead, making it challenging to create them for small edge devices.
118 However, the hardware requirements can be reduced by embedding domain-specific data into the programming language to be interpreted, so called
\glspl{DSL
}.
120 \section{\texorpdfstring{\Glsxtrlongpl{DSL
}}{Domain-specific languages
}}\label{sec:back_dsl
}
122 Programming languages can be divided up into two categories:
\glspl{DSL
}\footnote{Historically this has been called DSEL as well.
} and
\glspl{GPL
} \citep{fowler_domain_2010
}.
123 Where
\glspl{GPL
} are not made with a demarcated area in mind,
\glspl{DSL
} are tailor-made for a specific domain.
124 Writing idiomatic domain-specific code in an
\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.
125 \Glspl{DSL
} come in two main flavours: standalone and embedded (
\cref{sec:standalone_embedded
})
\footnote{Also called external and internal respectively.
} of which
\glspl{EDSL
} can again be classified into heterogeneous and homogeneous languages (
\cref{sec:hetero_homo
}).
126 This hyponymy is shown in
\cref{fig:hyponymy_of_dsls
}.
130 \includestandalone{hyponymy_of_dsls
}
131 \caption{Hyponymy of
\glspl{DSL
} (adapted from
\citet[\citepage{2}]{mernik_extensible_2013
})
}%
132 \label{fig:hyponymy_of_dsls
}
135 \subsection{Standalone and embedded
}\label{sec:standalone_embedded
}
136 \glspl{DSL
} where historically created as standalone languages, meaning all the machinery is developed solely for the language.
137 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.
138 Unfortunately it also means that they need to develop a compiler or interpreter for the language to be usable making standalone
\glspl{DSL
} costly to create.
139 Examples of standalone
\glspl{DSL
} are regular expressions, make, yacc, XML, SQL,
\etc.
141 The dichotomous approach is embedding the
\gls{DSL
} in a host language, i.e.\
\glspl{EDSL
} \citep{hudak_modular_1998
}.
142 By defining the language as constructs in the host language, much of the machinery is inherited and the cost of creating embedded languages is very low.
143 There is more linguistic reuse
\citep{krishnamurthi_linguistic_2001
}.
144 However, there are two sides to this coin.
145 If the syntax of the host language is not very flexible, the syntax of the
\gls{DSL
} may become clumsy.
146 Furthermore, 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
}.
147 Pure
\gls{FP
} languages are especially suitable for hosting embedded
\glspl{DSL
} because they have strong and versatile type systems, minimal but flexible syntax and offer referential transparency.
149 \subsection{Heterogeneity and homogeneity
}\label{sec:hetero_homo
}
150 \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:
154 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.
158 Homogeneous
\glspl{EDSL
} are therefore languages that are solely defined as an extension to their host language.
159 They often restrict features of the host language to provide a safer interface or capture an idiomatic pattern in the host language for reuse.
160 The difference between a library and a homogeneous
\glspl{EDSL
} is not always clear.
161 Examples of homogeneous
\glspl{EDSL
} are libraries such as ones for sets,
\glspl{GUI
} creation, LISP's macro system,
\etc.
163 On the other hand, heterogeneous
\glspl{EDSL
} are languages that are not executed in the host language.
164 For example,
\citep{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.
165 In fact,
\gls{ITASK
} and
\gls{MTASK
} are both heterogeneous
\glspl{EDSL
} and
\gls{MTASK
} specifically is a compiling
\gls{DSL
}.
167 \section{\texorpdfstring{\Glsxtrlong{TOP
}}{Task-oriented programming
}}\label{sec:back_top
}
168 \Gls{TOP
} is a declarative programming paradigm designed to model interactive systems
\citep{plasmeijer_task-oriented_2012
}.
169 \Citet{steenvoorden_tophat_2022
} defines two instruments for
\gls{TOP
}:
\gls{TOP
} languages and
\gls{TOP
} engines.
170 A
\gls{TOP
} language is the language to specify interactive systems.
171 A
\gls{TOP
} engine is software or hardware that executes such a specification as a ready-for-work application.
172 Instead of dividing problems into
\gls{LSOC
} it deals with separation of concerns in a novel way.
173 From the data types, utilising various
\emph{type-parametrised
} concepts, all other aspects are handled automatically (see
\cref{fig:tosd
}).
174 This approach to software development is called
\gls{TOSD
} \citep{wang_maintaining_2018
}.
178 \begin{subfigure
}[t
]{.5\textwidth}
180 \includestandalone{traditional
}
181 \caption{\Gls{LSOC
} approach.
}
183 \begin{subfigure
}[t
]{.5\textwidth}
185 \includestandalone{tosd
}
186 \caption{\Gls{TOSD
} approach.
}
188 \caption{Separation of concerns in a traditional setting and in
\gls{TOSD
} (adapted from~
\cite[\citepage{20}]{wang_maintaining_2018
}).
}%
193 \item[\Glsxtrshort{UI
} (presentation layer):
]
194 The
\gls{UI
} of the system is automatically generated from the representation of the type.
195 Even though the
\gls{UI
} is generated from the structure of the datatypes, in practical
\gls{TOP
} systems it can be tweaked afterwards to suit the specific needs of the application.
196 \item[Tasks (business layer):
]
197 A task is an abstract representation of a piece of work that needs to be done.
198 It provides an intuitive abstraction over work in the real world.
199 Just as with real-life tasks and workflow, tasks can be combined in various ways such as in parallel or in sequence.
200 Furthermore, a task is observable which means it is possible to observe a---partial---result during execution and act upon it by for example starting new tasks.
201 Examples of tasks are filling in a form, sending an email, reading a sensor or even doing a physical task.
202 \item[\Glsxtrshortpl{SDS
} (resource access):
]
203 Tasks can communicate using task values, some collaboration require tasks that are not necessarily related need to share data.
204 Hence, tasks can also share data using
\glspl{SDS
}, an abstraction over any data.
205 An
\gls{SDS
} can represent typed data stored in a file, a chunk of memory, a database
\etc.
206 \Glspl{SDS
} can also represent external impure data such as the time, random numbers or sensory data.
207 Similar to tasks, transformation and combination of
\glspl{SDS
} is possible.
208 \item[Programming language (
\glsxtrshort{UOD
}):
]
209 The
\gls{UOD
} from the business layer is explicitly and separately modelled by the relations that exist in the functions of the host language.
212 There are two ways of looking at this model when also incorporating edge devices for
\gls{IOT
} systems.
213 Firstly, edge devices can be seen as simple resources, thus accessed through the resource access layer.
214 Secondly, edge devices are miniature
\gls{LSOC
} systems in itself as well.
215 In
\gls{TOSD
} the same can be applied.
216 The individual components in the miniature systems, the tasks, the
\glspl{SDS
}, are connected to the other systems.
218 \subsection{\texorpdfstring{\Gls{ITASK
}}{ITask
}}
219 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
}.
220 From the structural properties of the data types, the entire user interface is automatically generated.
222 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 a person.
223 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.
224 Using task combinators (see
\cleaninline{>>!
} at
\cref{lst:task_comb
}), the tasks can be combined in sequence.
225 Only when the user entered a complete value in the web editor, then the continue button enables and the result can be viewed.
226 Special combinators (e.g.\
\cleaninline{@>>
} at
\cref{lst:task_ui
}) are available to tweak the
\gls{UI
} afterwards.
229 \includegraphics[width=
.325\linewidth]{person0g
}
230 \includegraphics[width=
.325\linewidth]{person1g
}
231 \includegraphics[width=
.325\linewidth]{person2g
}
232 \caption{The
\gls{UI
} for entering a person in
\gls{ITASK
}.
}%
233 \label{fig:enter_person
}
236 \begin{lstClean
}[numbers=left,caption=
{The
\gls{UI
} and code for entering a person in
\gls{ITASK
}.
},label=
{lst:enter_person
}]
237 :: Person =
{ name :: String, gender :: Gender, dateOfBirth :: Date
}[+
\label{lst:dt_fro
}+
]
238 :: Gender = Male | Female | Other String
[+
\label{lst:dt_to
}+
]
240 derive class iTask Person, Gender
[+
\label{lst:dt_derive
}+
]
242 enterPerson :: Task Person
244 = Hint "Enter a person:" @>> enterInformation
[][+
\label{lst:task_ui
}+
]
245 >>!
\result->Hint "You Entered:" @>> viewInformation
[] result
[+
\label{lst:task_comb
}+
]
248 Functional languages are excellent hosts for
\gls{TOP
} language
249 \Gls{ITASK
} is embedded in a functional language
251 \subsection{\texorpdfstring{\Gls{MTASK
}}{MTask
}}
252 This thesis uses
\gls{ITASK
} in conjunction with
\gls{MTASK
}, an innovative
\gls{TOP
} language designed for defining interactive systems for
\gls{IOT
} edge devices
\citep{koopman_task-based_2018
}.
253 Where
\gls{ITASK
} abstracts away from details such as user interfaces, data storage, client-side platforms, and persistent workflows.
254 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.
255 The
\gls{MTASK
} language is written in
\gls{CLEAN
} as a multi-view
\gls{EDSL
} and hence there are multiple interpretations of the language of which the byte code compiler is the most relevant for this thesis.
256 From
\gls{MTASK
} term constructed at runtime, a very compact binary representation of the work that needs to be done is compiled.
257 This byte code is then sent to a device that running the
\gls{MTASK
} \gls{RTS
}, a domain-specific
\gls{TOP
} engine implemented as a feather-light domain-specific
\gls{OS
}.
258 \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
}.
259 Using
\gls{MTASK
}, the programmer defines all layers of an
\gls{IOT
} system as a single declarative specification.
261 \todo[inline
]{Is this example useful? I think it's too technical
}
262 \Cref{lst:intro_blink
} shows an interactive
\gls{MTASK
}\slash{}\gls{ITASK
} application for blinking
\pgls{LED
} on the microcontroller every user-specified interval.
263 \Crefrange{lst:intro:itask_fro
}{lst:intro:itask_to
} show the
\gls{ITASK
} part.
264 First a
\gls{SDS
} is defined to communicate the blinking interval, then the
\gls{MTASK
} is connected using
\cleaninline{withDevice
}.
265 Once connected, the
\cleaninline{intBlink
} task is sent to the device (
\cref{lst:intro_liftmtask
}) and in parallel, the value of the interval
\gls{SDS
} can be updated using an editor (
\cref{lst:intro_editor
}).
266 The
\cleaninline{intBlink
} task (
\crefrange{lst:intro:mtask_fro
}{lst:intro:mtask_to
}) is the
\gls{MTASK
} part of the application that has its own tasks,
\glspl{SDS
}, and
\gls{UOD
}.
267 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
}).
268 The main expression of the program calls the
\cleaninline{blink
} function with the initial state.
269 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.
271 \begin{lstClean
}[numbers=left,caption=
{\Gls{MTASK
}\slash{}\gls{ITASK
} interactive blinking.
},label=
{lst:intro_blink
}]
272 interactiveBlink :: Task Int
[+
\label{lst:intro:itask_fro
}+
]
274 withShared
500 \iInterval->
[+
\label{lst:intro_withshared
}+
]
275 withDevice
{TCPSettings | host = ..., port = ...
} \dev->
276 liftmTask (intBlink iInterval) dev
[+
\label{lst:intro_liftmtask
}+
]
277 -|| Hint "Interval (ms)" @>> updateSharedInformation
[] iInterval
[+
\label{lst:intro_editor
}+
][+
\label{lst:intro:itask_to
}+
]
279 intBlink :: Shared sds Int -> MTask v Int | mtask, liftsds v & RWShared sds
[+
\label{lst:intro:mtask_fro
}+
]
281 declarePin D13 PMOutput
\d13->
[+
\label{lst:intro:declarePin
}+
]
282 liftsds
\mInterval=iInterval
[+
\label{lst:intro:liftsds
}+
]
283 In fun
\blink=(
\st->
[+
\label{lst:intro:blink_fro
}+
]
284 getSds mInterval >>=.
\i->delay i
285 >>|. writeD d13 st >>|. blink (Not st))
[+
\label{lst:intro:blink_to
}+
]
286 In
{main = blink true
}[+
\label{lst:intro:mtask_to
}+
]
289 \subsection{Other
\texorpdfstring{\glsxtrshort{TOP
}}{TOP
} languages
}
290 While
\gls{ITASK
} conceived
\gls{TOP
}, it is not the only
\gls{TOP
} language and engine.
291 Some
\gls{TOP
} languages and systems arose from Master's and Bachelor's thesis projects (e.g.\
\textmu{}Task
\citep{piers_task-oriented_2016
} and LTasks
\citep{van_gemert_task_2022
}) or were created to solve a practical problem (e.g.\ Toppyt
\citep{lijnse_toppyt_2022
} and hTask
\citep{lubbers_htask_2022
}).
292 Furthermore,
\gls{TOPHAT
} is a fully formally specified
\gls{TOP
} language designed to capture the essence of
\gls{TOP
} formally
\citep{steenvoorden_tophat_2019
}.
293 It is also possible to translate
\gls{TOPHAT
} code to
\gls{ITASK
} to piggyback on the
\gls{TOP
} engine it offers
\citep[\citesection{G
.3}]{steenvoorden_tophat_2022
}.
295 \section{Contributions
}\label{sec:contributions
}
296 This section provides a thorough overview of the relation to publications and the scientific contributions of the episodes and chapters.
298 \subsection{\Fullref{prt:dsl
}}
299 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.
300 This episode is a paper based episodes on these techniques.
302 \Cref{chp:classy_deep_embedding
} is based on the paper
\emph{Deep Embedding with Class
} \citep{lubbers_deep_2022
}.
303 While supervising
\citeauthor{amazonas_cabral_de_andrade_developing_2018
}'s
\citeyear{amazonas_cabral_de_andrade_developing_2018
} Master's thesis, focussing on an early version of
\gls{MTASK
}, a seed was planted for a novel deep embedding technique for
\glspl{DSL
} where the resulting language is extendible both in constructs and in interpretation using type classes and existential data types.
304 Slowly the ideas organically grew to form the technique shown in the paper.
305 The related work section is updated with the research found only after publication.
306 \Cref{sec:classy_reprise
} was added after publication and contains a (yet) unpublished extension of the embedding technique for reducing the required boilerplate.
308 \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
}.
309 It shows how to inherit data types from the host language in
\glspl{EDSL
} using metaprogramming.
310 It does so by providing a proof-of-concept implementation using
\gls{HASKELL
}'s metaprogramming system:
\glsxtrlong{TH
}.
311 Besides showing the result, the paper also serves as a gentle introduction to using
\glsxtrlong{TH
} and contains a thorough literature study on research that uses
\glsxtrlong{TH
}.
312 %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.
314 \subsection{\nameref{prt:top
}}
315 This is a monograph compiled from the following papers and revised lecture notes on
\gls{MTASK
}, the
\gls{TOP
} system used to orchestrate the
\gls{IOT
}.
316 It provides a gentle introduction to the
\gls{MTASK
} system elaborates on
\gls{TOP
} for the
\gls{IOT
}.
319 \item \emph{A Task-Based
\glsxtrshort{DSL
} for Microcomputers
} \citep{koopman_task-based_2018
}.
321 This is the initial
\gls{TOP
}/
\gls{MTASK
} paper.
322 It provides an overview of the initial
\gls{TOP
} \gls{MTASK
} language and shows first versions of a pretty printer, an
\gls{ITASK
} simulation and a
\gls{C
} code generation view.
323 \item \emph{Task Oriented Programming for the
\glsxtrlong{IOT
}} \citep{lubbers_task_2018
}.
325 This paper was an extension of my Master's thesis
\citep{lubbers_task_2017
}.
326 It shows how a simple imperative variant of
\gls{MTASK
} was integrated with
\gls{ITASK
}.
327 While the language was a lot different from later versions, the integration mechanism is still used in
\gls{MTASK
} today.
328 % \paragraph{Contribution}
329 % 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.
330 \item \emph{Multitasking on Microcontrollers using Task Oriented Programming
} \citep{lubbers_multitasking_2019
}.
\footnote{%
331 This work acknowledges the support of the ERASMUS+ project ``Focusing Education on Composability, Comprehensibility and Correctness of Working Software'', no.
2017--
1--SK01--KA203--
035402
334 This paper was a short paper on the multitasking capabilities of
\gls{MTASK
} in contrast to traditional multitasking methods for
\gls{ARDUINO
}.
335 % \paragraph{Contribution}
336 % The research in this paper and writing the paper was performed by me, though there were weekly meetings with Pieter Koopman and Rinus Plasmeijer.
337 \item \emph{Simulation of a Task-Based Embedded Domain Specific Language for the Internet of Things
} \citep{koopman_simulation_2018
}.
\footnotemark[\value{footnote
}]
339 These revised lecture notes are from a course on the
\gls{MTASK
} simulator was provided at the
2018 \gls{CEFP
}/
\gls{3COWS
} winter school in Ko
\v{s
}ice, Slovakia.
340 % \paragraph{Contribution}
341 % Pieter Koopman wrote and taught it, I helped with the software and research.
342 \item \emph{Writing Internet of Things Applications with Task Oriented Programming
} \citep{lubbers_writing_2019
}.
\footnotemark[\value{footnote
}]
344 These revised lecture notes are from a course on programming in
\gls{MTASK
} provided at the
2019 \gls{CEFP
}/
\gls{3COWS
} summer school in Budapest, Hungary.
345 % \paragraph{Contribution}
346 % Pieter Koopman prepared and taught half of the lecture and supervised the practical session.
347 % I taught the other half of the lecture, wrote the lecture notes, made the assignments and supervised the practical session.
348 \item \emph{Interpreting Task Oriented Programs on Tiny Computers
} \citep{lubbers_interpreting_2019
}.
350 This paper shows an implementation for
\gls{MTASK
} for microcontrollers in the form of a compilation scheme and informal semantics description.
351 % \paragraph{Contribution}
352 % The research in this paper and writing the paper was performed by me, though there were weekly meetings with Pieter Koopman and Rinus Plasmeijer.
353 \item \emph{Reducing the Power Consumption of IoT with Task-Oriented Programming
} \citep{crooijmans_reducing_2022
}.
355 This paper shows how to create a scheduler so that devices running
\gls{MTASK
} tasks can go to sleep more automatically.
356 % \paragraph{Contribution}
357 % The research was carried out by \citet{crooijmans_reducing_2021} during his Master's thesis.
358 % I did the daily supervision and helped with the research, Pieter Koopman was the formal supervisor and wrote most of the paper.
359 \item \emph{Green Computing for the Internet of Things
} \citep{lubbers_green_2022
}.
\footnote{
360 This work acknowledges the support of the Erasmus+ project ``SusTrainable---Promoting Sustainability as a Fundamental Driver in Software Development Training and Education'', no.
2020--
1--PT01--KA203--
078646}
362 These revised lecture notes are from a course on sustainable
\gls{IOT
} programming in
\gls{MTASK
} provided at the
2022 SusTrainable summer school in Rijeka, Croatia.
364 % \paragraph{Contribution}
365 % These revised lecture notes are from a course on sustainable programming using \gls{MTASK} provided at the 2022 SusTrainable summer school in Rijeka, Croatia.
366 % Pieter prepared and taught a quarter of the lecture and supervised the practical session.
367 % I prepared and taught the other three quarters of the lecture, made the assignments and supervised the practical session
370 \paragraph{Contribution:
}
371 The original imperative predecessors the
\gls{MTASK
} language and their initial interpretations were developed by Pieter Koopman and Rinus Plasmeijer.
372 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
}.
373 The paper of which I am first author are written by me.
375 \subsection{\nameref{prt:tvt
}}
376 \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.
377 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{}}
378 \footnotetext{This paper was partly funded by the Radboud-Glasgow Collaboration Fund.
}
380 It compares programming traditional tiered architectures to tierless architectures by showing a qualitative and a quantitative four-way comparison of a smart-campus application.
382 \paragraph{Contribution:
}
383 Writing the paper was performed by all authors.
384 I created the server application, the
\gls{CLEAN
}/
\gls{ITASK
}/
\gls{MTASK
} implementation (
\glsxtrshort{CWS
}) and the
\gls{CLEAN
}/
\gls{ITASK
} implementation (
\glsxtrshort{CRS
})
385 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
}.
387 \input{subfilepostamble
}
repositories / phd-thesis.git / blob