+@inproceedings{suchocki_microscheme:_2015,
+ address = {Washington DC, USA},
+ series = {{CS} {Techreport} 718},
+ title = {Microscheme: {Functional} programming for the {Arduino}},
+ booktitle = {Proceedings of the 2014 {Scheme} and {Functional} {Programming} {Workshop}},
+ publisher = {University of Indiana},
+ author = {Suchocki, Ryan and Kalvala, Sara},
+ year = {2015},
+ pages = {9},
+ file = {Suchocki and Kalvala - 2015 - Microscheme Functional programming for the Arduin.pdf:/home/mrl/.local/share/zotero/storage/DDQZ9LP7/Suchocki and Kalvala - 2015 - Microscheme Functional programming for the Arduin.pdf:application/pdf},
+}
+
@mastersthesis{crooijmans_reducing_2021,
address = {Nijmegen},
title = {Reducing the {Power} {Consumption} of {IoT} {Devices} in {Task}-{Oriented} {Programming}},
file = {Boer, de - 2020 - Secure Communication Channels for the mTask System.pdf:/home/mrl/.local/share/zotero/storage/C46E3FBF/Boer, de - 2020 - Secure Communication Channels for the mTask System.pdf:application/pdf},
}
+@phdthesis{vos_draadloze_2020,
+ address = {Den Helder},
+ type = {Bachelor's {Thesis}},
+ title = {Draadloze prestaties van de {Wemos} {D1} {Mini} {V3}},
+ language = {nl},
+ school = {Netherlandse Defensie Academie},
+ author = {Vos, W.F.T.},
+ year = {2020},
+ file = {Draadloze prestaties van de Wemos D1 Mini V3.pdf:/home/mrl/.local/share/zotero/storage/PMN5F2E7/Draadloze prestaties van de Wemos D1 Mini V3.pdf:application/pdf},
+}
+
@inproceedings{barendregt_towards_1987,
title = {Towards an intermediate language for graph rewriting},
volume = {1},
file = {barh87-Lean.ps.gz:/home/mrl/.local/share/zotero/storage/63FBHND7/barh87-Lean.ps.gz:application/gzip},
}
+@misc{johnson-davies_lisp_2020,
+ title = {Lisp for microcontrollers},
+ url = {https://ulisp.com},
+ urldate = {2020-02-14},
+ journal = {Lisp for microcontrollers},
+ author = {Johnson-Davies, David},
+ year = {2020},
+}
+
@incollection{wang_maintaining_2018,
address = {Cham},
title = {Maintaining {Separation} of {Concerns} {Through} {Task} {Oriented} {Software} {Development}},
file = {Stutterheim et al. - 2018 - Maintaining Separation of Concerns Through Task Or.pdf:/home/mrl/.local/share/zotero/storage/4GXJEM2U/Stutterheim et al. - 2018 - Maintaining Separation of Concerns Through Task Or.pdf:application/pdf},
}
+@inproceedings{steiner_firmata:_2009,
+ title = {Firmata: {Towards} {Making} {Microcontrollers} {Act} {Like} {Extensions} of the {Computer}.},
+ booktitle = {{NIME}},
+ author = {Steiner, Hans-Christoph},
+ year = {2009},
+ pages = {125--130},
+ file = {Steiner - Firmata Towards Making Microcontrollers Act Like .pdf:/home/mrl/.local/share/zotero/storage/YXMY5XHP/Steiner - Firmata Towards Making Microcontrollers Act Like .pdf:application/pdf},
+}
+
+@article{sugihara_programming_2008,
+ title = {Programming models for sensor networks: {A} survey},
+ volume = {4},
+ issn = {15504859},
+ shorttitle = {Programming models for sensor networks},
+ url = {http://portal.acm.org/citation.cfm?doid=1340771.1340774},
+ doi = {10.1145/1340771.1340774},
+ language = {en},
+ number = {2},
+ urldate = {2019-11-01},
+ journal = {ACM Transactions on Sensor Networks},
+ author = {Sugihara, Ryo and Gupta, Rajesh K.},
+ month = mar,
+ year = {2008},
+ pages = {1--29},
+ file = {Sugihara and Gupta - 2008 - Programming models for sensor networks A survey.pdf:/home/mrl/.local/share/zotero/storage/PQWX7QFD/Sugihara and Gupta - 2008 - Programming models for sensor networks A survey.pdf:application/pdf;Sugihara and Gupta - 2008 - Programming models for sensor networks A survey.pdf:/home/mrl/.local/share/zotero/storage/DP7V3EV8/Sugihara and Gupta - 2008 - Programming models for sensor networks A survey.pdf:application/pdf},
+}
+
+@article{dube_bit:_2000,
+ title = {{BIT}: {A} very compact {Scheme} system for embedded applications},
+ journal = {Proceedings of the Fourth Workshop on Scheme and Functional Programming},
+ author = {Dubé, Danny},
+ year = {2000},
+ file = {dube.ps:/home/mrl/.local/share/zotero/storage/RNG6V7HT/dube.ps:application/postscript},
+}
+
+@inproceedings{feeley_picbit:_2003,
+ title = {{PICBIT}: {A} {Scheme} system for the {PIC} microcontroller},
+ booktitle = {Proceedings of the {Fourth} {Workshop} on {Scheme} and {Functional} {Programming}},
+ publisher = {Citeseer},
+ author = {Feeley, Marc and Dubé, Danny},
+ year = {2003},
+ pages = {7--15},
+ file = {Feeley and Dubé - 2003 - PICBIT A Scheme system for the PIC microcontrolle.pdf:/home/mrl/.local/share/zotero/storage/EAEJSKNR/Feeley and Dubé - 2003 - PICBIT A Scheme system for the PIC microcontrolle.pdf:application/pdf},
+}
+
+@inproceedings{st-amour_picobit:_2009,
+ title = {{PICOBIT}: a compact scheme system for microcontrollers},
+ booktitle = {International {Symposium} on {Implementation} and {Application} of {Functional} {Languages}},
+ publisher = {Springer},
+ author = {St-Amour, Vincent and Feeley, Marc},
+ year = {2009},
+ pages = {1--17},
+ file = {St-Amour and Feeley - 2009 - PICOBIT a compact scheme system for microcontroll.pdf:/home/mrl/.local/share/zotero/storage/KXRIEPJZ/St-Amour and Feeley - 2009 - PICOBIT a compact scheme system for microcontroll.pdf:application/pdf},
+}
+
@article{barendsen_uniqueness_1996,
title = {Uniqueness typing for functional languages with graph rewriting semantics},
volume = {6},
file = {Barendsen and Smetsers - 1996 - Uniqueness typing for functional languages with gr.pdf:/home/mrl/.local/share/zotero/storage/BPRC6KJK/Barendsen and Smetsers - 1996 - Uniqueness typing for functional languages with gr.pdf:application/pdf},
}
+@incollection{bolderheij_mission-driven_2018,
+ title = {A {Mission}-{Driven} {C2} {Framework} for {Enabling} {Heterogeneous} {Collaboration}},
+ booktitle = {{NL} {ARMS} {Netherlands} {Annual} {Review} of {Military} {Studies} 2018},
+ publisher = {Springer},
+ author = {Bolderheij, F and Jansen, JM and Kool, AA and Stutterheim, J},
+ year = {2018},
+ pages = {107--130},
+ file = {Bolderheij et al. - 2018 - A Mission-Driven C2 Framework for Enabling Heterog.pdf:/home/mrl/.local/share/zotero/storage/CHDHW2TU/Bolderheij et al. - 2018 - A Mission-Driven C2 Framework for Enabling Heterog.pdf:application/pdf},
+}
+
@inproceedings{lijnse_itasks_2009,
title = {{iTasks} 2: {iTasks} for {End}-users},
booktitle = {International {Symposium} on {Implementation} and {Application} of {Functional} {Languages}},
file = {Lijnse and Plasmeijer - 2009 - iTasks 2 iTasks for End-users.pdf:/home/mrl/.local/share/zotero/storage/KACEWKXY/Lijnse and Plasmeijer - 2009 - iTasks 2 iTasks for End-users.pdf:application/pdf},
}
+@inproceedings{plasmeijer_conference_2006,
+ title = {A conference management system based on the {iData} toolkit},
+ booktitle = {Symposium on {Implementation} and {Application} of {Functional} {Languages}},
+ publisher = {Springer},
+ author = {Plasmeijer, Rinus and Achten, Peter},
+ year = {2006},
+ pages = {108--125},
+ file = {Plasmeijer and Achten - 2006 - A conference management system based on the iData .pdf:/home/mrl/.local/share/zotero/storage/D4ZXJJ22/Plasmeijer and Achten - 2006 - A conference management system based on the iData .pdf:application/pdf},
+}
+
+@inproceedings{jansen_towards_2010,
+ address = {Seattle, USA},
+ title = {Towards dynamic workflows for crisis management},
+ booktitle = {{ISCRAM} 2010 – 7th {International} {Conference} on {Information} {Systems} for {Crisis} {Response} and {Management}: {Defining} {Crisis} {Management} 3.0, {Proceedings}},
+ publisher = {Information Systems for Crisis Response and Management, ISCRAM},
+ author = {Jansen, Jan Martin and Lijnse, Bas and Plasmeijer, Rinus},
+ editor = {French, B. and Tomaszewski, C.},
+ year = {2010},
+ file = {Jansen et al. - 2010 - Towards dynamic workflows for crisis management.pdf:/home/mrl/.local/share/zotero/storage/AQSZJ3TA/Jansen et al. - 2010 - Towards dynamic workflows for crisis management.pdf:application/pdf},
+}
+
+@inproceedings{van_der_heijden_managing_2011,
+ title = {Managing {COPD} exacerbations with telemedicine},
+ booktitle = {Conference on {Artificial} {Intelligence} in {Medicine} in {Europe}},
+ publisher = {Springer},
+ author = {Van Der Heijden, Maarten and Lijnse, Bas and Lucas, Peter JF and Heijdra, Yvonne F and Schermer, Tjard RJ},
+ year = {2011},
+ pages = {169--178},
+ file = {Van Der Heijden et al. - 2011 - Managing COPD exacerbations with telemedicine.pdf:/home/mrl/.local/share/zotero/storage/AS3MPSEF/Van Der Heijden et al. - 2011 - Managing COPD exacerbations with telemedicine.pdf:application/pdf},
+}
+
+@inproceedings{lijnse_incidone:_2012,
+ title = {Incidone: {A} task-oriented incident coordination tool},
+ volume = {12},
+ booktitle = {Proceedings of the 9th {International} {Conference} on {Information} {Systems} for {Crisis} {Response} and {Management}, {ISCRAM}},
+ author = {Lijnse, Bas and Jansen, Jan Martin and Plasmeijer, Rinus and {others}},
+ year = {2012},
+ file = {Lijnse et al. - 2012 - Incidone A task-oriented incident coordination to.pdf:/home/mrl/.local/share/zotero/storage/EYS9U69B/Lijnse et al. - 2012 - Incidone A task-oriented incident coordination to.pdf:application/pdf},
+}
+
@mastersthesis{bohm_asynchronous_2019,
address = {Nijmegen},
title = {Asynchronous {Actions} in a {Synchronous} {World}},
file = {Feijs - 2013 - Multi-tasking and Arduino why and how.pdf:/home/mrl/.local/share/zotero/storage/8A3Q8LHA/Feijs - 2013 - Multi-tasking and Arduino why and how.pdf:application/pdf},
}
+@article{haenisch_case_2016,
+ title = {A case study on using functional programming for internet of things applications},
+ volume = {3},
+ number = {1},
+ journal = {Athens Journal of Technology \& Engineering},
+ author = {Haenisch, Till},
+ year = {2016},
+ file = {Haenisch - 2016 - A case study on using functional programming for i.pdf:/home/mrl/.local/share/zotero/storage/EID5EW5N/Haenisch - 2016 - A case study on using functional programming for i.pdf:application/pdf},
+}
+
@misc{achten_clean_2007,
title = {Clean for {Haskell98} {Programmers}},
url = {https://www.mbsd.cs.ru.nl/publications/papers/2007/achp2007-CleanHaskellQuickGuide.pdf},
file = {Achten - Clean for Haskell98 Programmers.pdf:/home/mrl/.local/share/zotero/storage/69WWSGLF/Achten - Clean for Haskell98 Programmers.pdf:application/pdf},
}
+@inproceedings{grebe_threading_2019,
+ address = {Cham},
+ title = {Threading the {Arduino} with {Haskell}},
+ isbn = {978-3-030-14805-8},
+ abstract = {Programming embedded microcontrollers often requires the scheduling of independent threads of execution, specifying the interaction and sequencing of actions in the multiple threads. Developing and debugging such multi-threaded systems can be especially challenging in highly resource constrained systems such as the Arduino line of microcontroller boards. The Haskino library, developed at the University of Kansas, allows programmers to develop code for Arduino-based microcontrollers using monadic Haskell program fragments. This paper describes our efforts to extend the Haskino library to translate monadic Haskell code to multi-threaded code executing on Arduino boards.},
+ booktitle = {Trends in {Functional} {Programming}},
+ publisher = {Springer International Publishing},
+ author = {Grebe, Mark and Gill, Andy},
+ editor = {Van Horn, David and Hughes, John},
+ year = {2019},
+ pages = {135--154},
+ file = {Grebe and Gill - Threading the Arduino with Haskell.pdf:/home/mrl/.local/share/zotero/storage/DW5PS9ZA/Grebe and Gill - Threading the Arduino with Haskell.pdf:application/pdf},
+}
+
@inproceedings{baccelli_reprogramming_2018,
title = {Reprogramming {Low}-end {IoT} {Devices} from the {Cloud}},
booktitle = {2018 3rd {Cloudification} of the {Internet} of {Things} ({CIoT})},
file = {Baccelli et al. - 2018 - Reprogramming Low-end IoT Devices from the Cloud.pdf:/home/mrl/.local/share/zotero/storage/M6LX5ZJN/Baccelli et al. - 2018 - Reprogramming Low-end IoT Devices from the Cloud.pdf:application/pdf},
}
+@inproceedings{wand_continuation-based_1980,
+ address = {Stanford University, California, United States},
+ title = {Continuation-based multiprocessing},
+ url = {http://portal.acm.org/citation.cfm?doid=800087.802786},
+ doi = {10.1145/800087.802786},
+ abstract = {Any multiprocessing facility must include three features: elementary exclusion, data protection, and process saving. While elementary exclusion must rest on some hardware facility (e.g., a test-and-set instruction), the other two requirements are fulfilled by features already present in applicative languages. Data protection may be obtained through the use of procedures (closures or funargs), and process saving may be obtained through the use of the catch operator. The use of catch, in particular, allows an elegant treatment of process saving.},
+ language = {en},
+ urldate = {2019-02-13},
+ booktitle = {Proceedings of the 1980 {ACM} conference on {LISP} and functional programming - {LFP} '80},
+ publisher = {ACM Press},
+ author = {Wand, Mitchell},
+ year = {1980},
+ pages = {19--28},
+ file = {Wand - 1980 - Continuation-based multiprocessing.pdf:/home/mrl/.local/share/zotero/storage/XF4Z2R9S/Wand - 1980 - Continuation-based multiprocessing.pdf:application/pdf},
+}
+
+@inproceedings{elliott_functional_1997,
+ title = {Functional reactive animation},
+ volume = {32},
+ booktitle = {{ACM} {SIGPLAN} {Notices}},
+ publisher = {ACM},
+ author = {Elliott, Conal and Hudak, Paul},
+ year = {1997},
+ pages = {263--273},
+ file = {Elliott and Hudak - 1997 - Functional reactive animation.pdf:/home/mrl/.local/share/zotero/storage/IJZLGXHK/Elliott and Hudak - 1997 - Functional reactive animation.pdf:application/pdf},
+}
+
@mastersthesis{piers_task-oriented_2016,
address = {Nijmegen},
title = {Task-{Oriented} {Programming} for developing non-distributed interruptible embedded systems},
file = {swierstra2008.pdf:/home/mrl/.local/share/zotero/storage/BEQKBXWP/swierstra2008.pdf:application/pdf},
}
-@article{groningen_exchanging_2010,
+@article{van_groningen_exchanging_2010,
title = {Exchanging sources between {Clean} and {Haskell}: {A} double-edged front end for the {Clean} compiler},
volume = {45},
shorttitle = {Exchanging sources between {Clean} and {Haskell}},
number = {11},
journal = {ACM Sigplan Notices},
- author = {Groningen, John van and Noort, Thomas van and Achten, Peter and Koopman, Pieter and Plasmeijer, Rinus},
+ author = {van Groningen, John van and van Noort, Thomas van and Achten, Peter and Koopman, Pieter and Plasmeijer, Rinus},
year = {2010},
pages = {49--60},
file = {groj10-Haskell_front_end_Clean.pdf:/home/mrl/.local/share/zotero/storage/WVZWX8WT/groj10-Haskell_front_end_Clean.pdf:application/pdf},
}
+@inproceedings{grebe_haskino:_2016,
+ title = {Haskino: {A} remote monad for programming the arduino},
+ shorttitle = {Haskino},
+ booktitle = {International {Symposium} on {Practical} {Aspects} of {Declarative} {Languages}},
+ publisher = {Springer},
+ author = {Grebe, Mark and Gill, Andy},
+ year = {2016},
+ pages = {153--168},
+ file = {Grebe-16-Haskino.pdf:/home/mrl/.local/share/zotero/storage/ABG7TTLV/Grebe-16-Haskino.pdf:application/pdf},
+}
+
@article{plasmeijer_itasks:_2007,
title = {{iTasks}: executable specifications of interactive work flow systems for the web},
volume = {42},
abstract = {We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithmic construction of programs at compile-time.The ability to generate code at compile time allows the programmer to implement such features as polytypic programs, macro-like expansion, user directed optimization (such as inlining), and the generation of supporting data structures and functions from existing data structures and functions.Our design is being implemented in the Glasgow Haskell Compiler, ghc.},
booktitle = {Proceedings of the 2002 {ACM} {SIGPLAN} {Workshop} on {Haskell}},
publisher = {Association for Computing Machinery},
- author = {Sheard, Tim and Jones, Simon Peyton},
+ author = {Sheard, Tim and Peyton Jones, Simon},
year = {2002},
note = {event-place: Pittsburgh, Pennsylvania},
keywords = {meta programming, templates},
abstract = {We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of "boilerplate" code that simply walks the structure, hiding a small amount of "real" code that constitutes the reason for the traversal.Our technique allows most of this boilerplate to be written once and for all, or even generated mechanically, leaving the programmer free to concentrate on the important part of the algorithm. These generic programs are much more adaptive when faced with data structure evolution because they contain many fewer lines of type-specific code.Our approach is simple to understand, reasonably efficient, and it handles all the data types found in conventional functional programming languages. It makes essential use of rank-2 polymorphism, an extension found in some implementations of Haskell. Further it relies on a simple type-safe cast operator.},
booktitle = {Proceedings of the 2003 {ACM} {SIGPLAN} {International} {Workshop} on {Types} in {Languages} {Design} and {Implementation}},
publisher = {Association for Computing Machinery},
- author = {Lämmel, Ralf and Jones, Simon Peyton},
+ author = {Lämmel, Ralf and Peyton Jones, Simon},
year = {2003},
note = {event-place: New Orleans, Louisiana, USA},
keywords = {generic programming, rank-2 types, traversal, type cast},
file = {Nöcker et al. - 1991 - Concurrent clean.pdf:/home/mrl/.local/share/zotero/storage/XHTNR7BR/Nöcker et al. - 1991 - Concurrent clean.pdf:application/pdf},
}
+@inproceedings{staps_lazy_2019,
+ address = {New York, NY, USA},
+ series = {{IFL} '19},
+ title = {Lazy {Interworking} of {Compiled} and {Interpreted} {Code} for {Sandboxing} and {Distributed} {Systems}},
+ isbn = {978-1-4503-7562-7},
+ doi = {10.1145/3412932.3412941},
+ abstract = {More and more applications rely on the safe execution of code unknown at compile-time, for example in the implementation of web browsers and plugin systems. Furthermore, these applications usually require some form of communication between the added code and its embedder, and hence a communication channel must be set up in which values are serialized and deserialized. This paper shows that in a functional programming language we can solve these two problems at once, if we realize that the execution of extra code is nothing more than the deserialization of a value which happens to be a function. To demonstrate this, we describe the implementation of a serialization library for the language Clean, which internally uses an interpreter to evaluate added code in a separate, sandboxed environment. Remarkable is that despite the conceptual asymmetry between "host" and "interpreter", lazy interworking must be implemented in a highly symmetric fashion, much akin to distributed systems. The library interworks on a low level with the native Clean program, but has been implemented without any changes to the native runtime system. It can therefore easily be ported to other programming languages.We can use the same technique in the context of the web, where we want to be able to share possibly lazy values between a server and a client. In this case the interpreter runs in WebAssembly in the browser and communicates seamlessly with the server, written in Clean. We use this in the iTasks web framework to handle communication and offload computations to the client to reduce stress on the server-side. Previously, this framework cross-compiled the Clean source code to JavaScript and used JSON for communication. The interpreter has a more predictable and better performance, and integration is much simpler because it interworks on a lower level with the web server.},
+ booktitle = {Proceedings of the 31st {Symposium} on {Implementation} and {Application} of {Functional} {Languages}},
+ publisher = {Association for Computing Machinery},
+ author = {Staps, Camil and van Groningen, John and Plasmeijer, Rinus},
+ year = {2019},
+ note = {event-place: Singapore, Singapore},
+ keywords = {functional programming, interpreters, laziness, sandboxing, web-assembly},
+ file = {Staps et al. - 2019 - Lazy Interworking of Compiled and Interpreted Code.pdf:/home/mrl/.local/share/zotero/storage/LGS69CH8/Staps et al. - 2019 - Lazy Interworking of Compiled and Interpreted Code.pdf:application/pdf},
+}
+
@incollection{mernik_extensible_2013,
address = {Hershey, PA, USA},
title = {Extensible {Languages}: {Blurring} the {Distinction} between {DSL} and {GPL}},
file = {Crooijmans - 2021 - Reducing the Power Consumption of IoT Devices in T.pdf:/home/mrl/.local/share/zotero/storage/YIEQ97KK/Crooijmans - 2021 - Reducing the Power Consumption of IoT Devices in T.pdf:application/pdf},
}
+@inproceedings{lijnse_capturing_2011,
+ address = {Lisbon, Portugal},
+ title = {Capturing the {Netherlands} {Coast} {Guard}'s {SAR} {Workflow} with {iTasks}},
+ language = {en},
+ booktitle = {Proceedings of the 8th {International} {ISCRAM} {Conference}},
+ author = {Lijnse, Bas and Nanne, Ruud and Jansen, Jan Martin and Plasmeijer, Rinus},
+ year = {2011},
+ pages = {10},
+ file = {Lijnse et al. - 2011 - Capturing the Netherlands Coast Guard's SAR Workfl.pdf:/home/mrl/.local/share/zotero/storage/46DHR55I/Lijnse et al. - 2011 - Capturing the Netherlands Coast Guard's SAR Workfl.pdf:application/pdf},
+}
+
@misc{wadler_expression_1998,
title = {The expression problem},
url = {https://homepages.inf.ed.ac.uk/wadler/papers/expression/expression.txt},
journal = {Journal of Cleaner Production},
author = {Nižetić, Sandro and Šolić, Petar and González-de-Artaza, Diego López-de-Ipiña and Patrono, Luigi},
year = {2020},
- keywords = {Energy, Environment, IoT, Smart city, SpliTech2020, Sustainability},
+ keywords = {IoT, Energy, Environment, Smart city, SpliTech2020, Sustainability},
pages = {122877},
}
-@inproceedings{staps_lazy_2019,
+@inproceedings{santanna_safe_2013,
+ title = {Safe system-level concurrency on resource-constrained nodes},
+ booktitle = {Proceedings of the 11th {ACM} {Conference} on {Embedded} {Networked} {Sensor} {Systems}},
+ publisher = {ACM},
+ author = {Sant'Anna, Francisco and Rodriguez, Noemi and Ierusalimschy, Roberto and Landsiedel, Olaf and Tsigas, Philippas},
+ year = {2013},
+ pages = {11},
+ file = {Sant'Anna et al. - 2013 - Safe system-level concurrency on resource-constrai.pdf:/home/mrl/.local/share/zotero/storage/4865FAU3/Sant'Anna et al. - 2013 - Safe system-level concurrency on resource-constrai.pdf:application/pdf},
+}
+
+@article{kiselyov_implementing_2011,
+ title = {Implementing {Explicit} and {Finding} {Implicit} {Sharing} in {Embedded} {DSLs}},
+ volume = {66},
+ url = {https://doi.org/10.4204/eptcs.66.11},
+ doi = {10.4204/eptcs.66.11},
+ journal = {Electronic Proceedings in Theoretical Computer Science},
+ author = {Kiselyov, Oleg},
+ month = sep,
+ year = {2011},
+ note = {Publisher: Open Publishing Association},
+ pages = {210--225},
+}
+
+@article{shi_edge_2016,
+ title = {Edge {Computing}: {Vision} and {Challenges}},
+ volume = {3},
+ doi = {10.1109/JIOT.2016.2579198},
+ number = {5},
+ journal = {IEEE Internet of Things Journal},
+ author = {Shi, Weisong and Cao, Jie and Zhang, Quan and Li, Youhuizi and Xu, Lanyu},
+ year = {2016},
+ pages = {637--646},
+ file = {Shi et al. - 2016 - Edge Computing Vision and Challenges.pdf:/home/mrl/.local/share/zotero/storage/3F2LDVWM/Shi et al. - 2016 - Edge Computing Vision and Challenges.pdf:application/pdf},
+}
+
+@article{sanchez-iborra_tinyml-enabled_2020,
+ title = {{TinyML}-{Enabled} {Frugal} {Smart} {Objects}: {Challenges} and {Opportunities}},
+ volume = {20},
+ doi = {10.1109/MCAS.2020.3005467},
+ number = {3},
+ journal = {IEEE Circuits and Systems Magazine},
+ author = {Sanchez-Iborra, Ramon and Skarmeta, Antonio F.},
+ year = {2020},
+ pages = {4--18},
+ file = {Sanchez-Iborra and Skarmeta - 2020 - TinyML-Enabled Frugal Smart Objects Challenges an.pdf:/home/mrl/.local/share/zotero/storage/G5DKVFE4/Sanchez-Iborra and Skarmeta - 2020 - TinyML-Enabled Frugal Smart Objects Challenges an.pdf:application/pdf},
+}
+
+@inproceedings{koopman_dynamic_2021,
+ address = {Cham},
+ title = {Dynamic {Editors} for {Well}-{Typed} {Expressions}},
+ isbn = {978-3-030-83978-9},
+ abstract = {Interactive systems may require complex inputs. Domain experts prefer guidance in the construction of these inputs. An ideal system prevents errors and is flexible in the construction and changes of its input. The iTask system generates web-editors given any first-order algebraic data types. The generated web-editors are useful but have their limitations. It is not possible to combine type safety with overloaded operators and preventing unbounded or ill-typed identifiers is impossible. Using phantom types, generalized algebraic datatypes or functions solves the language problems, but they cannot be handled by the datatype generic system. Moreover, changing expressions can require re-entering large parts of the input. We present dynamic editors that can solve all those problems. The programmer specifies the elements of such an editor by functions. The system shows the applicable edit elements in a drop-down menu to the user. The dynamic editor is used recursively to create the arguments for the selected function. Dynamic editors are seamlessly integrated with the ordinary web-editors of the iTask system. The obtained editors guide the users to make correct and type-safe inputs. These editors can be very flexible as well without making strange abstract syntax trees.},
+ booktitle = {Trends in {Functional} {Programming}},
+ publisher = {Springer International Publishing},
+ author = {Koopman, Pieter and Michels, Steffen and Plasmeijer, Rinus},
+ editor = {Zsók, Viktória and Hughes, John},
+ year = {2021},
+ pages = {44--66},
+ file = {Koopman et al. - 2021 - Dynamic Editors for Well-Typed Expressions.pdf:/home/mrl/.local/share/zotero/storage/H8QJCNRK/Koopman et al. - 2021 - Dynamic Editors for Well-Typed Expressions.pdf:application/pdf},
+}
+
+@inproceedings{omar_hazelnut_2017,
address = {New York, NY, USA},
- series = {{IFL} '19},
- title = {Lazy {Interworking} of {Compiled} and {Interpreted} {Code} for {Sandboxing} and {Distributed} {Systems}},
- isbn = {978-1-4503-7562-7},
- url = {https://doi.org/10.1145/3412932.3412941},
- doi = {10.1145/3412932.3412941},
- abstract = {More and more applications rely on the safe execution of code unknown at compile-time, for example in the implementation of web browsers and plugin systems. Furthermore, these applications usually require some form of communication between the added code and its embedder, and hence a communication channel must be set up in which values are serialized and deserialized. This paper shows that in a functional programming language we can solve these two problems at once, if we realize that the execution of extra code is nothing more than the deserialization of a value which happens to be a function. To demonstrate this, we describe the implementation of a serialization library for the language Clean, which internally uses an interpreter to evaluate added code in a separate, sandboxed environment. Remarkable is that despite the conceptual asymmetry between "host" and "interpreter", lazy interworking must be implemented in a highly symmetric fashion, much akin to distributed systems. The library interworks on a low level with the native Clean program, but has been implemented without any changes to the native runtime system. It can therefore easily be ported to other programming languages.We can use the same technique in the context of the web, where we want to be able to share possibly lazy values between a server and a client. In this case the interpreter runs in WebAssembly in the browser and communicates seamlessly with the server, written in Clean. We use this in the iTasks web framework to handle communication and offload computations to the client to reduce stress on the server-side. Previously, this framework cross-compiled the Clean source code to JavaScript and used JSON for communication. The interpreter has a more predictable and better performance, and integration is much simpler because it interworks on a lower level with the web server.},
- booktitle = {Proceedings of the 31st {Symposium} on {Implementation} and {Application} of {Functional} {Languages}},
+ series = {{POPL} '17},
+ title = {Hazelnut: {A} {Bidirectionally} {Typed} {Structure} {Editor} {Calculus}},
+ isbn = {978-1-4503-4660-3},
+ url = {https://doi.org/10.1145/3009837.3009900},
+ doi = {10.1145/3009837.3009900},
+ abstract = {Structure editors allow programmers to edit the tree structure of a program directly. This can have cognitive benefits, particularly for novice and end-user programmers. It also simplifies matters for tool designers, because they do not need to contend with malformed program text. This paper introduces Hazelnut, a structure editor based on a small bidirectionally typed lambda calculus extended with holes and a cursor. Hazelnut goes one step beyond syntactic well-formedness: its edit actions operate over statically meaningful incomplete terms. Naïvely, this would force the programmer to construct terms in a rigid "outside-in" manner. To avoid this problem, the action semantics automatically places terms assigned a type that is inconsistent with the expected type inside a hole. This meaningfully defers the type consistency check until the term inside the hole is finished. Hazelnut is not intended as an end-user tool itself. Instead, it serves as a foundational account of typed structure editing. To that end, we describe how Hazelnut's rich metatheory, which we have mechanized using the Agda proof assistant, serves as a guide when we extend the calculus to include binary sum types. We also discuss various interpretations of holes, and in so doing reveal connections with gradual typing and contextual modal type theory, the Curry-Howard interpretation of contextual modal logic. Finally, we discuss how Hazelnut's semantics lends itself to implementation as an event-based functional reactive program. Our simple reference implementation is written using js\_of\_ocaml.},
+ booktitle = {Proceedings of the 44th {ACM} {SIGPLAN} {Symposium} on {Principles} of {Programming} {Languages}},
publisher = {Association for Computing Machinery},
- author = {Staps, Camil and van Groningen, John and Plasmeijer, Rinus},
+ author = {Omar, Cyrus and Voysey, Ian and Hilton, Michael and Aldrich, Jonathan and Hammer, Matthew A.},
+ year = {2017},
+ note = {event-place: Paris, France},
+ keywords = {bidirectional type systems, gradual typing, mechanized metatheory, structure editors},
+ pages = {86--99},
+ file = {Omar et al. - 2017 - Hazelnut A Bidirectionally Typed Structure Editor.pdf:/home/mrl/.local/share/zotero/storage/4DNRBZ4H/Omar et al. - 2017 - Hazelnut A Bidirectionally Typed Structure Editor.pdf:application/pdf},
+}
+
+@phdthesis{serrano_type_2018,
+ type = {{PhD} {Thesis}},
+ title = {Type {Error} {Customization} for {Embedded} {Domain}-{Specific} {Languages}},
+ school = {Utrecht University},
+ author = {Serrano, Alejandro},
+ year = {2018},
+}
+
+@article{hester_batteries_2019,
+ title = {Batteries {Not} {Included}},
+ volume = {26},
+ issn = {1528-4972},
+ url = {https://doi.org/10.1145/3351474},
+ doi = {10.1145/3351474},
+ abstract = {Getting things done amid frequent power failures, batteryless intermittent research is rethinking how we build computing systems and paving the way to a sustainable and scalable digital future. The next trillion devices might be a little weird.},
+ number = {1},
+ journal = {XRDS},
+ author = {Hester, Josiah and Sorber, Jacob},
+ month = sep,
year = {2019},
- note = {event-place: Singapore, Singapore},
- keywords = {functional programming, interpreters, laziness, sandboxing, web-assembly},
- file = {Staps et al. - 2019 - Lazy Interworking of Compiled and Interpreted Code.pdf:/home/mrl/.local/share/zotero/storage/LGS69CH8/Staps et al. - 2019 - Lazy Interworking of Compiled and Interpreted Code.pdf:application/pdf},
+ note = {Place: New York, NY, USA
+Publisher: Association for Computing Machinery},
+ pages = {23--27},
+ file = {Hester and Sorber - 2019 - Batteries Not Included.pdf:/home/mrl/.local/share/zotero/storage/LT53WV8K/Hester and Sorber - 2019 - Batteries Not Included.pdf:application/pdf},
+}
+
+
+@inproceedings{koopman_executable_2011,
+ address = {Berlin, Heidelberg},
+ title = {An {Executable} and {Testable} {Semantics} for {iTasks}},
+ isbn = {978-3-642-24452-0},
+ abstract = {The iTask system is an easy to use combinator library for specifying dynamic data dependent workflows in a very flexible way. The specified workflows are executed as a multi-user web-application. The implementation of the iTask system is fairly complicated. Hence we cannot use it for reasoning about the semantics of workflows in the iTask system. In this paper we define an executable semantics that specifies how workflows react on events generated by the workers executing them. The semantics is used to explain iTask and to reason about iTask. Based on this semantics we define a mathematical notion of equivalence of tasks and show how this equivalence for tasks can be approximated automatically. Advantages of this executable semantics are: it is easy to validate the semantics by interactive simulation; properties of the semantics can be tested by our model-based test system Gþinspace∀þinspacest. Gþinspace∀þinspacest can test a large number of properties within seconds. These tests appeared to be a good indication about the consistency of the specified semantics and equivalence relation for tasks. The automatic testing of properties was very helpful in the development of the semantics. The contribution of this paper is a semantics for iTask as well as the method used to construct this operational semantics.},
+ booktitle = {Implementation and {Application} of {Functional} {Languages}},
+ publisher = {Springer Berlin Heidelberg},
+ author = {Koopman, Pieter and Plasmeijer, Rinus and Achten, Peter},
+ editor = {Scholz, Sven-Bodo and Chitil, Olaf},
+ year = {2011},
+ pages = {212--232},
+ file = {Koopman et al. - 2011 - An Executable and Testable Semantics for iTasks.pdf:/home/mrl/.local/share/zotero/storage/6LFA9MNU/Koopman et al. - 2011 - An Executable and Testable Semantics for iTasks.pdf:application/pdf},
+}
+
+@incollection{management_association_evaluating_2014,
+ address = {Hershey, PA, USA},
+ title = {Evaluating the {Usability} of {Domain}-{Specific} {Languages}},
+ isbn = {978-1-4666-4301-7},
+ url = {https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-4666-4301-7.ch098},
+ abstract = {Domain-Specific Languages (DSLs) can be regarded as User Interfaces (UIs) because they bridge the gap between the domain experts and the computation platforms. Usability of DSLs by domain experts is a key factor for their successful adoption. The few reports supporting improvement claims are persuasive, but mostly anecdotal. Systematic literature reviews show that evidences on the effects of the introduction of DSLs are actually very scarce. In particular, the evaluation of usability is often skipped, relaxed, or at least omitted from papers reporting the development of DSLs. The few exceptions mostly take place at the end of the development process, when fixing problems is already too expensive. A systematic approach, based on techniques for the experimental evaluation of UIs, should be used to assess suitability of new DSLs. This chapter presents a general experimental evaluation model, tailored for DSLs’ experimental evaluation, and instantiates it in several DSL’s evaluation examples.},
+ booktitle = {Software {Design} and {Development}: {Concepts}, {Methodologies}, {Tools}, and {Applications}},
+ publisher = {IGI Global},
+ author = {Barišic, Ankica and Amaral, Vasco and Goulão, Miguel and Barroca, Bruno},
+ editor = {Management Association, Information Resources},
+ year = {2014},
+ doi = {10.4018/978-1-4666-4301-7.ch098},
+ pages = {2120--2141},
+ file = {Barišic et al. - 2014 - Evaluating the Usability of Domain-Specific Langua.pdf:/home/mrl/.local/share/zotero/storage/ARTGSHZK/Barišic et al. - 2014 - Evaluating the Usability of Domain-Specific Langua.pdf:application/pdf},
+}
+
+@article{van_der_aalst_workflow_2003,
+ title = {Workflow {Patterns}},
+ volume = {14},
+ issn = {1573-7578},
+ url = {https://doi.org/10.1023/A:1022883727209},
+ doi = {10.1023/A:1022883727209},
+ abstract = {Differences in features supported by the various contemporary commercial workflow management systems point to different insights of suitability and different levels of expressive power. The challenge, which we undertake in this paper, is to systematically address workflow requirements, from basic to complex. Many of the more complex requirements identified, recur quite frequently in the analysis phases of workflow projects, however their implementation is uncertain in current products. Requirements for workflow languages are indicated through workflow patterns. In this context, patterns address business requirements in an imperative workflow style expression, but are removed from specific workflow languages. The paper describes a number of workflow patterns addressing what we believe identify comprehensive workflow functionality. These patterns provide the basis for an in-depth comparison of a number of commercially availablework flow management systems. As such, this paper can be seen as the academic response to evaluations made by prestigious consulting companies. Typically, these evaluations hardly consider the workflow modeling language and routing capabilities, and focus more on the purely technical and commercial aspects.},
+ number = {1},
+ journal = {Distributed and Parallel Databases},
+ author = {van der Aalst, W.M.P. and ter Hofstede, A.H.M. and Kiepuszewski, B. and Barros, A.P.},
+ month = jul,
+ year = {2003},
+ pages = {5--51},
+ file = {van der Aalst et al. - 2003 - Workflow Patterns.pdf:/home/mrl/.local/share/zotero/storage/WXP2T4R7/van der Aalst et al. - 2003 - Workflow Patterns.pdf:application/pdf},
}
repositories / phd-thesis.git / blobdiff