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

Encoding Abstract Syntax Without Fresh Names

JOURNAL OF AUTOMATED REASONING 2012年第2期49卷 115-140页

作者： Lakin, Matthew R. Pitts, Andrew M. Univ Cambridge Comp Lab Cambridge CB2 3QG England

This paper introduces a variant of nominal abstract syntax in which bindable names are represented by normal meta-variables as opposed to a separate class of globally fresh names. Distinct meta-variables can be instantiated with the same concrete name, which we call aliasing. The possible aliasing patterns are controlled by explicit constraints on the distinctness (freshness) of names. This approach has already been used in the nominal meta-programming language alpha ML. We recap that language and develop a theory of contextual equivalence for it. The central result of the paper is that abstract syntax trees (ASTs) involving binders can be encoded into alpha ML in such a way that alpha-equivalence of ASTs corresponds with contextual equivalence of their encodings. This is novel because the encoding does not rely on the existence of globally fresh names and fresh name generation, which are fundamental to the correctness of the pre-existing encoding of abstract syntax into FreshML.

关键词： meta-programming Alpha-equivalence Nominal abstract syntax

来源：评论

学校读者我要写书评

暂无评论

Evolution of rule-based programs

引用

JOURNAL OF LOGIC AND ALGEBRAIC programming 2004年第SUPPL.期60-1卷 141-193页

作者： Lämmel, R Free Univ Amsterdam Fac Sci Dept Informat Management & Software Engn NL-1081 HV Amsterdam Netherlands Ctr Wiskunde & Informat Dept Software Engn NL-1098 SJ Amsterdam Netherlands

The term ride-based program is meant to include definite clause programs, SOS specifications, attribute grammars, and conditional rewrite systems. These setups are widely used for the executable specification or implementation of language-based tools, e.g., interpreters, translators, type checkers, program analysers, and program transformations. We provide a pragmatic, transformation-based approach for expressing and tracking changes in rule-based programs in the course of program evolution. To this end, we design an operator suite for the transformation of rule-based programs. The operators facilitate steps for clean-up, refactoring, and enhancement. We use SOS-based interpreter examples to illustrate evolution of rule-based programs. We use logic programming to execute the examples, while the relevant evolution operators are made available as logic meta-programs. (C) 2004 Elsevier Inc. All rights reserved.

关键词： software evolution program transformation rule-based programming meta-programming natural semantics structural operational semantics logic programming attribute grammars constructive algebraic specification refactoring extensibility reuse

来源：评论

学校读者我要写书评

暂无评论

Portable Parallel Programs with Python and OpenCL

引用

COMPUTING IN SCIENCE & ENGINEERING 2014年第1期16卷 34-40页

作者： Di Pierro, Massimo Depaul Univ Sch Comp Chicago IL 60604 USA Univ Southampton Southampton SO9 5NH Hants England

Open Common Language (OpenCL) runs on multicore GPUs, as well as other architectures including ordinary CPUs and mobile devices. Combining OpenCL with numerical Python (numPy) and a new module-ocl, a Python-to-C converter that lets developers use Python to write OpenCL kernels-creates a powerful framework for developing efficient parallel programs for modern heterogeneous architectures.

关键词： GPU OpenCL Python meta-programming parallel programming scientific computing

来源：评论

学校读者我要写书评

暂无评论

REFLECTION MECHANISMS FOR COMBINING PROLOG DATABASES

引用

SOFTWARE-PRACTICE & EXPERIENCE 1991年第6期21卷 603-624页

作者： LAMMA, E MELLO, P NATALI, A Dipartimento di Elettronica Informatica e Sistemistica Universita di Bologna Viale Risorgimento 2 40136 Bologna Italy

By using practical examples, this paper outlines the power of reflection mechanisms for logic programming systems in the domain of knowledge structuring. In particular, it presents an extension of Prolog, where separate databases can be handled as first-class objects. Different forms of database combination such as inheritance and dynamic context extension/contraction are specified and implemented in a dynamic and flexible way through reflection. The main aim is to broaden the application area of logic programming to encompass most of the paradigms needed by systems that use artificial intelligence techniques. Practical results presented in the paper show that logic programs that use reflection can be shorter, more readable and efficient than those using more conventional full meta-interpretation techniques. Full meta-interpretation, however, is more general than reflection.

