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

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2020年第ICFP期4卷 1–30页

作者： Willis, Jamie Wu, Nicolas Pickering, Matthew Imperial Coll London London England Univ Bristol Bristol Avon England

Parser combinators are a middle ground between the fine control of hand-rolled parsers and the high-level almost grammar-like appearance of parsers created via parser generators. They also promote a cleaner, compositional design for parsers. Historically, however, they cannot match the performance of their counterparts. This paper describes how to compile parser combinators into parsers of hand-written quality. This is done by leveraging the static information present in the grammar by representing it as a tree. However, in order to exploit this information, it will be necessary to drop support for monadic computation since this generates dynamic structure. Selective functors can help recover lost functionality in the absence of monads, and the parser tree can be partially evaluated with staging. This is implemented in a library called Parsley.

关键词： parsers combinators meta-programming

来源：评论

学校读者我要写书评

暂无评论

Using Template Haskell for Abstract Interpretation

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第1期177卷 201-217页

作者： Segura, Clara Torrano, Carmen Univ Complutense Madrid Dept Sistemas Informat & Programac Madrid Spain

metaprogramming consists of writing programs that generate or manipulate other programs. Template Haskell is a recent extension of Haskell, currently implemented in the Glasgow Haskell Compiler, giving support to metaprogramming at compile time. Our aim is to apply these facilities in order to statically analyse programs and transform them at compile time. In this paper we use Template Haskell to implement an abstract interpretation based strictness analysis and a let-to-case transformation that uses the results of the analysis. This work shows the advantages and disadvantages of the tool in order to incorporate new analyses and transformations into the compiler without modifying it.

关键词： meta-programming Template Haskell abstract interpretation strictness analysis

来源：评论

学校读者我要写书评

暂无评论

A meta-circular language for active libraries

引用

SCIENCE OF COMPUTER programming 2014年 95卷 219-253页

作者： Servetto, Marco Zucca, Elena Victoria Univ Wellington Wellington New Zealand Univ Genoa DIBRIS Genoa Italy

We present a new Java-like language design coupling disciplined meta-programming features with a composition language. That is, programmers can write meta-expressions that combine class definitions, on top of a small set of composition operators, inspired by the seminal Bracha's Jigsaw framework. Moreover, such operators are deep, that is, they allow manipulation (e.g., renaming or duplication) of a nested class at any level of depth. This provides an effective language support for active libraries: namely, a (library) class can provide a method returning a customized version of a class, depending, e.g., on the execution platform. Since a class can contain nested classes, a whole library can be generated in this way. That is, deep operators allow the programmer to better exploit meta-programming capabilities, leading to a "meta-programming in the large" style. We adopt a mixed typechecking technique, which provides a good compromise between meta-programming systems with extreme expressiveness and no static type checking, and those with strong type system and only limited meta-programming capability. In particular, our technique ensures an important property, called meta-level soundness, stating that typing errors never originate from already compiled (meta-)code, that is, programmers can safely use (active) libraries. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Java meta-programming Nested classes Active libraries

来源：评论

学校读者我要写书评

暂无评论

Towards Compositional and Generative Tensor Optimizations 2017

Towards Compositional and Generative Tensor Optimizations

引用

16th ACM SIGPLAN International Conference on Generative programming - Concepts and Experiences (GPCE) co-located with SPLASH Conference

作者： Susungi, Adilla Rink, Norman A. Castrillon, Jeronimo Huismann, Immo Cohen, Albert Tadonki, Claude Stiller, Joerg Froehlich, Jochen PSL Res Univ MINES ParisTech Paris France Tech Univ Dresden Chair Compiler Construct Dresden Germany Tech Univ Dresden Chair Fluid Mech Dresden Germany Ecole Normale Super INRIA Paris France

ISBN: (纸本)9781450355247

