Staged Computation with Staged Lexical Scope

Rhiger, Morten

doi:10.1007/978-3-642-28869-2_28

Cited by 15 publications

(12 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…What should be the type environment annotation if even the number of free variables in it is not statically known? This is indeed the show-stopper for some stage calculi, e.g., [27]. This section demonstrates that our library has sufficient type-environment polymorphism to express generators that introduce arbitrarily many new variables.…”

Section: Generating Letmentioning

confidence: 74%

See 1 more Smart Citation

Combinators for impure yet hygienic code generation

Kameyama¹,

Kiselyov²,

Shan

2015

Science of Computer Programming

View full text Add to dashboard Cite

Code generation is the leading approach to making high-performance software reusable. Effects are indispensable in code generators, whether to report failures or to insert let-statements and if-guards. Extensive painful experience shows that unrestricted effects interact with generated binders in undesirable ways to produce unexpectedly unbound variables, or worse, unexpectedly bound ones. These subtleties hinder domain experts in using and extending the generator. A pressing problem is thus to express the desired effects while regulating them so that the generated code is correct, or at least correctly scoped, by construction.We present a code-combinator framework that lets us express arbitrary monadic effects, including mutable references and delimited control, that move open code across generated binders. The static types of our generator expressions not only ensure that a well-typed generator produces well-typed and wellscoped code. They also express the lexical scopes of generated binders and prevent mixing up variables with different scopes. For the first time ever we demonstrate statically safe and well-scoped loop interchange and constant factoring from arbitrarily nested loops.Our framework is implemented as a Haskell library that embeds an extensible typed higher-order domain-specific language. It may be regarded as 'staged Haskell.' To become practical, the library relies on higher-order abstract syntax and polymorphism over generated type environments, and is written in a mature language.

show abstract

Section: Generating Letmentioning

confidence: 74%

“…Rhiger [27] proposed a multi-stage calculus which allows effects in generators with the static guarantee of type safety. Although simple and elegant, his calculus lacks polymorphism over environments, which makes it impossible to implement the examples like those in §2.4 and §5.2.…”

Section: Contextual Systemsmentioning

confidence: 99%

Combinators for impure yet hygienic code generation

Kameyama¹,

Kiselyov²,

Shan

2015

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…Our formalisation of LINQ-style Quot draws upon a long line of work on quotation and metaprogramming, starting with MetaML [27,31]. Our approach is closest to the λ ◻ calculus of Davies and Pfenning, which provides homogeneous closed quotation (the host and quoted languages coincide); for simplicity, we consider only one level of staging.…”

Section: Related Workmentioning

confidence: 99%

“…Our approach is closest to the λ ◻ calculus of Davies and Pfenning, which provides homogeneous closed quotation (the host and quoted languages coincide); for simplicity, we consider only one level of staging. As discussed elsewhere [4], open quotation can be simulated in Quot using lambda-abstraction, but better support for open quotation and multiple stages, possibly following the approach of Rhiger [27], may also be of interest. Our approach also has some similarities to Eckhardt et al's explicitly heterogeneous approach [11].…”

Section: Related Workmentioning

confidence: 99%

Effective quotation

Cheney

Lindley

Radanne

et al. 2014

Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

Language-integrated query techniques have been explored in a number of different language designs. We consider two different, type-safe approaches employed by Links and F#. Both approaches provide rich dynamic query generation capabilities, and thus amount to a form of heterogeneous staged computation, but to date there has been no formal investigation of their relative expressiveness. We present two core calculi Eff and Quot, respectively capturing the essential aspects of language-integrated querying using effects in Links and quotation in LINQ. We show via translations from Eff to Quot and back that the two approaches are equivalent in expressiveness. Based on the translation from Eff to Quot, we extend a simple Links compiler to handle queries.

show abstract

“…In this section, we outline a simple type system, λ [ ] , for hygienic quasiquotation [18]. In this type system, the type of a quoted expression carries the "scope" in which the expression can be inserted.…”

Section: A Type System For Hygienic Quasiquotationmentioning

confidence: 99%

Hygienic quasiquotation in scheme

Rhiger

2012

Proceedings of the 2012 Annual Workshop on Scheme and Functional Programming

Self Cite

View full text Add to dashboard Cite

Quasiquotation in Scheme is nearly ideal for implementing programs that generate other programs. These programs lack only the ability to generate fresh bound identifiers, as required to make such code-manipulating programs hygienic, but any Scheme programmer knows how to provide this ability using gensym.In this tutorial we investigate hygienic quasiquotation in Scheme and in languages influenced by Scheme. Stepping back from implementation issues, we first identify the source of the freshness condition in the semantics of a hygienic quasiquotation facility. We then show how gensym is needed to break a meta-circularity in interpreters and compilers for hygienic quasiquotation. Finally, following our recent work, we present a type system for hygienic quasiquotation that supports evaluation under dynamic λ-abstraction, manipulation of open code, a first-class eval function, and mutable state.This tutorial outlines Scheme programs implementing an interpreter, a compiler, and a macro for hygienic quasiquotation.

show abstract

Staged Computation with Staged Lexical Scope

Cited by 15 publications

References 25 publications

Combinators for impure yet hygienic code generation

Combinators for impure yet hygienic code generation

Effective quotation

Hygienic quasiquotation in scheme

Contact Info

Product

Resources

About