关键词： LOGIC programming KNOWLEDGE REPRESENTATION meta-programming REFLECTION PROLOG

来源：评论

学校读者我要写书评

暂无评论

Modular language implementation in Rascal - experience report

引用

SCIENCE OF COMPUTER programming 2015年第Pt.3期114卷 7-19页

作者： Basten, Bas van den Bos, Jeroen Hills, Mark Klint, Paul Lankamp, Arnold Lisser, Bert van der Ploeg, Atze van der Storm, Tijs Vinju, Jurgen Ctr Wiskunde & Informat Amsterdam Netherlands Chalmers Univ Technol S-41296 Gothenburg Sweden INRIA Lille Nord Europe Lille France E Carolina Univ Greenville NC 27858 USA Xebia Hilversum Netherlands Netherlands Forens Inst The Hague Netherlands

All software evolves, and programming languages and programming language tools are no exception. And just like in ordinary software construction, modular implementations can help ease the process of changing a language implementation and its dependent tools. However, the syntactic and semantic dependencies between language features make this a challenging problem. In this paper we detail how programming languages can be implemented in a modular fashion using the RASCAL meta-programming language. RASCAL supports extensible definition of concrete syntax, abstract syntax and operations on concrete and abstract syntax trees like matching, traversal and transformation. As a result, new language features can be added without having to change existing code. As a case study, we detail our solution of the LDTA'11 Tool Challenge: a modular implementation of OBERON-0, a relatively simple imperative programming language. The approach we sketch can be applied equally well to the implementation of domain-specific languages. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Language engineering Language workbench meta-programming Modularity Compiler generators

来源：评论

学校读者我要写书评

暂无评论

Towards generic representation of web applications: solutions and trade-offs

引用

SOFTWARE-PRACTICE & EXPERIENCE 2009年第5期39卷 501-530页

作者： Rajapakse, Damith C. Jarzabek, Stan Natl Univ Singapore Dept Comp Sci Sch Comp Singapore 117548 Singapore

Server pages (also called dynamic pages) render a generic web page into many similar ones. The technique is commonly used for implementing web application user interfaces (UIs). Yet our previous study found a high rate of repetitions (also called 'clones') in web applications, particularly in UIs. The finding raised the question as to why such repetitions had not been averted with the use of server pages. For an answer, we conducted an experiment using PHP server pages to explore how far server pages can be pushed to achieve generic web applications. Our initial findings suggested that generic representation obtained using server pages sometimes compromises certain important system qualities such as run-time performance. It may also complicate the use of WYSIWYG editors. We have analysed the nature of these trade-offs, and now propose a mixed-strategy approach to obtain optimum generic representation of web applications without unnecessary compromise to critical system qualities and user experience. The mixed-strategy approach applies the generative technique of XVCL to achieve genericity at the meta-level representation of a web application, leaving repetitions to the actual web application. Our experiments show that the mixed-strategy approach can achieve a good level of genericity without conflicting with other system qualities. Our findings should open the way for others to better-informed decisions regarding generic design solutions, which should in turn lead to simpler, more maintainable and more reusable web applications. Copyright (C) 2008 John Wiley & Sons, Ltd.

关键词： code duplication clone unification meta-programming design patterns Web applications genericity

来源：评论

学校读者我要写书评

暂无评论

LMA: A generic and efficient implementation of the Levenberg-Marquardt Algorithm

引用

SOFTWARE-PRACTICE & EXPERIENCE 2017年第11期47卷 1707-1727页

作者： Ramadasan, Datta Chevaldonne, Marc Chateau, Thierry UBP Inst Pascal UMR 6602 CNRSIFMA Campus Cezeaux4 Ave Blaise Pascal F-63171 Aubiere France

This paper presents an open-source, generic and efficient implementation of a very popular nonlinear optimization method: the Levenberg-Marquardt algorithm (LMA). This minimization algorithm is well known and hundreds of implementations have already been released. However, none of them offer at the same time a high level of genericity, a friendly syntax and a high computational performance. In this paper, we propose a solution to gather all those advantages in one library named LMA. The main challenge is to implement an efficient solver for every encounter problem. To overcome this difficulty, LMA uses compile time algorithms to design a code specific to the given optimization problem. The features of LMA are presented and the performances are compared with the state-of-the-art best alternatives through extensive benchmarks on different kind of problems. Copyright (C) 2017 John Wiley & Sons, Ltd.

