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

17th ACM SIGPLAN International Conference on Generative programming - Concepts and Experiences (GPCE) part of the SPLASH Collection of Conferences and Workshops

作者： van Binsbergen, L. Thomas Royal Holloway Univ London London England

ISBN: (纸本)9781450360456

The PLanCompS project proposes a component-based approach to programming-language development in which fundamental constructs (funcons) are reused across language definitions. Homogeneous Generative meta-programming (HGMP) enables writing programs that generate code as data, at run-time or compile-time, for manipulation and staged evaluation. Building on existing formalisations of HGMP, this paper introduces funcons for HGMP and demonstrates their usage in component-based semantics.

关键词： meta-programming component-based semantics operational semantics denotational semantics funcons

来源：评论

学校读者我要写书评

暂无评论

meta-programming and Auto-tuning in the Search for High Performance GPU Code 4

Meta-programming and Auto-tuning in the Search for High Perf...

引用

4th ACM SIGPLAN Workshop on Functional High-Performance Computing (FHPC)

作者： Vollmer, Michael Svensson, Bo Joel Holk, Eric Newton, Ryan R. Indiana Univ Bloomington IN 47405 USA

ISBN: (纸本)9781450338073

Writing high performance GPGPU code is often difficult and time-consuming, potentially requiring laborious manual tuning of low-level details. Despite these challenges, the cost in ignoring GPUs in high performance computing is increasingly large. Auto-tuning is a potential solution to the problem of tedious manual tuning. We present a framework for auto-tuning GPU kernels which are expressed in an embedded DSL, and which expose compile-time parameters for tuning. Our framework allows for kernels to be polymorphic over what search strategy will tune them, and allows search strategies to be implemented in the same metalanguage as the kernel-generation code (Haskell). Further, we show how to use functional programming abstractions to enforce regular (hyper-rectangular) search spaces. We also evaluate several common search strategies on a variety of kernels, and demonstrate that the framework can tune both EDSL and ordinary CUDA code.

关键词： auto-tuning meta-programming parallelism GPUs

来源：评论

学校读者我要写书评

暂无评论

PROGRAM LOGICS FOR HOMOGENEOUS GENERATIVE RUN-TIME meta-programming

引用

LOGICAL METHODS IN COMPUTER SCIENCE 2015年第1期11卷

作者： Berger, Martin Tratt, Laurence Univ Sussex Dept Informat Brighton BN1 9QJ E Sussex England Kings Coll London Dept Informat Software Dev Team London WC2R 2LS England

This paper provides the first program logic for homogeneous generative run-time meta-programming using a variant of MiniML(e)(square) by Davies and Pfenning as its underlying on language. We show the applicability of our approach by reasoning about example meta-programs from the literature. We also demonstrate that our logics are relatively complete in the sense of Cook, enable the inductive derivation of characteristic formulae, and exactly capture the observational properties induced by the operational semantics.

关键词： Program Logic Specification Verification meta-programming Types Observational Completeness Descriptive Completeness Relative Completeness Characteristic Formula

来源：评论

学校读者我要写书评

暂无评论

meta-programming with Well-typed Code Analysis 15

Meta-programming with Well-typed Code Analysis

引用

30th ACM Symposium on Applied Computing (SAC)

作者： Lopez, Michael Dos Reis, Gabriel Texas A&M Univ College Stn TX 77843 USA Microsoft Albuquerque NM USA

ISBN: (纸本)9781450331968

Structure-analyzing metaprograms remain largely type-unsafe. In programming languages that support meta-programming, the type system is not strong enough to guarantee that well typed metaprograms produce only well-typed programs. Banning facilities for code analysis from the meta-programming toolbox in order to achieve type soundness, robs programmers of useful tools such as ability to specify powerful code transformations. We present code pattern types, types that reason about the structure of programs through pattern matching and supports type safe code analysis.

关键词： meta-programming pattern matching type inference

来源：评论

学校读者我要写书评

暂无评论

The LO Sequencing Problem and Its Solution Using meta-programming-Based Approach 21st

The LO Sequencing Problem and Its Solution Using Meta-Progra...

引用

21st International Conference on Information and Software Technologies (ICIST)

作者： Stuikys, Vytautas Burbaite, Renata Bespalova, Kristina Kaunas Univ Technol Studentu 50 LT-51368 Kaunas Lithuania

ISBN: (纸本)9783319247700;9783319247694

This paper presents a meta-programming-based approach to solve learning objects (LOs) sequencing task. The task is dealt with by introducing a framework, formal analysis of the problem. The approach includes: (i) task formalization, (ii) description of the method and algorithm, (iii) implementation and case study for computer science education. The approach enables the automatic generation and flexible adaptation on demand and has been approved in the real teaching setting. Some characteristics and future work are indicated.

关键词： Learning object Generative learning object Learning objects sequencing metadata meta-programming

来源：评论

学校读者我要写书评

暂无评论

Profile- Guided meta-programming 15

Profile- Guided Meta-Programming

引用

36th ACM SIGPLAN Conference on programming Language Design and Implementation

