A multi-stage language with intensional analysis

Viera, Marcos; Pardo, Alberto

doi:10.1145/1173706.1173709

Cited by 7 publications

(4 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the few works that support code analysis via pattern matching in typed multi-staged programming is Viera and Pardo [2006]. Similar to contextual types, the type of code fragments is annotated with a typing environment.…”

Section: Related Workmentioning

confidence: 99%

Mœbius: metaprogramming using contextual types: the stage where system f can pattern match on itself

Jang

Gélineau

Monnier

et al. 2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We describe the foundation of the metaprogramming language, Mœbius, which supports the generation of polymorphic code and, more importantly, the analysis of polymorphic code via pattern matching. Mœbius has two main ingredients: 1) we exploit contextual modal types to describe open code together with the context in which it is meaningful. In Mœbius, open code can depend on type and term variables (level 0) whose values are supplied at a later stage, as well as code variables (level 1) that stand for code templates supplied at a later stage. This leads to a multi-level modal lambda-calculus that supports System-F style polymorphism and forms the basis for polymorphic code generation. 2) we extend the multi-level modal lambda-calculus to support pattern matching on code. As pattern matching on polymorphic code may refine polymorphic type variables, we extend our type-theoretic foundation to generate and track typing constraints that arise. We also give an operational semantics and prove type preservation. Our multi-level modal foundation for Mœbius provides the appropriate abstractions for both generating and pattern matching on open code without committing to a concrete representation of variable binding and contexts. Hence, our work is a step towards building a general type-theoretic foundation for multi-staged metaprogramming that, on the one hand, enforces strong type guarantees and, on the other hand, makes it easy to generate and manipulate code. This will allow us to exploit the full potential of metaprogramming without sacrificing the reliability of and trust in the code we are producing and running.

show abstract

Section: Related Workmentioning

confidence: 99%

Mœbius: metaprogramming using contextual types: the stage where system f can pattern match on itself

Jang

Gélineau

Monnier

et al. 2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…One of the few works that have investigated code inspection via pattern matching in a typed multi-staged programming setting is by Viera and Pardo [2006]. Similar to contextual types, the type of code fragments, cod Γ , are annotated with a typing environment of the free variables.…”

Section: Related Workmentioning

confidence: 99%

Moebius: Metaprogramming using Contextual Types -- The stage where System F can pattern match on itself (Long Version)

Jang¹,

Gélineau²,

Monnier³

et al. 2021

Preprint

View full text Add to dashboard Cite

We describe the foundation of the metaprogramming language, Moebius, which supports the generation of polymorphic code and, more importantly the analysis of polymorphic code via pattern matching.Moebius has two main ingredients: 1) we exploit contextual modal types to describe open code together with the context in which it is meaningful. In Moebius, open code can depend on type and term variables (level 0) whose values are supplied at a later stage, as well as code variables (level 1) that stand for code templates supplied at a later stage. This leads to a multi-level modal lambda-calculus that supports System-F style polymorphism and forms the basis for polymorphic code generation. 2) we extend the multi-level modal lambda-calculus to support pattern matching on code. As pattern matching on polymorphic code may refine polymorphic type variables, we extend our type-theoretic foundation to generate and track typing constraints that arise. We also give an operational semantics and prove type preservation.Our multi-level modal foundation for Moebius provides the appropriate abstractions for both generating and pattern matching on open code without committing to a concrete representation of variable binding and contexts. Hence, our work is a step towards building a general type-theoretic foundation for multi-staged metaprogramming that, on the one hand, enforces strong type guarantees and, on the other hand, makes it easy to generate and manipulate code. This will allow us to exploit the full potential of metaprogramming without sacrificing the reliability of and trust in the code we are producing and running.

show abstract

“…It is not clear how (a pure fragment of) the calculus can be related to other foundational calculi; possible directions may be to use the calculus of contexts [23] by Sato, Sakurai, and Kameyama, and the contextual modal type theory by Nanevski, Pfenning, and Pientka [24]. Viera and Pardo [25] have proposed a multi-stage language with intensional code analysis, that is, pattern matching on code. The language requires typechecking at run-time.…”

Section: Related Workmentioning

confidence: 99%

A Logical Foundation for Environment Classifiers

Tsukada¹,

Igarashi²

2010

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. Taha and Nielsen have developed a multi-stage calculus λ α with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fragments and variable declarations are annotated, and their scoping mechanism is used to ensure statically that certain code fragments are closed and safely runnable.In this paper, we investigate the Curry-Howard isomorphism for environment classifiers by developing a typed λ-calculus λ ⊲ . It corresponds to multi-modal logic that allows quantification by transition variables-a counterpart of classifiers-which range over (possibly empty) sequences of labeled transitions between possible worlds. This interpretation will reduce the "run" construct-which has a special typing rule in λ α -and embedding of closed code into other code fragments of different stages-which would be only realized by the cross-stage persistence operator in λ α -to merely a special case of classifier application. λ ⊲ enjoys not only basic properties including subject reduction, confluence, and strong normalization but also an important property as a multi-stage calculus: timeordered normalization of full reduction.Then, we develop a big-step evaluation semantics for an ML-like language based on λ ⊲ with its type system and prove that the evaluation of a well-typed λ ⊲ program is properly staged. We also identify a fragment of the language, where erasure evaluation is possible.Finally, we show that the proof system augmented with a classical axiom is sound and complete with respect to a Kripke semantics of the logic.

show abstract

A multi-stage language with intensional analysis

Cited by 7 publications

References 30 publications

Mœbius: metaprogramming using contextual types: the stage where system f can pattern match on itself

Mœbius: metaprogramming using contextual types: the stage where system f can pattern match on itself

Moebius: Metaprogramming using Contextual Types -- The stage where System F can pattern match on itself (Long Version)

A Logical Foundation for Environment Classifiers

Contact Info

Product

Resources

About