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

16th ACM SIGPLAN International Conference on Functional programming (ICFP 11)

作者： Pouillard, Nicolas INRIA Paris France

ISBN: (纸本)9781450308656

De Bruijn indices are a well known technique for programming with names and binders. They provide a representation that is both simple and canonical. However, programming errors tend to be really easy to make. We propose a safer programming interface implemented as a library. Whereas indexing the types of names and terms by a numerical bound is a famous technique, we index them by worlds, a different notion of index that is both finer and more abstract. While being more finely typed, our approach incurs no loss of expressiveness or efficiency. Via parametricity we obtain properties about functions polymorphic on worlds. For instance, well-typed world-polymorphic functions over open lambda-terms commute with any renaming of the free variables. Our whole development is conducted within Agda, from the code of the library, to its soundness proof and the properties of external functions. The soundness of our library is demonstrated via the construction of a logical relations argument.

关键词： Design Languages Theory names binders meta-programming name abstraction de Bruijn indices

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

MULTI-SEMANTIC APPROACH TOWARDS A GENERIC FORMAL SOLVER OF TOOL PLACEMENT FOR PERCUTANEOUS SURGERY

MULTI-SEMANTIC APPROACH TOWARDS A GENERIC FORMAL SOLVER OF T...

引用

1st International Conference on Knowledge Engineering and Ontology Development

作者： Essert-Villard, Caroline Baegert, Claire Schreck, Pascal Univ Strasbourg LSIIT F-67412 Illkirch Graffenstaden France

ISBN: (纸本)9789896740122

In this paper, we study the multiple points of view when generalizing a method based on many criteria optimization, in the framework of percutaneous surgery planning. The aim of the prototype is to find an optimal position of surgical tools to help the surgeons in planning the intervention. We explain how, with a formal geometric solver and meta programming, we intend to build a modular tool, capable of being extended to new interventions, with few programming efforts.

关键词： Constraint solving Surgery planning meta-programming

来源：评论

学校读者我要写书评

暂无评论

A Rewrite System for Proof Constructivization 16

A Rewrite System for Proof Constructivization

引用

11th Workshop on Logical Frameworks and meta-Languages Theory and Practice

作者： Cauderlier, Raphael Inria CNAM Cachan France

ISBN: (纸本)9781450347778

Proof constructivization is the problem of automatically extracting constructive proofs out of classical proofs. This process is required when classical theorem provers are integrated in intuitionistic proof assistants. We use the ability of rewrite systems to represent partial functions to implement heuristics for proof constructivization in Dedukti, a logical framework based on rewriting in which proofs are first-class objects which can be the subject of computation. We benchmark these heuristics on the proofs output by the automated theorem prover Zenon on the TPTP library of problems.

关键词： rewriting confluence intuitionistic logic Dedukti logical framework meta-programming

来源：评论

学校读者我要写书评

暂无评论

A C Subset for Ergonomic Source-to-Source Analyses and Transformations 24

A C Subset for Ergonomic Source-to-Source Analyses and Trans...

引用

Rapido Workshop on Rapid Simulation and Performance Evaluation - Methods and Tools (Rapido) / HiPEAC Conference

作者： Matos, Joao N. Bispo, Joao Sousa, Luis Miguel Univ Porto Porto Portugal Univ Porto INESC TEC Porto Portugal

ISBN: (纸本)9798400717918

