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

PPDP'06 - 8th acm sigplan symposium on principles and practice of Declarative programming

作者： Gabbay, Murdoch J. Mathijssen, Aad Dept. of Computer Science Heriot-Watt University Riccarton Edinburgh EH14 4AS United Kingdom P.O. Box 513 5600 MB Eindhoven Netherlands

ISBN: (纸本)1595933883

the practice of first-order logic is replete with meta-level concepts. Most notably there are the meta-variables themselves (ranging over predicates, variables, and terms), assumptions about freshness of variables with respect to these meta-variables, alpha-equivalence and capture-avoiding substitution. We present one-and-a-halfth-order logic, in which these concepts are made explicit. We exhibit both algebraic and sequent specifications of one-and-a-halfth-order logic derivability, show them equivalent, show that the derivations satisfy cut-elimination, and prove correctness of an interpretation of first-order logic within it. We discuss the technicalities in a wider context as a case-study for nominal algebra, as a logic in its own right, as an algebraisation of logic, as an example of how other systems might be treated, and also as a theoretical foundation for future implementation. Copyright © 2006 acm.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

PPDP'06 - Proceedings of the Eight acm sigplan symposium on principles and practice of Declarative programming

PPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on ...

引用

PPDP'06 - 8th acm sigplan symposium on principles and practice of Declarative programming

ISBN: (纸本)1595933883

the proceedings contain 24 papers. the topics discussed include: typed polyadic pi-calculus in bigraphs;combining Fuzzy logic and behavioral similarity for non-strict program validation;type oriented construction of web user interfaces;an abductive framework for A-priori verification of web services;an efficient algorithms for XML type projection;type inference for spreadsheets;polymorphic algebraic data type reconstruction;extracting programs from type class proofs;computing constructor forms with non terminating rewrite programs;open data types and open functions;a historic functional and object-oriented calculus;combining algorithmic debugging and program slicing;practical type inference based on success typings;collection analysis for Horn clause programs;a model type system for multi-level generating extensions with persistent code;a type system equivalent to static single assignment;and poly-controlled partial evaluation.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Computing constructor forms with non terminating rewrite programs 06

Computing constructor forms with non terminating rewrite pro...

引用

PPDP'06 - 8th acm sigplan symposium on principles and practice of Declarative programming

作者： Gnaedig, Isabelle Kirchner, Hélène LORIA-INRIA 615 rue du Jardin Botanique F-54602 Villers-les-Nancy Cedex France LORIA-CNRS Campus Scientifique BP 239 F-54506 Vandoeuvre-les-Nancy Cedex France

ISBN: (纸本)1595933883

In the context of the study of rule-based programming, we focus in this paper on the property of C-reducibility, expressing that every term reduces to a constructor term on at least one of its rewriting derivations. this property implies completeness of function definitions, and enables to stop evaluations of a program on a constructor form, even if the program is not terminating. We propose an inductive procedure proving C-reducibility of rewriting. the rewriting relation on ground terms is simulated through an abstraction mechanism and narrowing. the induction hypothesis allows assuming that terms smaller than the starting terms rewrite into a constructor term. the existence of the induction ordering is checked during the proof process, by ensuring satisfiability of ordering constraints. the proof is constructive, in the sense that the branch leading to a constructor term can be computed from the proof trees establishing C-reducibility for every term. Copyright © 2006 acm.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

A modal type system for multi-level generating extensions with persistent code 06

A modal type system for multi-level generating extensions wi...

引用

PPDP'06 - 8th acm sigplan symposium on principles and practice of Declarative programming

作者： Yuse, Yosihiro Igarashi, Atsushi Graduate School of Informatics Kyoto University Japan

Multi-level generating extensions, studied by Glück and J8;rgensen, are generalization of (two-level) program generators, such as parser generators, to arbitrary many levels. By this generalization, the notio... 详细信息

ISBN: (纸本)1595933883

