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

Magic Potion: Incorporating New Development Paradigms through metaprogramming

IEEE SOFTWARE 2010年第5期27卷 38-44页

作者： Djuric, Dragan Devedzic, Vladan Univ Belgrade Belgrade 11001 Serbia

Today\'s applications require mixing and matching languages, platforms, and paradigms, which increases a solution\'s complexity. The authors propose a lighter approach that borrows a desired paradigm and incorporates it as an integral part of a preferred development environment. They\'ve applied metaprogramming to internalize the ontology-modeling paradigm into a programming environment that\'s based on the Java ecosystem. Their method is also lightweight and suitable for small teams. They implemented an embedded domain-specific metalanguage, called Magic Potion, in the Clojure development environment, where it blends ontology, functional, object-oriented, and concurrent paradigms.

关键词： domain engineering domain-specific languages metaprogramming multiparadigm languages ontology languages programming languages programming paradigms programming techniques Computer Programming Languages metaprogram Sorcery PROGRAMMING TECHNIQUES Magic

来源：评论

学校读者我要写书评

暂无评论

A GENERALIZED-APPROACH TO metaprogramming IN LOGIC GRAMMARS

引用

NEW GENERATION COMPUTING 1990年第3期8卷 211-223页

作者： WILMES, T 1. Institut für Informatik und Praktische Mathematik Christian-Albrechts-Universit?t Kiel Olshausenstr 40 D-2300 Kiel Federal Republic of Germany

This paper extends Definite Clause Grammars (DCGs) by a metaprogramming facility which supports sequences of items (terminals, nonterminals, Prolog goals, etc.) as values of variables. Variables may be employed themselves as a new sort of item in the right-hand side of a rule, in order to activate the respective item sequences they are instantiated to. In addition, so-called assignments render it possible to save the terminal string derived from an item (or even from an item sequence) in a variable for later manipulation, or to unify it with another string. The new approach, called Assignment Metagrammars (AMGs), is compared with H. Abramson's meta-nonterminals and the Discontinuous Grammars (DGs) or Gapping Grammars (GGs) proposed by V. Dahl and H. Abramson. AMGs are implemented by a complier that translates them into efficient Prolog programs.

关键词： DEFINITE CLAUSE GRAMMARS META-NONTERMINALS metaprogramming DISCONTINUOUS GRAMMARS GAPPING GRAMMARS ASSIGNMENT METAGRAMMARS

来源：评论

学校读者我要写书评

暂无评论

A metaprogramming Framework for Formal Verification

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2017年第ICFP期1卷 1-29页

作者： Ebner, Gabriel Ullrich, Sebastian Roesch, Jared Avigad, Jeremy de Moura, Leonardo Vienna Univ Technol Vienna Austria Karlsruhe Inst Technol Karlsruhe Germany Univ Washington Seattle WA 98195 USA Carnegie Mellon Univ Pittsburgh PA 15213 USA Microsoft Res Redmond WA USA

We describe the metaprogramming framework currently used in Lean, an interactive theorem prover based on dependent type theory. This framework extends Lean's object language with an API to some of Lean's internal structures and procedures, and provides ways of reflecting object-level expressions into the metalanguage. We provide evidence to show that our implementation is performant, and that it provides a convenient and flexible way of writing not only small-scale interactive tactics, but also more substantial kinds of automation.

关键词： theorem proving dependent type theory tactic language metaprogramming

来源：评论

学校读者我要写书评

暂无评论

Fast JSON parser using metaprogramming on GPU 9

Fast JSON parser using metaprogramming on GPU

引用

9th IEEE International Conference on Data Science and Advanced Analytics (DSAA)

作者： Kaczmarski, Krzysztof Narebski, Jakub Piotrowski, Stanislaw Przymus, Piotr Warsaw Univ Technol Warsaw Poland Nicolaus Copernicus Univ Torun Torun Poland

