检索结果-内蒙古大学图书馆

17th Asian Symposium on programming Languages and Systems (APLAS)

作者： Kawata, Akira Igarashi, Atsushi Kyoto Univ Grad Sch Informat Kyoto Japan

ISBN: (纸本)9783030341756;9783030341749

We study a dependently typed extension of a multi-stage programming language a la MetaOCaml, which supports quasi-quotation and cross-stage persistence for manipulation of code fragments as firstclass values and an evaluation construct for execution of programs dynamically generated by this code manipulation. Dependent types are expected to bring to multi-stage programming enforcement of strong invariant-beyond simple type safety-on the behavior of dynamically generated code. An extension is, however, not trivial because such a type system would have to take stages of types-roughly speaking, the number of surrounding quotations-into account. To rigorously study properties of such an extension, we develop lambda(MD), which is an extension of Hanada and Igarashi's typed calculus lambda% with dependent types, and prove its properties including preservation, confluence, strong normalization for full reduction, and progress for staged reduction. Motivated by code generators that generate code whose type depends on a value from outside of the quotations, we argue the significance of cross-stage persistence in dependently typed multi-stage programming and certain type equivalences that are not directly derived from reduction rules.

关键词： multi-stage programming Cross-stage persistence Dependent types

来源：评论

学校读者我要写书评

暂无评论

Reflections on LMS: Exploring Front-End Alternatives 7

Reflections on LMS: Exploring Front-End Alternatives

引用

7th ACM SIGPLAN Symposium on Scala

作者： Rompf, Tiark Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450346481

Metaprogramming techniques to generate code at runtime in a general-purpose meta-language have seen a surge of interest in recent years, driven by the widening performance gap between high-level languages and emerging hardware platforms. In the context of Scala, the LMS (Lightweight Modular Staging) framework has contributed to "abstraction without regret"-high-level programming without performance penalty-in a number of challenging domains, through runtime code generation and embedded compiler pipelines based on stacks of DSLs. Based on this experience, this paper crystallizes some of the design decisions of LMS and discusses potential alternatives, which maintain the underlying spirit but differ in implementation choices: specifically, strategies for realizing more flexible front-end embeddings using type classes instead of higher-kinded types, and strategies for type-safe metaprogramming with untyped intermediate representations.

关键词： multi-stage programming domain-specific languages intermediate representation

来源：评论

学校读者我要写书评

暂无评论

Preserving Lexical Scoping When Dynamically Embedding Languages 1

引用

19th Brazilian Symposium on programming Languages (SBLP)

作者： Ribeiro, Felix Muhammad, Hisham Maidl, Andre Murbach Ierusalimschy, Roberto Pontificia Univ Catolica Rio de Janeiro Dept Comp Sci Rio de Janeiro Brazil

ISBN: (数字)9783319240121

ISBN: (纸本)9783319240121;9783319240114

There are various situations in which one may want to embed source code from one language into another, for example when combining relational query languages with application code or when performing staged meta-programming. Typically, one will want to transfer data between these languages. We propose an approach in which the embedded code shares variables with the host language, preserving lexical scoping rules even after the code is converted into an intermediate representation. We demonstrate this approach through a module for meta-programming using Lua as both embedded and host languages. Our technique supports dynamically generated code, requires no special annotation of functions to be translated and is implemented as a library, requiring no source pre-processing or changes to the host language execution environment.

关键词： Lua Domain-specific languages Embedded languages Meta-programming multi-stage programming

来源：评论

学校读者我要写书评

暂无评论

Staging beyond Terms: Prospects and Challenges 16

Staging beyond Terms: Prospects and Challenges

引用

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM)

作者： Inoue, Jun Kiselyov, Oleg Kameyama, Yukiyoshi Natl Inst Adv Ind Sci & Technol Tokyo Japan Tohoku Univ Sendai Miyagi 980 Japan Univ Tsukuba Tsukuba Ibaraki 305 Japan

ISBN: (纸本)9781450340977

Staging is a program generation paradigm with a clean, well-investigated semantics which statically ensures that the generated code is always well-typed and well-scoped. Staging is often used for specializing programs to the known properties or parts of data to improve efficiency, but so far it has been limited to generating terms. This short paper describes our ongoing work on extending staging, with its strong safety guarantees, to generation of non-terms, focusing on ML-style modules. The purpose is to map out the promises and challenges, then to pose a question to solicit the community's expertise in evaluating how essential our extensions are for the purpose of applying staging beyond the realm of terms. We demonstrate our extensions' use in specializing functor applications to eliminate its (currently large) overhead in OCaml. We explain the challenges that those extensions bring in and identify a promising line of attack. Unexpectedly, however, it turns out that we can avoid module generation altogether by representing modules, possibly containing abstract types, as polymorphic records. With the help of first-class modules, module specialization reduces to ordinary term specialization, which can be done with conventional staging. The extent to which this hack generalizes is unclear. Thus we have a question to the community: is there a compelling use case for module generation? With these insights and questions, we offer a starting point for a long-term program in the next stage of staging research.

关键词： multi-stage programming First-class modules Type systems Type optimization Functional programming

来源：评论

学校读者我要写书评

暂无评论

Generating Mutually Recursive Definitions 2019

Generating Mutually Recursive Definitions

引用

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM)

作者： Yallop, Jeremy Kiselyov, Oleg Univ Cambridge Cambridge England Tohoku Univ Sendai Miyagi Japan

ISBN: (纸本)9781450362269