Multi-level generating extensions, studied by Glück and Jørgensen, are generalization of (two-level) program generators, such as parser generators, to arbitrary many levels. By this generalization, the notion of persistent code - a quoted code fragment that can be used for different stages - naturally arises. In this paper we propose a typed lambda calculus λ, based on linear-time temporal logic, as a basis of programming languages for multi-level generating extensions with persistent code. the key idea of the type system is correspondence of (1) linearly ordered times in the logic to computation stages;(2) a formula A (next A) to a type of code that runs at the next stage;and (3) a formula A (always A) to a type of persistent code executable at and after the current stage. After formalizing λ, we prove its key property of time-ordered normalization that a well-typed program can never go back to a previous stage in a "time-ordered" execution, as well as basic properties such as subject reduction, confluence and strong normalization. Commuting conversion plays an important role for time-ordered normalization to hold. Copyright © 2006 acm.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

A type system equivalent to static single assignment 06

A type system equivalent to static single assignment

引用

PPDP'06 - 8th acm sigplan symposium on principles and practice of Declarative programming

作者： Matsuno, Yutaka Ohori, Atsushi Research Institute of Electrical Communication Tohoku University Japan

ISBN: (纸本)1595933883

this paper develops a static type system equivalent to static single assignment (SSA) form. In this type system, a type of a variable at some program point represents the control flows from the assignment statements that reach the program point. For this type system, we show that a derivable typing of a program corresponds to the program in SSA form. By this result, any SSA transformation can be interpreted as a type inference process in our type system. By adopting a result on efficient SSA transformation, we develop a type inference algorithm that reconstructs a type annotated code from a given code. these results provide a static alternative to SSA based compiler optimization without performing code transformation. Since this process does not change the code, it does not incur overhead due to insertion of φ functions. Another advantage of this type based approach is that it is not constrained to naming mechanism of variables and can therefore be combined with other static properties useful for compilation and code optimization such as liveness information of variables. As an application, we express optimizations as type-directed code transformations. Copyright © 2006 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Combining fuzzy logic and behavioral similarity for non-strict program validation 06

Combining fuzzy logic and behavioral similarity for non-stri...

引用

PPDP'06 - 8th acm sigplan symposium on principles and practice of Declarative programming

作者： De Roover, Coen Brichau, Johan D'Hondt, theo Programming Technology Lab. Vrije Universiteit Brussel Belgium Laboratoire d'Informatique Fondamentale Université de Lille France

ISBN: (纸本)1595933883

the quality of an application's implementation can be assured by validating the presence or absence of a set of user-prescribed software patterns such as software engineering best practices, programming conventions and indications of poor programming. Most of the existing pattern detection techniques, however, interpret pattern descriptions in an inflexible manner, leaving the quality assurance tool to approve only the most strictly adhering pattern implementations. In order to detect various concrete pattern implementations using a single pattern description, we have combined logic meta programming - wherein patterns can be expressed as constraints over facts representing a program's source code-, fuzzy logic and static program analysis in a way that is completely transparent to the end-user. We have achieved this by having the conditions in a logic rule interpreted as constraints over the run-time behavior source code constructs give rise to instead of as constraints over the literal source code constructs themselves. this way, a pattern's abstract description often suffices to recognize various concrete implementation variants with an indication of the similarity between the recognized implementation and the abstract pattern description. Copyright © 2006 acm.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

Condate: A proto-language at the confluence between checking and compiling

Condate: A proto-language at the confluence between checking...

引用

PPDP'06 - 8th acm sigplan symposium on principles and practice of Declarative programming

作者： Volanschi, Nic Mygcc

ISBN: (纸本)1595933883

Recent years have seen the advent of many different tools for program checking against user-defined properties. Despite this encouraging trend, checking technology is used still marginally today, and only on an occasional basis. Existing checkers are standalone tools, associated - correctly or not - with low efficiency, and duplicating much work already done in the compiler. We believe that, as a complement to more precise verifiers, the next generation of compilers should integrate some amount of user-defined checks that can be performed efficiently. Combining checking and compiling enables a pervasive propagation of checking technology and continuous use of checking throughout development. It also enables cross-fertilization between the two passes, resulting in increased expressiveness, precision, and even in improved complexity of the checking algorithm. We illustrate this integrated approach with a full-fledged checking compiler for C, extensible through Condate. Condate is a declarative language for expressing simple user-defined program properties to be checked in addition to normal compilation. Condate mixes in a very concise form syntactic, semantic, control flow, and data flow properties. these properties are defined as a new class of regular path expressions over the control-flow graph, checkable in linear time and covering many useful checks. We demonstrate the viability of the integrated approach based on Condate by applying it to successfully check some parts of the Linux kernel. Copyright © 2006 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Poly-controlled partial evaluation 06

