Domain specific embedded compilers

LeijenDaan,; MeijerErik,

doi:10.1145/331963.331977

Cited by 30 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem is that there is overhead in the shallow embedding and by using static analysis this could be removed, but there is no structure left to inspect. In contrast, in a deep embedding the operations of the language are themselves just syntax: this allows for inspection and semantics are provided by interpretation [Gibbons and Wu 2014;Leijen and Meijer 1999]. The advantage of deep-embedded DSLs is that it is now possible to use the domain knowledge of the language to perform analysis and optimisation.…”

Section: Nandlangmentioning

confidence: 99%

Staged selective parser combinators

Willis

Pickering

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Parser combinators are a middle ground between the fine control of hand-rolled parsers and the high-level almost grammar-like appearance of parsers created via parser generators. They also promote a cleaner, compositional design for parsers. Historically, however, they cannot match the performance of their counterparts. This paper describes how to compile parser combinators into parsers of handwritten quality. This is done by leveraging the static information present in the grammar by representing it as a tree. However, in order to exploit this information, it will be necessary to drop support for monadic computation since this generates dynamic structure. Selective functors can help recover lost functionality in the absence of monads, and the parser tree can be partially evaluated with staging. This is implemented in a library called Parsley.

show abstract

Section: Nandlangmentioning

confidence: 99%

Staged selective parser combinators

Willis

Pickering

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Domain-specific languages have long been used to write programs with correctby-construction, type safe queries. Leijen and Meijer [27] implement Haskell/DB, an embedded DSL that dynamically generates SQL in Haskell. Karakoidas et al [24] introduce J%, a Java extension for embedding DSLs into Java in an extensible, type-safe, and syntax-checked way.…”

Section: Related Workmentioning

confidence: 99%

Type-level computations for Ruby libraries

Kazerounian

Guria

Vazou

et al. 2019

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

Many researchers have explored ways to bring static typing to dynamic languages. However, to date, such systems are not precise enough when types depend on values, which often arises when using certain Ruby libraries. For example, the type safety of a database query in Ruby on Rails depends on the table and column names used in the query. To address this issue, we introduce CompRDL, a type system for Ruby that allows library method type signatures to include typelevel computations (or comp types for short). Combined with singleton types for table and column names, comp types let us give database query methods type signatures that compute a table's schema to yield very precise type information. Comp types for hash, array, and string libraries can also increase precision and thereby reduce the need for type casts. We formalize CompRDL and prove its type system sound. Rather than type check the bodies of library methods with comp types-those methods may include native code or be complex-CompRDL inserts run-time checks to ensure library methods abide by their computed types. We evaluated CompRDL by writing annotations with type-level computations for several Ruby core libraries and database query APIs. We then used those annotations to type check two popular Ruby libraries and four Ruby on Rails web apps. We found the annotations were relatively compact and could successfully type check 132 methods across our subject programs. Moreover, the use of type-level computations allowed us to check more expressive properties, with fewer manually inserted casts, than was possible without type-level computations. In the process, we found two type errors and a documentation error that were confirmed by the developers. Thus, we believe CompRDL is an important step forward in bringing precise static type checking to dynamic languages.

show abstract

“…Back in 1998 Paul Hudak described a way to make modular DSLs with a single view [13]. The next year Leijen and Meijer described a way to compile a DSL [16]. Elliott wrote one of the many improvements of these techniques [7].…”

Section: Related Workmentioning

confidence: 99%

A Shallow Embedded Type Safe Extendable DSL for the Arduino

Koopman

Plasmeijer

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper extends our method to construct a shallow embedded domain specific language, DSL, embedded in a function programming language. We show how one can add functions and tasks that are typed by the type system of the functional host language.The DSL is clearly separated from its host functional language to facilitate the compilation to small executables in C++. The type system of the host language verifies the types in the DSL, including the types and proper use of variables. The DSL is extendable by new language constructs and interpretations without breaking any existing code. The type system guarantees that everything used in a DSL program is properly defined. We apply these techniques for a DSL to program Arduino microprocessor systems from Clean. The long term goal is to incorporate these microprocessors in the iTask system. IntroductionThe internet of things, IoT, will for a large part consist of devices equipped with a small microprocessor executing some tailor made program. The Arduino is a family of popular open-source microcontroller boards [2,3]. The Arduino Uno is the archetype of these development boards. The first version was released in 2005. The current version, R3, of this board contains a 8-bit ATMega328 microprocessor running at 16 MHz. It provides 32 KB of flash memory and 2 KB RAM. This board is very suited for control tasks since it provides 14 digital input/output pins (of which 6 can be used as PWM outputs), 6 analog inputs, and serial communication via an USB connection. Arduino boards can be extended by shields. These shields provide various kinds of additional input/output options like motor controls, Blue Tooth communication, Ethernet, LCD, buttons and relays. These elementary and cheap systems are extremely well suited for simple input/output intensive control tasks.From a software point of view these tiny systems are too small to run any operating system. The standard way to program Arduino's uses it's own dialect of C++. The Arduino IDE compiles this to binary code. This code is uploaded to the Arduino via an USB connection. For this purpose every Arduino is shipped with a tiny boot loader. Arduino programs define two functions for creating a runnable program. The setup() function is executed once to initialize the board,

show abstract

Domain specific embedded compilers

Cited by 30 publications

References 11 publications

Staged selective parser combinators

Staged selective parser combinators

Type-level computations for Ruby libraries

A Shallow Embedded Type Safe Extendable DSL for the Arduino

Contact Info

Product

Resources

About