language = {English},
urldate = {2021-02-24},
publisher = {Release},
- author = {GHC Team},
+ author = {{GHC Team}},
year = {2021},
file = {GHC Team - 2021 - GHC User’s Guide Documentation.pdf:/home/mrl/.local/share/zotero/storage/87ZT5VXL/GHC Team - 2021 - GHC User’s Guide Documentation.pdf:application/pdf},
}
language = {English},
urldate = {2021-02-24},
publisher = {Release},
- author = {GHC Team},
+ author = {{GHC Team}},
year = {2021},
}
keywords = {IoT, Energy, Environment, Smart city, SpliTech2020, Sustainability},
pages = {122877},
}
+
+@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 = {{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 = {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 = {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