Poly-controlled partial evaluation

引用

PPDP'06 - 8th acm sigplan symposium on principles and practice of Declarative programming

作者： Puebla, Germaán Ochoa, Claudio School of Computer Science Technical University of Madrid 28660 Boadilla del Monte Spain

ISBN: (纸本)1595933883

Existing algorithms for on-line partial evaluation of logic programs, given an initial program and a description of run-time queries, deterministically produce a specialized program. In this work we propose a novel framework for partial evaluation of logic programs which is poly-controlled in that it can take into account repertoires of global control and local control rules instead of a single, predetermined combination. this approach is more flexible than existing ones since it allows assigning different global and local control rules to different call patterns, thus obtaining results that cannot be obtained using traditional partial evaluation. this modification transforms partial evaluation from a greedy algorithm into a search-based algorithm and, as a result, sets of candidate specialized programs can be achieved, instead of a single one. In order to make the algorithm fully automatic, it requires the use of self-tuning techniques which allow automatically measuring the quality of the different candidate specialized programs. Our approach is resource aware in that it uses fitness functions which consider multiple factors such as run-time and code size for the specialized programs. the framework has been implemented in the CiaoPP system, and tested on some benchmarks. the preliminary experimental results we present show that our proposal obtains better specializations than those achieved using traditional partial evaluation. Copyright © 2006 acm.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Teaching parallel computing to science faculty: Best practices and common pitfalls

Teaching parallel computing to science faculty: Best practic...

引用

2006 acm sigplan symposium on principles and practice of parallel programming, PPOPP'06

作者： Joiner, David A. Gray, Paul Murphy, thomas Peck, Charles Kean University 1000 Morris Ave Union NJ 07083 University of Northern Iowa 1227 West 27th St Cedar Falls IA 50614 Contra Costa College 2600 Mission Bell Dr San Pablo CA 94806 Earlham College 801 National Rd West Richmond IN 47374

ISBN: (纸本)1595931899

In 2002, we first brought High Performance Computing (HPC) methods to the college classroom as a way to enrich Computational Science education. through the years, we have continued to facilitate college faculty in science, technology, engineering, and mathematics (STEM) disciplines to stay current with HPC methodologies. We have accomplished this by designing and delivering faculty workshops, hosted in a variety of lab settings, as well as by developing tools supporting the technical infrastructure necessary for HPC education, all this without requiring access to traditional HPC computing platforms. In all, we have so far presented 16 professional development workshops for close to 400 predominantly undergraduate STEM faculty. this paper presents the result of internal formative evaluation by workshop instructors and the materials and tools developed during that process. We did this work as part of the National Computational Science Institute (NCSI) and in collaboration with the following groups: the Minority Serving Institutions - High Performance Computing (MSI-HPC) program of the National Computational Science Alliance the Consortium for Computing Sciences in Colleges (CCSC) the Center for Excellence in High Performance Computing the Oklahoma University Supercomputing symposium series the Super Computing (SC) conference series education program We presented learners with a sequence of interactive, "run it, modify it, build it" open-ended lab exercises drawn from a variety of disciplines. Interactivity means having the ability to change parallel and algorithmic parameters, e.g. running software on more than one machine, using different models, refining the model, changing the problem scale, using different parallel algorithms. there is a lack of scientific parallel curricula suitable for illustrating Computational Science principles in the classroom. We addressed this need by locating, and where necessary creating, suitable open source software, data-sets, and cur

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

PPDP'06 - Proceedings of the Eight acm sigplan symposium on principles and practice of Declarative programming: Foreword

PPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on ...

引用

PPDP'06 - Proceedings of the Eight acm sigplan symposium on principles and practice of Declarative programming 2006年 2006卷 iii页

作者： Maher, Michael National ICI Australia University of NSW Australia

No abstract available

ISBN: (纸本)1595933883

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：