Many numerical algorithms are naturally expressed as operations on tensors (i.e. multi-dimensional arrays). Hence, tensor expressions occur in a wide range of application domains, e.g. quantum chemistry and physics;big data analysis and machine learning;and computational fluid dynamics. Each domain, typically, has developed its own strategies for efficiently generating optimized code, supported by tools such as domain-specific languages, compilers, and libraries. However, strategies and tools are rarely portable between domains, and generic solutions typically act as "black boxes" that offer little control over code generation and optimization. As a consequence, there are application domains without adequate support for easily generating optimized code, e.g. computational fluid dynamics. In this paper we propose a generic and easily extensible intermediate language for expressing tensor computations and code transformations in a modular and generative fashion. Beyond being an intermediate language, our solution also offers meta-programming capabilities for experts in code optimization. While applications from the domain of computational fluid dynamics serve to illustrate our proposed solution, we believe that our general approach can help unify research in tensor optimizations and make solutions more portable between domains.

关键词： numerical methods computational fluid dynamics (CFD) tensor methods intermediate language meta-programming code generation and optimization

来源：评论

学校读者我要写书评

暂无评论

Execution levels for aspect-oriented programming: Design, semantics, implementations and applications

引用

SCIENCE OF COMPUTER programming 2014年第Pt.B期80卷 311-342页

作者： Tanter, Eric Figueroa, Ismael Tabareau, Nicolas Univ Chile Dept Comp Sci DCC PLEIAD Lab Santiago Chile INRIA Nantes France

In aspect-oriented programming (AOP) languages, advice evaluation is usually considered as part of the base program evaluation. This is also the case for certain pointcuts, such as if pointcuts in AspectJ, or simply all pointcuts in higher-order aspect languages like AspectScheme. While viewing aspects as part of base level computation clearly distinguishes AOP from reflection, it also comes at a price: because aspects observe base level computation, evaluating pointcuts and advice at the base level can trigger infinite regression. To avoid these pitfalls, aspect languages propose ad-hoc mechanisms, which increase the complexity for programmers while being insufficient in many cases. After shedding light on the many facets of the issue, this paper proposes to clarify the situation by introducing levels of execution in the programming language, thereby allowing aspects to observe and run at specific, possibly different, levels. We adopt a defensive default that avoids infinite regression, and gives advanced programmers the means to override this default using level-shifting operators. We then study execution levels both in practice and in theory. First, we study the relevance of the issues addressed by execution levels in existing aspect-oriented programs. We then formalize the semantics of execution levels and prove that the default semantics is indeed free of a certain form of infinite regression, which we call aspect loops. Finally, we report on existing implementations of execution levels for aspect-oriented extensions of Scheme, JavaScript and Java, discussing their implementation techniques and current applications. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Aspect-oriented programming meta-programming Infinite regression Execution levels

来源：评论

学校读者我要写书评

暂无评论

Avoiding two-level systems: Using a textual environment to address cross-cutting concerns

Avoiding two-level systems: Using a textual environment to a...

引用

1st International Conference on Software and Data Technologies

作者： Greaves, David Univ Cambridge Comp Lab Cambridge CB2 3QG England

ISBN: (纸本)9728865694

We believe that, owing to the paucity of textual facilities in contemporary HLLs (high-level languages), large software systems frequently require an additional level of meta-programming to sufficiently address their cross-cutting concerns. A programming team can either implement its system by both writing the main application in a slightly customised language and the corresponding customised compiler for it, or it can use a macro pre-processor to provide the remaining cross-cutting requirements not found in the chosen HLL. With either method, a two-level system arises. This paper argues that textual macro-programming is an important cross-cutting medium, that existing proposals for sets of pre-defined AOP (aspect-oriented programming) join-points are overly constrictive and that a generalised meta-programming facility, based on a textual environment should instead be directly embedded in HLLs. The paper presents the semantics of the main additions required in an HLL designed with this feature. We recommend that the textual features must be compiled out as the reference semantics would generally be too inefficient if naively interpreted.

关键词： aspect oriented programming meta-programming textual environment interceptor function

来源：评论

学校读者我要写书评

暂无评论

Simple Dependent Types for OSTRICH 17th

Simple Dependent Types for OSTRICH

引用

17th International Conference on Integrated Formal Methods (IFM)

作者： Parreira, Joana NOVA LINCS NOVA Univ Lisbon Lisbon Portugal

ISBN: (纸本)9783031077272;9783031077265