ISBN: (纸本)9781665473309

We demonstrate a new idea of a parallel GPU JSON parser, which is able to optimize the parsing and initial transformation process through metaprogramming. It outperforms other well-known solutions like simdjson, Pandas, as well as cuDFwhich also works on GPU. The resulting data is ready to be further processed in common data frame formats and may be incorporated by RAPIDS, Apache Arrow or Pandas. Our parser can therefore be a part of an industrial Extract-Transform-Load workflow.

关键词： parallel parser metaprogramming ETL JSON GPU

来源：评论

学校读者我要写书评

暂无评论

Static Loop Parallelization Decision Using Template metaprogramming 16

Static Loop Parallelization Decision Using Template Metaprog...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Pereda, Alexis Hill, David R. C. Mazel, Claude Bachelet, Bruno Univ Clermont Auvergne CNRS LIMOS Clermont Ferrand France

ISBN: (纸本)9781538678794

This article proposes to use C++ template metaprogramming techniques to decide at compile-time which parts of a code sequence in a loop can be parallelized. The approach focuses on characterizing the way a variable is accessed in a loop (reading or writing), first to decide how the loop should be split to enable the analysis for parallelization on each part, and then to decide if the iterations inside each loop are independent so that they can be run in parallel. The conditions that enable the parallelization of a loop are first explained to justify the proposed decision algorithm exposed. Then, a C++ library-based solution is presented that uses expression templates to get the relevant information necessary for the parallelization decision of a loop, and metaprograms to decide whether to parallelize the loop and generate a parallel code.

关键词： code parallelization metaprogramming C plus plus expression templates parallelization decision

来源：评论

学校读者我要写书评

暂无评论

Sized Types for Low-Level Quantum metaprogramming 11th

Sized Types for Low-Level Quantum Metaprogramming

引用

11th International Conference on Reversible Computation (RC)

作者： Amy, Matthew Univ Waterloo Waterloo ON Canada

ISBN: (纸本)9783030215002;9783030214999

One of the most fundamental aspects of quantum circuit design is the concept of families of circuits parametrized by an instance size. As in classical programming, metaprogramming allows the programmer to write entire families of circuits simultaneously, an ability which is of particular importance in the context of quantum computing as algorithms frequently use arithmetic over non-standard word lengths. In this work, we introduce metaQASM, a typed extension of the openQASM language supporting the metaprogramming of circuit families. Our language and type system, built around a lightweight implementation of sized types, supports subtyping over register sizes and is moreover type-safe. In particular, we prove that our system is strongly normalizing, and as such any well-typed metaQASM program can be statically unrolled into a finite circuit.

关键词： Quantum programming Circuit description languages metaprogramming

来源：评论

学校读者我要写书评

暂无评论

High-Fidelity metaprogramming with Separator Syntax Trees 2020

High-Fidelity Metaprogramming with Separator Syntax Trees

引用

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

作者： Aarssen, Rodin T. A. van der Storm, Tijs Ctr Wiskunde & Informat Amsterdam Netherlands Eindhoven Univ Technol Eindhoven Netherlands Univ Groningen Groningen Netherlands

ISBN: (纸本)9781450370967

Many metaprogramming tasks, such as refactorings, automated bug fixing, or large-scale software renovation, require high-fidelity source code transformations - transformations which preserve comments and layout as much as possible. Abstract syntax trees (ASTs) typically abstract from such details, and hence would require pretty printing, destroying the original program layout. Concrete syntax trees (CSTs) preserve all layout information, but transformation systems or parsers that support CSTs are rare and can be cumbersome to use. In this paper we present separator syntax trees (SSTs), a lightweight syntax tree format, that sits between AST and CSTs, in terms of the amount of information they preserve. SSTs extend ASTs by recording textual layout information separating AST nodes. This information can be used to reconstruct the textual code after parsing, but can largely be ignored when implementing high-fidelity transformations. We have implemented SSTs in Rascal, and show how it enables the concise definition of high-fidelity source code transformations using a simple refactoring for C++.