Modern compiled software, written in languages such as C, relies on complex compiler infrastructure. However, developing new transformations and improving existing ones can be challenging for researchers and engineers. Often, transformations must be implemented bymodifying the compiler itself, which may not be feasible, for technical or legal reasons. Source-to-source compilers make it possible to directly analyse and transform the original source, making transformations portable across different compilers, and allowing rapid research and prototyping of code transformations. However, this approach has the drawback of exposing the researcher to the full breadth of the source language, which is often more extensive and complex than the IRs used in traditional compilers. In this work, we propose a solution to tame the complexity of the source language and make source-to-source compilers an ergonomic platform for program analysis and transformation. We define a simpler subset of the C language that can implement the same programs with fewer constructs and implement a set of sourceto-source transformations that automatically normalise the input source code into equivalent programs expressed in the proposed subset. Finally, we implement a function inlining transformation that targets the subset as a case study. We show that for this case study, the assumptions afforded by using a simpler language subset greatly improves the number of cases the transformation can be applied, increasing the average success rate from 37%, before normalisation, to 97%, after normalisation. We also evaluate the performance of several benchmarks after applying a naive inlining algorithm, and obtained a 12% performance improvement in certain applications, after compiling with the flag O2, both in Clang and GCC, suggesting there is room for exploring source-level transformations as a complement to traditional compilers.

关键词： Compilers Source-to-source meta-programming C

来源：评论

学校读者我要写书评

暂无评论

metaFJIG A meta-Circular Composition Language for Java-like Classes 10

METAFJIG A Meta-Circular Composition Language for Java-like ...

引用

Conference on Object Oriented programming Systems, Languages and Applications/SPLASH 2010

作者： Servetto, Marco Zucca, Elena Univ Genoa Dipartimento Informat & Sci Informazi Genoa Italy

ISBN: (纸本)9781450302036

We propose a Java-like language where class definitions are first class values and new classes can be derived from existing ones by exploiting the full power of the language itself, used on top of a small set of primitive composition operators, instead of using a fixed mechanism like inheritance. Hence, compilation requires to perform (meta-) reduction steps, by a process that we call compile-time execution. This approach differs from meta-programming techniques available in mainstream languages since it is meta-circular, hence programmers are not required to learn new syntax and idioms. Compile-time execution is guaranteed to be sound (not to get stuck) by a lightweight technique, where class composition errors are detected dynamically, and conventional typing errors are detected by interleaving typechecking with meta-reduction steps. This allows for a modular approach, that is, compile-time execution is defined, and can be implemented, on top of typechecking and execution of the underlying language. Moreover, programmers can handle errors due to composition operators. Besides soundness, our technique ensures an additional important property called meta-level soundness, that is, typing errors never originate from (meta-) code in already compiled programs.

关键词： Languages Java meta-programming module composition

来源：评论

学校读者我要写书评

暂无评论

Philosophy-Guided Modelling and Implementation of Adaptation and Control in Complex Systems

Philosophy-Guided Modelling and Implementation of Adaptation...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) / IEEE World Congress on Computational Intelligence (IEEE WCCI) / International Joint Conference on Neural Networks (IJCNN) / IEEE Congress on Evolutionary Computation (IEEE CEC)

作者： Del Fabbro, Olivier Christen, Patrik Swiss Fed Inst Technol Chair Philosophy Zurich Switzerland FHNW Inst Informat Syst Olten Switzerland

ISBN: (数字)9781728186719

ISBN: (纸本)9781728186719

Control was from its very beginning an important concept in cybernetics. Later on, with the works of W. Ross Ashby, for example, biological concepts such as adaptation were interpreted in the light of cybernetic systems theory. Adaptation is the process by which a system is capable of regulating or controlling itself in order to adapt to changes of its inner and outer environment maintaining a homeostatic state. In earlier works we have developed a system metamodel that on the one hand refers to cybernetic concepts such as structure, operation, and system, and on the other to the philosophy of individuation of Gilbert Simondon. The result is the so-called allagmatic method that is capable of creating concrete models of systems such as artificial neural networks and cellular automata starting from abstract building blocks. In this paper, we add to our already existing method the cybernetic concepts of control and especially adaptation. In regard to the system metamodel, we rely again on philosophical theories, this time the philosophy of organism of Alfred N. Whitehead. We show how these new meta-theoretical concepts are described formally and how they are implemented in program code. We also show what role they play in simple experiments. We conclude that philosophical abstract concepts help to better understand the process of creating computer models and their control and adaptation. In the outlook we discuss how the allagmatic method needs to be extended in order to cover the field of complex systems and Norbert Wiener's ideas on control.