关键词： Levenberg-Marquardt nonlinear least squares C plus genericity meta-programming

来源：评论

学校读者我要写书评

暂无评论

Bootstrapping a Compiler for an Equation-Based Object-Oriented Language

引用

MODELING IDENTIFICATION AND CONTROL 2014年第1期35卷 1-19页

作者： Sjolund, M. Fritzson, P. Pop, A. Linkoping Univ PELAB SE-58183 Linkoping Sweden

What does it mean to bootstrap a compiler, and why do it? This paper reports on the first bootstrapping of a full-scale E00 (Equation-based Object-Oriented) modeling language such as Modelica. Bootstrapping means that the compiler of a language can compile itself. However, the usual application area for the Modelica is modeling and simulation of complex physical systems. Fortunately it turns out that with some minor extensions, the Modelica language is well suited for the modeling of language semantics. We use the name metaModelica for this slightly extended Modelica. This is a prerequisite for bootstrapping which requires that the language can be used to model and/or implement itself. The OpenModelica Compiler (OMC) has been written in this metaModelica language. It originally supported only the standard Modelica language but has been gradually extended to also cover the metaModelica language extensions. After substantial work, OMC is able to quickly compile itself and produces an executable with good performance. The benefits include a more extensible and maintainable compiler by introducing improved language constructs and a more powerful runtime that makes it easy to add functionality such as parser generators, debuggers, and profiling tools. Future work includes extracting and restructuring parts of OMC, making the compiler smaller and more modular and extensible. This will also make it easier to interface with OMC, making it possible to create more powerful and user-friendly OpenModelica-based tools. The compiler and its bootstrapping is a major effort it is currently about 330 000 lines of code, and the metaModelica extensions are used routinely by approximately ten developers on a daily basis.

关键词： compilation equation-based object-oriented meta-programming modeling

来源：评论

学校读者我要写书评

暂无评论

Enabling PHP software engineering research in Rascal

引用

SCIENCE OF COMPUTER programming 2017年 134卷 37-46页

作者： Hills, Mark Klint, Paul Vinju, Jurgen J. East Carolina Univ Greenville NC 27858 USA Ctr Wiskunde & Informat Amsterdam Netherlands INRIA Lille Nord Europe Lille France

Today, PHP is one of the most popular programming languages, and is commonly used in the open source community and in industry to build large application frameworks and web applications. In this paper, we discuss our ongoing work on PHP AiR, a framework for PHP Analysis in Rascal. PHP AiR is focused especially on program analysis and empirical software engineering, and is being used actively and effectively in work on evaluating PHP feature usage and system evolution, on program analysis for refactoring and security validation, and on source code metrics. We describe the requirements and design decisions for PHP AiR, summarize current research using PHP AiR, discuss lessons learned, and briefly sketch future work. (C) 2016 Elsevier B.V. All rights reserved.

关键词： meta-programming Program analysis Empirical software engineering Dynamic languages PHP

来源：评论

学校读者我要写书评

暂无评论

Web-Wide Application Customization: The Case of Mashups

引用

INTERNATIONAL JOURNAL OF INFORMATION SYSTEM MODELING AND DESIGN 2012年第1期3卷 23-47页

作者： Hagemann, Stephan Vossen, Gottfried XING AG Hamburg Germany Univ Munster Munster Germany

Mashups have become popular in recent years in the context of Web 2.0 developments. They represent a way of allowing an application to grow beyond the capabilities of its original developers through an incorporation of external functionality. This paper first introduces several approaches to integrating mashups into the Web pages or services, which commonly implement ways to determine which mashups are potentially relevant for display in a certain Web page context. It then describes in detail a novel approach called ActiveTags, which enables users to create reliable mashups based on tags and hence customized views of Web pages with tagged content. A scenario that demonstrates the potential benefits of this approach is presented. Moreover, a formalization is presented which suitably combines previous work on modeling the Web with relational meta-programming, thereby showing that ActiveTags (as well as related approaches) can conceptually be described in terms of the relational model of data.

关键词： Application Customization Mashups meta-programming Social Tagging Web Customization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：