Many functional programs - state machines [Krishnamurthi 2006], top-down and bottom-up parsers [Hinze and Paterson 2003;Hutton and Meijer 1996], evaluators [Abelson et al. 1984], GUI initialization graphs [Syme 2006], & c.-are conveniently expressed as groups of mutually recursive bindings. One therefore expects program generators, such as those written in MetaOCaml, to be able to build programs with mutual recursion. Unfortunately, currently MetaOCaml can only build recursive groups whose size is hard-coded in the generating program. The general case requires something other than quotation, and seemingly weakens static guarantees on the resulting code. We describe the challenges and propose a new language construct for assuredly generating binding groups of arbitrary size - illustrating with a collection of examples for mutual, n-ary, heterogeneous, value and polymorphic recursion.

关键词： Recursion fixed points multi-stage programming metaprogramming

来源：评论

学校读者我要写书评

暂无评论

High-Performance Client-Side Web Applications through Haskell EDSLs 9

High-Performance Client-Side Web Applications through Haskel...

引用

9th ACM SIGPLAN Symposium on Haskell (Haskell 2016)

作者： Ekblad, Anton Chalmers Univ Technol Gothenburg Sweden

ISBN: (纸本)9781450344340

We present Aplite, a domain-specific language embedded in Haskell for implementing performance-critical functions in client-side web applications. In Aplite, we apply partial evaluation, multi-stage programming and techniques adapted from machine code-targeting, high-performance EDSLs to the domain of web applications. We use Aplite to implement, among other benchmarks, procedural animation using Perlin noise (Perlin 2002), symmetrical encryption and K-means clustering, showing Aplite to be consistently faster than equivalent hand-written JavaScript - up to an order of magnitude for some benchmarks. We also demonstrate how Aplite's multi-staged nature can be used to automatically tune programs to the environment in which they are running, as well as to inputs representative of the programs' intended workload. High-performance computation in the web browser is an attractive goal for many reasons: interactive simulations and games, cryptographic applications and reducing web companies' electricity bills by outsourcing expensive computations to users' web browsers. Similarly, functional programming in the browser is attractive due to its promises of simpler, shorter, safer programs. In this paper, we propose a way to combine the two.

关键词： domain-specific languages web applications multi-stage programming

来源：评论

学校读者我要写书评

暂无评论

staged Parser Combinators for Efficient Data Processing 14

Staged Parser Combinators for Efficient Data Processing

引用

2014 ACM International Conference on Object-Oriented-programming-Systems-Languages-and-Applications (OOPSLA 14)

作者： Jonnalagedda, Manohar Coppey, Thierry Stucki, Sandro Rompf, Tiark Odersky, Martin EPFL LAMP Zurich Switzerland EPFL DATA Zurich Switzerland

ISBN: (纸本)9781450325851

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to be interleaved with processing of parse results. Unfortunately, parser combinators are typically slow due to the high overhead of the host language abstraction mechanisms that enable composition. We present a technique for eliminating such overhead. We use staging, a form of runtime code generation, to dissociate input parsing from parser composition, and eliminate intermediate data structures and computations associated with parser composition at staging time. A key challenge is to maintain support for input dependent grammars, which have no clear stage distinction. Our approach applies to top-down recursive-descent parsers as well as bottom-up nondeterministic parsers with key applications in dynamic programming on sequences, where we auto-generate code for parallel hardware. We achieve performance comparable to specialized, hand-written parsers.

关键词： Parser combinators multi-stage programming algebraic dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Lightweight Modular Staging: A Pragmatic Approach to Runtime Code Generation and Compiled DSLs

引用

ACM SIGPLAN NOTICES 2011年第2期46卷 127-136页

作者： Rompf, Tiark Odersky, Martin Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland

Software engineering demands generality and abstraction, performance demands specialization and concretization. Generative programming can provide both, but developing high-quality program generators takes a large effort, even if a multi-stage programming language is used. We present lightweight modular staging, a library-based multi-stage programming approach that breaks with the tradition of syntactic quasi-quotation and instead uses only types to distinguish between binding times. Through extensive use of component technology, lightweight modular staging makes an optimizing compiler framework available at the library level, allowing programmers to tightly integrate domain-specific abstractions and optimizations into the generation process. We argue that lightweight modular staging enables a form of language virtualization, i.e. allows to go from a pure-library embedded language to one that is practically equivalent to a stand-alone implementation with only modest effort.

关键词： Design Languages Code Generation multi-stage programming Domain-specific languages Language Virtualization

来源：评论

学校读者我要写书评

暂无评论

staged Parser Combinators for Efficient Data Processing

引用

ACM SIGPLAN NOTICES 2014年第10期49卷 637-653页

作者： Jonnalagedda, Manohar Coppey, Thierry Stucki, Sandro Rompf, Tiark Odersky, Martin EPFL LAMP Zurich Switzerland EPFL DATA Zurich Switzerland

关键词： Parser combinators multi-stage programming algebraic dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Environment classifiers

引用

ACM SIGPLAN NOTICES 2003年第1期38卷 26-37页

作者： Taha, W Nielsen, MF Rice Univ Dept Comp Sci Houston TX 77251 USA IT Univ Copenhagen Dept Comp Sci Copenhagen Denmark

This paper proposes and develops the basic theory for a new approach to typing multi-stage languages based a notion of environment classifiers. This approach involves explicit but lightweight tracking-at type-checking time-of the origination environment for future-stage computations. Classification is less restrictive than the previously proposed notions of closedness, and allows for both a more expressive typing of the "run" construct and for a unifying account of typed multi-stage programming. The proposed approach to typing requires making cross-stage persistence (CSP) explicit in the language. At the same time, it offers concrete new insights into the notion of levels and in turn into CSP itself. Type safety is established in the simply-typed setting. As a first step toward introducing classifiers to the Hindley-Milner setting, we propose an approach to integrating the two, and prove type preservation in this setting.

关键词： design reliability languages theory verification multi-stage programming type systems type safety linear temporal logic modal logic

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：