Staging with class: a specification for typed template Haskell

Xie, Ningning; Pickering, Matthew C.; Löh, Andres; Wu, Nicolas; Yallop, Jeremy; Wang, Meng

doi:10.1145/3498723

Cited by 7 publications

(2 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Typed Template Haskell (TTH) is a very recent extension/alternative to normal TH (Pickering et al, 2019;Xie et al, 2022). Whereas in TH you can manipulate arbitrary parts of the syntax tree, add top-level splices of data types, definitions and functions, in TTH the programmer can only splice expressions but the AST fragments representing the expressions are well-typed by construction instead of untyped.…”

Section: Typed Template Haskellmentioning

confidence: 99%

Orchestrating the Internet of Things with Task-Oriented Programming

Lubbers

2023

View full text Add to dashboard Cite

The development of reliable software for the internet of things (IoT) is difficult because IoT systems are dynamic, interactive, distributed, collaborative, multi-tiered, and multitasking in nature. The complexity is increased further by semantic friction that arises through different hardware and software characteristics between tiers. Many computers that operate in IoT systems are edge devices that interact with the environment using sensors and actuators. Edge devices are often powered by low-cost microcontrollers designed for embedded applications. They have little memory, unhurried processors, and are slow in communication but are also small and energy efficient. Task-oriented programming (TOP) can cope with the challenges of IoT programming. In TOP, the main building blocks are tasks, an abstract representation of work. During execution, the current value of the task is observable, and other tasks can act upon it. Collaboration patterns can be modelled by combining and transforming tasks into compound tasks. Programming edge devices benefits from TOP as well, but running such a system within the limitations of resource-constrained microcontrollers is not straightforward. This dissertation demonstrates how to include edge devices in TOP systems using domain-specific languages (DSLs). With these techniques, all tiers and their interoperation of an IoT system are specified in a single high-level source, language, paradigm, high abstraction level, and type system. First, I present advanced DSL embedding techniques. Then mTask is shown, a TOP DSL for IoT edge devices, embedded in iTask. Tasks are constructed and compiled at run time in order to allow tasks to be tailored to the current work requirements. The task is then sent to the device for interpretation. A device is programmed once with a lightweight domain-specific OS to be used in an mTask system. This OS executes tasks in an energy-efficient way and automates all communications and data sharing. All aspects of the mTask system are shown: example applications, language design, implementation details, integration with iTask, and green computing facilities such as automatic sleeping. Finally, tierless IoT programming is compared to traditional tiered programming. In tierless programming frameworks, the size of the code and the number of required programming languages is reduced significantly. By using a single paradigm and a system-wide type system, tierless programming reduces problems such as semantic friction; maintainability and robustness issues; and interoperation safety.

show abstract

Section: Typed Template Haskellmentioning

confidence: 99%

Orchestrating the Internet of Things with Task-Oriented Programming

Lubbers

2023

View full text Add to dashboard Cite

show abstract

“…Our notation for quoting and splicing is borrowed from MetaML [Taha and Sheard 2000]. In the following, we compare 2LTT to MetaML, MetaOCaml [Kiselyov 2014] and typed Template Haskell [Xie et al 2022].…”

Section: Related Workmentioning

confidence: 99%

Staged compilation with two-level type theory

Kovács

2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

The aim of staged compilation is to enable metaprogramming in a way such that we have guarantees about the well-formedness of code output, and we can also mix together object-level and meta-level code in a concise and convenient manner. In this work, we observe that two-level type theory (2LTT), a system originally devised for the purpose of developing synthetic homotopy theory, also serves as a system for staged compilation with dependent types. 2LTT has numerous good properties for this use case: it has a concise specification, well-behaved model theory, and it supports a wide range of language features both at the object and the meta level. First, we give an overview of 2LTT's features and applications in staging. Then, we present a staging algorithm and prove its correctness. Our algorithm is "staging-by-evaluation", analogously to the technique of normalization-by-evaluation, in that staging is given by the evaluation of 2LTT syntax in a semantic domain. The staging algorithm together with its correctness constitutes a proof of strong conservativity of 2LLT over the object theory. To our knowledge, this is the first description of staged compilation which supports full dependent types and unrestricted staging for types.

show abstract

Layered Modal Type Theory

Hu,

Pientka

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We introduce layering to modal type theory to combine type theory with intensional analysis. In particular, we demonstrate this idea by developing a 2-layered modal type theory. At the core of this type theory (layer 0) is a simply typed $$\lambda $$ λ -calculus with no modality. Layer 1 is obtained by extending the core language with one layer of contextual $$\square $$ □ types to support pattern matching on potentially open code from layer 0 while retaining normalization. Although both layers fundamentally share the same language and the same typing judgment, we only allow computation at layer 1. As a consequence, layer 0 accurately captures the syntactic representation of code in contrast to the computational behaviors at layer 1. The system is justified by normalization by evaluation (NbE) using a presheaf model. The normalization algorithm extracted from the model is sound and complete and is implemented in Agda.Layered modal type theory provides a uniform foundation for meta-programming with intensional analysis. We see this work as an important step towards a foundational way to support meta-programming in proof assistants.

show abstract

Staging with class: a specification for typed template Haskell

Cited by 7 publications

References 46 publications

Orchestrating the Internet of Things with Task-Oriented Programming

Orchestrating the Internet of Things with Task-Oriented Programming

Staged compilation with two-level type theory

Layered Modal Type Theory

Contact Info

Product

Resources

About