关键词： adaptation control complex systems modelling and simulation cybernetics meta-modelling meta-programming philosophy of individuation philosophy of organism

来源：评论

学校读者我要写书评

暂无评论

A logic foundation for a general-purpose history querying tool

引用

SCIENCE OF COMPUTER programming 2014年第Part1期96卷 107-120页

作者： Stevens, Reinout De Roover, Coen Noguera, Carlos Kellens, Andy Jonckers, Viviane Vrije Univ Brussel B-1050 Brussels Belgium

Version control systems (VCS) have become indispensable software development tools. The version snapshots they store to provide support for change coordination and release management, effectively track the evolution of the versioned software and its development process. Despite this wealth of historical information, it has only been leveraged by tools that are dedicated to a specific task such as empirical validation of software engineering practices or fault prediction. General-purpose tool support for reasoning about the historical information stored in a version control system is limited. This paper provides a comprehensive description of a logic-based, general-purpose history query tool called ABSINTHE. ABSINTHE supports querying versioned Smalltalk system using logic queries in which quantified regular path expressions are embedded. These expressions lend themselves to specifying the properties that each individual version in a sequence of successive software versions ought to exhibit. To demonstrate the general-purpose nature of our history query tool, we use it to verify development process constraints, to identify temporal bad smells and to answer questions that developers commonly ask. Finally, we compare a query written in ABSINTHE to an equivalent one written in Smalltalk. (C) 2014 Elsevier B.V. All rights reserved.

关键词： History queries meta-programming Smalltalk Logic programming Program analysis

来源：评论

学校读者我要写书评

暂无评论

Pattern Matching in an Open World 2018

Pattern Matching in an Open World

引用

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

作者： Zhang, Weixin Oliveira, Bruno C. d. S. Univ Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781450360456

Pattern matching is a pervasive and useful feature in functional programming. There have been many attempts to bring similar notions to Object-Oriented programming (OOP) in the past. However, a key challenge in OOP is how pattern matching can coexist with the open nature of OOP data structures, while at the same time guaranteeing other desirable properties for pattern matching. This paper discusses several desirable properties for pattern matching in an OOP context and shows how existing approaches are lacking some of these properties. We argue that the traditional semantics of pattern matching, which is based on the order of patterns and adopted by many approaches, is in conflict with the openness of data structures. Therefore we suggest that a more restricted, top-level pattern matching model, where the order of patterns is irrelevant, is worthwhile considering in an OOP context. To compensate for the absence of ordered patterns we propose a complementary mechanism for case analysis with defaults, which can be used when nested and/or multiple case analysis is needed. To illustrate our points we develop CASTOR: a meta-programming library in Scala that adopts both ideas. CASTOR generates code that uses type-safe extensible visitors, and largely removes boilerplate code typically associated with visitors. We illustrate the applicability of our approach with a case study modularizing the interpreters in the famous book "Types and programming Languages".

关键词： Pattern matching meta-programming OOP

来源：评论

学校读者我要写书评

暂无评论

The Adaptability in Complex Software Systems

The Adaptability in Complex Software Systems

引用

2008 Conference on Human System Interactions

作者： Bandakova, Jana Tech Univ Kosice Dept Comp & Informat Kosice Slovakia

ISBN: (纸本)9781424415427

The first step in development of complex software system is to model the properties of target system. An evolution of software system starts already in human mind in the form of abstract ideas. The programmer tries to express these abstract ideas in the form of running software system using one of existing modeling tools and paradigms. But with a time, ideas about approach that was used during system development lose and we have only conception of target solution. If there are some changes to software system, the system is not able to generate the concept of its changes to a human. There is a question, how it is possible that system creates the concept of itself to a human? Our idea is that the system can create such concept through the model that the human will be able to adapt and make changes to a system.

关键词： adaptability complex software system meta-programming modularity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：