作者： Bowman, William J. Miller, Swaha St-Amour, Vincent Dybvig, R. Kent Northeastern Univ Boston MA 02115 USA Cisco Syst Inc San Jose CA USA

ISBN: (纸本)9781450334686

Contemporary compiler systems such as GCC,. NET, and LLVM incorporate profile-guided optimizations (PGOs) on low-level intermediate code and basic blocks, with impressive results over purely static heuristics. Recent work shows that profile information is also useful for performing source-to-source optimizations via meta-programming. For example, using profiling information to inform decisions about data structures and algorithms can potentially lead to asymptotic improvements in performance. We present a design for profile-guided meta-programming in a general-purpose meta-programming system. Our design is parametric over the particular profiler and meta-programming system. We implement this design in two different meta-programming systems-the syntactic extensions systems of Chez Scheme and Racket- and provide several profile-guided meta-programs as usability case studies.

关键词： Design Performance Languages Optimization profiling profile-guided optimization PGO meta-programming

来源：评论

学校读者我要写书评

暂无评论

A Layered Approach to Intensional Analysis in Type Theory

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 2025年第4期46卷 1-43页

作者： Hu, Jason Z. S. Pientka, Brigitte McGill Univ Sch Comp Sci Montreal PQ Canada

We introduce layering to modal type theory to support meta-programming and intensional analysis coherently. In particular, we demonstrate this idea by developing a 2-layered modal type theory. At the core of this type theory (layer 0 ) is a simply typed A-calculus with no modality. Layer 1 is obtained by extending the core language with one layer of contextual square types to support pattern matching on potentially open code from layer 0 while retaining normalization. Although both layers fundamentally share a uniform syntax and the same typing judgment, we only allow computation at layer 1 . As a consequence, layer 0 accurately captures the syntactic representation of code in contrast to the computational behaviors at layer 1 . Moreover, the uniform syntax at both layers enables quotation and code running. The system is justified by normalization by evaluation (NbE) using a presheaf model. The normalization algorithm extracted from the model is sound and complete and is implemented in Agda. Layered modal type theory provides a uniform foundation for meta-programming with intensional analysis. We see this work as an important step towards a foundational way to support meta-programming in proof assistants.

关键词： modal type theory contextual types meta-programming normalization by evaluation presheaf model

来源：评论

学校读者我要写书评

暂无评论

Using meta-programming technology to parse ipv6 protocol suite

Using meta-programming technology to parse ipv6 protocol sui...

引用

International Conference on Mechatronics and Semiconductor Materials (ICMSCM 2013)

作者： Wang, Zhenqi Huang, Jinchao North China Elect Power Univ Informat & Network Management Ctr Baoding Peoples R China

ISBN: (纸本)9783037859391

As the ipv6 protocol stack constantly updated, more and more protocols let to compile parsing codes for each protocols individually is not only huge workload and easy to make mistakes, but also poor reusability and difficult to maintain. Addressed this situation, this paper proposes a method based on the technology of meta-programming to implement a flexible protocol stack parsing program with the ease of expansion and modification.

关键词： IPv6 meta-programming protocol parsing

来源：评论

学校读者我要写书评

暂无评论

A case for data-oriented specifications: simpler implementation of B tools and DSLs

引用

INNOVATIONS IN SYSTEMS AND SOFTWARE ENGINEERING 2025年 1-21页

作者： Koerner, Philipp Mager, Florian Rossbach, Jan Heinrich Heine Univ Dusseldorf Inst Informat Univ Str 1 D-40225 Dusseldorf NRW Germany

Considering programs as data enables powerful meta-programming. One example is Lisp's macro system, which gives rise to powerful transformations of programs and allows easy implementation of domain-specific languages. Formal specifications, however, usually do not rely on such mechanisms and are mostly written by hand in a textual format (or using specialised domain-specific language (DSL) tools). In this paper, we investigate the opportunities that stem from considering specifications as data. For this, we embedded the B specification language in Clojure, a modern Lisp. We use Clojure as a functional meta-programming language and the ProB Java API to capture the semantics of B, i.e., to find solutions for constraints or animate machines. From our experience, it is especially useful for tool development and generation of constraints and machines from external data sources. It can also be used to implement language extensions and to design DSLs.

关键词： B ProB Clojure Language embedding meta-programming Tool development Domain-specific languages

来源：评论

学校读者我要写书评

暂无评论

Defeasible Reasoning via Datalog not sign

引用

THEORY AND PRACTICE OF LOGIC programming 2023年第5期23卷 986-1028页

作者： Maher, Michael J. Reasoning Res Inst Canberra ACT Australia

We address the problem of compiling defeasible theories to Datalog not sign programs. We prove the correctness of this compilation, for the defeasible logic DL( partial differential (||)), but the techniques we use apply to many other defeasible logics. Structural properties of DL( partial differential (||)) are identified that support efficient implementation and/or approximation of the conclusions of defeasible theories in the logic, compared with other defeasible logics. We also use previously well-studied structural properties of logic programs to adapt to incomplete Datalog not sign implementations.

关键词： defeasible logic program transformation well-founded semantics meta-programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：