The demand to develop more applications and in a faster way has been increasing over the years. Even non-experienced developers are jumping into the market thanks to low-code development platforms such as OutSystems. OSTRICH, a type-safe rich template language for the OutSystems platform, allows for the definition and instantiation of type-safe templates while ensuring a clear separation between compile-time and runtime computations. We formalise this two-stage language and introduce new features to the OSTRICH language, namely parametric polymorphism and a simplified form of dependent types. Such features enable instantiating the most commonly used OutSystems templates, reducing the knowledge required by the developer and easing the development process.

关键词： Staged computation Dependent types Parametric polymorphism meta-programming Low-code Template

来源：评论

学校读者我要写书评

暂无评论

metaprogramming Environment For Industry 4.0 6

Metaprogramming Environment For Industry 4.0

引用

6th International Conference on Enterprise Systems (ES)

作者： Papazoglou, Michael P. Tilburg Univ European Res Inst Serv Sci NL-5000 LE Tilburg Netherlands

ISBN: (纸本)9781538683880

Industry 4.0 is blurring the lines between the physical, and digital spheres of global production systems. Industry 4.0 sets the foundations for a completely connected factories that are characterized by the digitization and interconnection of supply chains, production equipment and production lines, and the application of the latest advanced digital information technologies to manufacturing activities. To fully realize the promise of Industry 4.0, disparate manufacturing systems, devices, data and processes need to connect, communicate, and interoperate. This paper has dual purpose. It first introduces a model-based engineering that enables a concurrent, collaborative design process where users examine and define requirements, propose solution architectures, demonstrate and exchange ideas with stakeholders, and consider product feature tradeoffs. Subsequently, it proposes a novel programming paradigm and a flexible environment that helps developers develop design-to production industrial automation solutions by employing structured higher-level modular software techniques.

关键词： Industry 4.0 Enterprise Knowledge Engineering Information integration and interoperability Model-based development Digital twins meta-programming

来源：评论

学校读者我要写书评

暂无评论

Hardware-Aware Optimizations for Deep Learning Inference on Edge Devices 1

引用

18th International Symposium on Applied Reconfigurable Computing

作者： Rognlien, Markus Que, Zhiqiang Coutinho, Jose G. F. Luk, Wayne Imperial Coll London Dept Comp 180 Queens Gate London England

ISBN: (数字)9783031199837

ISBN: (纸本)9783031199820;9783031199837

AI solutions, such as Deep Learning (DL), are becoming increasingly prevalent in edge devices. Many of these applications require low latency processing of large amounts of data within a tight power budget. In this context, reconfigurable embedded devices make a compelling option. Deploying DL models to reconfigurable devices does, however, present considerable challenges. One key issue is reconciling the often large compute requirements of DL models with the limited available resources on edge devices. In this paper, we present a hardware-aware optimization strategy for deploying DL neural networks to FPGAs, which automatically identifies hardware configurations that maximize resource utilization for a given level of computation throughput. We demonstrate our optimization approach on a sample neural network containing a combination of convolutional and fully connected layers, running on a sample FPGA target device, achieving a factor of 3.5 reduction in DSP block usage without affecting throughput when using performance mode. When using the compact mode, a factor of 7.4 reduction in DSP block usage is achieved, at the cost of 1.8 times decrease in throughput. Our approach works completely automatically without the need for human intervention or domain knowledge.

关键词： Field-programmable gate array High-level synthesis meta-programming Particle physics

来源：评论

学校读者我要写书评

暂无评论

Interacting with Dead Objects 13

Interacting with Dead Objects

引用

2013 ACM SIGPLAN International Conference on Object Oriented programming Systems Languages

作者： Salkeld, Robin Kiczales, Gregor Univ British Columbia Vancouver BC V5Z 1M9 Canada

ISBN: (纸本)9781450323741

Debugging and analyzing a snapshot of a crashed program's memory is far more difficult than working with a live program, because debuggers can no longer execute code to help make sense of the program state. We present an architecture that supports the restricted execution of ordinary code starting from the snapshot, as if the dead objects within it had been restored, but without access to their original external environment. We demonstrate the feasibility of this approach via an implementation for Java that does not require a custom virtual machine, show that it performs competitively with live execution, and use it to diagnose an unresolved memory leak in a mature mainstream application.

关键词： programming languages meta-programming reflection runtime analysis Java virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：