Reflections on LMS: exploring front-end alternatives

Rompf, Tiark

doi:10.1145/2998392.2998399

Cited by 11 publications

(8 citation statements)

References 90 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(For example, MVCs [37] and Torgersen's second solution [34] both have the same issue.) The state of affairs for LMS might change in future though [38].…”

Section: E3 Upon Extension Forces No Manipulation or Duplicationmentioning

confidence: 99%

Composition of Languages Embedded in Scala

Haeri

Keir

2019

Proceedings of the 2019 Federated Conference on Computer Science and Information Systems

View full text Add to dashboard Cite

Composition is amongst the major challenges faced in language engineering. Erdweg et al. offered a taxonomy for language composition. Mernik catalogued the use of the Language Definitional Framework LISA for composition sorts in that taxonomy. We produce a similar catalogue for embedded language engineering in Scala. We begin with techniques that are not specific to Scala. They are applicable in any host language with a module system and support for higher order functions. We, then, present two more techniques to examine Scala-specific language engineering. Interestingly enough, even though dealing with embedded languages, in terms of lines of code, our material is of comparable length to its LISA counterpart. Our work lends insight into Scala's serviceability for composition, as a host for embedded language engineering.

show abstract

“…(For example, MVCs [37] and Torgersen's second solution [34] both have the same issue.) The state of affairs for LMS might change in future though [38].…”

Section: E3 Upon Extension Forces No Manipulation or Duplicationmentioning

confidence: 99%

Composition of Languages Embedded in Scala

Haeri

Keir

2019

Proceedings of the 2019 Federated Conference on Computer Science and Information Systems

View full text Add to dashboard Cite

show abstract

“…LMS is a powerful system that preserves the execution order of staged computations and also o ers an extensible Graph-based IR. On the ipside, two shortcomings of LMS, namely high compile times and the fact that it is based on a fork of the compiler were recently discussed as points of improvement [30].…”

Section: Related Workmentioning

confidence: 99%

A practical unification of multi-stage programming and macros

Stucki

Biboudis

Odersky

2018

Proceedings of the 17th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences

View full text Add to dashboard Cite

Program generation is indispensable. We propose a novel uni cation of two existing metaprogramming techniques: multi-stage programming and hygienic generative macros. The former supports runtime code generation and execution in a type-safe manner while the latter o ers compile-time code generation. In this work we draw upon a long line of research on metaprogramming, starting with Lisp, MetaML and MetaO-Caml. We provide direct support for quotes, splices and toplevel splices, all regulated uniformly by a level-counting Phase Consistency Principle. Our design enables the construction and combination of code values for both expressions and types. Moreover, code generation can happen either at runtime à la MetaML or at compile time, in a macro fashion, à la MacroML. We provide an implementation of our design in Scala and we present two case studies. The rst implements the Hidden Markov Model, Shonan Challenge for HPC. The second implements the staged streaming library Strymonas. CCS Concepts • Software and its engineering → Language features; Macro languages;

show abstract

“…However, these are often heavyweight and impose a significant cost on domain experts, who have to deal with complicated type encodings, whereas they would just like to express code transformations as simple rewrite rules. In particular, we found that GADTs are hard to manipulate in systems like Haskell and Scala [Giarrusso 2013;Rompf 2016]. łType-based embeddingž systems like LMS [Rompf and Odersky 2010] use implicit conversions to compose code fragments, but this approach is complicated [Jovanovic et al 2014] and is not applicable to code pattern-matching.…”

Section: Safe Program Manipulationmentioning

confidence: 99%

Unifying analytic and statically-typed quasiquotes

Parreaux

Voizard

Shaikhha

et al. 2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Metaprograms are programs that manipulate (generate, analyze and evaluate) other programs. These tasks are greatly facilitated by quasiquotation, a technique to construct and deconstruct program fragments using quoted code templates expressed in the syntax of the manipulated language. We argue that two main flavors of quasiquotes have existed so far: Lisp-style quasiquotes, which can both construct and deconstruct programs but may produce code that contains type mismatches and unbound variables; and MetaML-style quasiquotes, which rely on static typing to prevent these errors, but can only construct programs. In this paper, we show how to combine the advantages of both flavors into a unified framework: we allow the construction, deconstruction and evaluation of program fragments while ensuring that generated programs are well-typed and well-scoped, a combination unseen in previous work. We formalize our approach as λ { } , a multi-stage calculus with code pattern matching and rewriting, and prove its type safety. We also present its realization in Squid, a metaprogramming framework for Scala, leveraging Scala's expressive type system. To demonstrate the usefulness of our approach, we introduce speculative rewrite rules, a novel code transformation technique that makes decisive use of these capabilities, and we outline how it simplifies the design of some crucial query compiler optimizations. CCS Concepts: • Software and its engineering → Language features; Semantics;

show abstract

Reflections on LMS: exploring front-end alternatives

Cited by 11 publications

References 90 publications

Composition of Languages Embedded in Scala

Composition of Languages Embedded in Scala

A practical unification of multi-stage programming and macros

Unifying analytic and statically-typed quasiquotes

Contact Info

Product

Resources

About