关键词： metaprogramming high-fidelity code transformations

来源：评论

学校读者我要写书评

暂无评论

GraalVM: metaprogramming inside a Polyglot System 3

GraalVM: Metaprogramming inside a Polyglot System

引用

3rd ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection (META)

作者： Bonetta, Daniele Oracle Labs VM Res Grp Belmont CA 94002 USA

ISBN: (纸本)9781450360685

GraalVM is a polyglot virtual machine for running applications written in a variety of languages such as JavaScript, Ruby, Python, R, JVM-based languages like Java, Scala, Kotlin, and LLVM-based languages such as C and C++. GraalVM enables interoperability between different programming languages in a shared runtime, and can run either standalone or embedded in other software systems such as ***, the Oracle RDBMS, and MySQL. In this talk I will give an overview of GraalVM, and I will present how polyglot features such as language interoperability and language-agnostic instrumentation are enabled in GraalVM by means of VM-internal metaprogramming.

关键词： GraalVM metaprogramming Language interoperability Instrumentation

来源：评论

学校读者我要写书评

暂无评论

First-Class Data Types in Shallow Embedded Domain-Specific Languages using metaprogramming 34

First-Class Data Types in Shallow Embedded Domain-Specific L...

引用

34th Symposium on Implementation and Application of Functional Languages (IFL)

作者： Lubbers, Mart Koopman, Pieter Plasmeijer, Rinus Radboud Univ Nijmegen Inst Comp & Informat Sci Nijmegen Netherlands

ISBN: (纸本)9781450398312

Functional programming languages are excellent for hosting embedded domain specific languages (eDSLs) because of their rich type systems, minimal syntax, and referential transparency. However, data types defined in the host language are not automatically available in the embedded language. To do so, all the operations on the data type must be ported to the eDSL resulting in a lot of boilerplate. This paper shows that by using metaprogramming, all first-order user-defined data types can be automatically made first class in shallow embedded DSLs. We show this by providing an implementation in Template Haskell for a typical DSL with two different semantics. Furthermore, we show that by utilising quasiquotation, there is hardly any burden on the syntax. Finally, the paper also serves as a gentle introduction to Template Haskell.

关键词： functional programming domain-specific languages metaprogramming Haskell Template Haskell

来源：评论

学校读者我要写书评

暂无评论

Toward Foundations for Type-Reflective metaprogramming 09

Toward Foundations for Type-Reflective Metaprogramming

引用

8th International Conference on Generative Programming and Component Engineering

作者： Garcia, Ronald Lumsdaine, Andrew Rice Univ Houston TX 77251 USA Indiana Univ Bloomington IN 47405 USA

ISBN: (纸本)9781605584942

C++ template metaprogramming has been used with great success to build software applications and libraries. In practice, however, template metaprogramming suffers usability, reliability, and capability shortcomings, and it is not well understood in theory. Template metaprogramming has these problems because it relies on emergent properties of disparate language features that were tailored to other purposes. As a step toward solid and sound language support for metaprogramming, this paper establishes firm semantic foundations for select capabilities of template metaprogramming. We analyze C++ and the idioms of template metaprogramming and isolate, in a language-neutral fashion, fundamental capabilities of C++ that enable metaprogramming. Guided by this analysis, we present a design for a core calculus that directly expresses fundamental metaprogramming capabilities, including static computation, code generation, and type reflection. We prove a type-safety property for compile-time evaluation of metaprograms. To formally connect the core calculus to programming practice, we present a more convenient surface language for metaprogramming. Its semantics are captured by type-directed translation to the core calculus. We prove that this translation preserves well-typing. This idealized presentation averts some of the shortcomings of C++ template metaprogramming and provides a framework for further study.

关键词： Design Languages Theory C plus metaprogramming reflection semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：