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

JOURNAL OF THE ACM 2000年第4期47卷 776-822页

作者： Antoy, S Echahed, R Hanus, M Portland State Univ Dept Comp Sci Portland OR 97207 USA CNRS IMAG Leibniz F-38031 Grenoble France Univ Kiel Inst Informat & Prakt Math D-24098 Kiel Germany

The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms. It also plays an important role in the definition of some algorithms of unification module equational theories that are defined by confluent term rewriting systems. Due to the inefficiency of simple narrowing, many refined narrowing strategies have been proposed in the last decade. This paper presents a new narrowing strategy that is optimal in several respects. For this purpose, we propose a notion of a needed narrowing step that, for inductively sequential rewrite systems, extends the Huet and Levy notion of a needed reduction step. We define a strategy, based on this notion, that computes only needed narrowing steps. Our strategy is sound and complete for a large class of rewrite systems, is optimal with respect to the cost measure that counts the number of distinct steps of a derivation, computes only incomparable and disjoint unifiers, and is efficiently implemented by unification.

关键词： call-by-need functional logic programming languages narrowing strategies rewrite systems

来源：评论

学校读者我要写书评

暂无评论

The functional logic language BABEL and its implementation on a graph machine

引用

NEW GENERATION COMPUTING 1996年第4期14卷 391-427页

作者： Kuchen, H Loogen, R MorenoNavarro, JJ RodriguezArtalejo, M UNIV MARBURG FACHGEBIET INFORMAT D-35032 MARBURG GERMANY UNIV POLITECN MADRID FAC INFORMAT E-28660 MADRID SPAIN UNIV COMPLUTENSE MADRID DEPT INFORMAT & AUTOMAT FAC CC MATEMAT E-28040 MADRID SPAIN

The first-order, untyped, functional logic language Babel is extended by polymorphic types and higher order functios. A sophisticated incompatibility check which is used to guarantee nonambiguity of BABEL programs is presented. For the implementation of the language, unification and backtracking are integrated in a programmed (functional) graph reduction machine. The implementation of this machine has been used for a comparison between Babel and PROLOG based on the runtimes of some example programs.

关键词： functional logic programming languages abstract machine innermost graph narrowing

来源：评论

学校读者我要写书评

暂无评论

A Modular and Generic Analysis Server System for functional logic Programs 14

A Modular and Generic Analysis Server System for Functional ...

引用

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM)

作者： Hanus, Michael Skrlac, Fabian Univ Kiel Kiel Germany

ISBN: (纸本)9781450326193

We present the design, implementation, and application of a system, called CASS, for the analysis of functional logic programs. The system is generic so that various kinds of analyses (e.g., groundness, non-determinism, demanded arguments) can be easily integrated. In order to analyze larger applications consisting of dozens or hundreds of modules, CASS supports a modular and incremental analysis of programs. Moreover, it can be used by different programming tools, like documentation generators, analysis environments, program optimizers, as well as Eclipse-based development environments. For this purpose, CASS can also be invoked as a server system to get a language-independent access to its functionality. CASS is completely implemented in the functional logic language Curry as a master/worker architecture to exploit parallel or distributed execution environments.

关键词： functional logic programming languages program analysis implementation

来源：评论

学校读者我要写书评

暂无评论

Set Functions for functional logic programming

Set Functions for Functional Logic Programming

引用

11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative programming (PPDP 09)

作者： Antoy, Sergio Hanus, Michael Portland State Univ Dept Comp Sci Portland OR 97207 USA

ISBN: (纸本)9781605585680

We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the results of a corresponding ordinary operation. A characteristic feature of our approach is the complete separation between a usually-non-deterministic operation and its possibly-non-deterministic arguments. This separation leads to the first provably order-independent approach to computing the set of values of non-deterministic expressions. The proof is provided within the framework of graph rewriting in constructor-based systems. We propose an abstract implementation of our approach and prove its independence of the order of evaluation. Our approach solves easily and naturally problems mishandled by current implementations of functional logic languages.

关键词： functional logic programming languages Non-Determinism Subspaces Rewrite Systems

来源：评论

学校读者我要写书评

暂无评论

A demand-driven narrowing calculus with overlapping definitional trees 03

A demand-driven narrowing calculus with overlapping definiti...

引用

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming

作者： Rafael del Vado Vírseda Universidad Complutense de Madrid Madrid Spain

ISBN: (纸本)9781581137057

We propose a demand-driven conditional narrowing calculus in which a variant of definitional trees [2] is used to efficiently control the narrowing strategy. This calculus is sound and strongly complete w.r.t. Constructor-based ReWriting logic (CRWL) semantics [7] for a wide class of constructor-based conditional term rewriting systems. The calculus mantains the optimality properties of the needed narrowing strategy [5]. Moreover, the treatment of strict equality as a primitive rather than a defined function symbol, leads to an improved behaviour w.r.t. needed narrowing.

关键词： functional logic programming languages rewrite systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：