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

Constraint functional logic programming over finite domains

THEORY AND PRACTICE OF logic programming 2007年第5期7卷 537-582页

作者： Fernandez, Antonio J. Univ Malaga Dpto Lenguajes & Ciencias Computac E-29071 Malaga Spain Univ Complutense Madrid Dpto Sistemas Informat & Programac E-28040 Madrid Spain

In this paper, we present our proposal to Constraint functional logic programming over Finite Domains (CFLP(FD)) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP(FD)) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints. We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe TOY(FD), an implementation for CFLP(FD), and a comparison of our approach with respect to CLP(FD) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existing CLP(FD) systems and that clearly outperforms the closer approach to CFLP(FD).

关键词： constraint logic programming functional logic programming finite domains

来源：评论

学校读者我要写书评

暂无评论

A proof theoretic approach to failure in functional logic programming

引用

THEORY AND PRACTICE OF logic programming 2004年第1-2期4卷 41-74页

作者： López-Fraguas, FJ Sánchez-Hernández, J Univ Complutense Madrid Dept Sistemas Informat & Programac E-28040 Madrid Spain

How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic perspective. The starting point of our work is CRWL (Constructor based ReWriting logic), a well established theoretical framework for functional logic programming, whose fundamental notion is that of non-strict non-deterministic function. We present a proof calculus, CRWLF, which is able to deduce negative information from CRWL-programs. In particular, CRWLF is able to prove 'finite' failure of reduction within CRWL.

关键词： constructive failure functional logic programming proof calculi

来源：评论

学校读者我要写书评

暂无评论

A general framework for lazy functional logic programming with algebraic polymorphic types

引用

THEORY AND PRACTICE OF logic programming 2001年第2期1卷 185-245页

作者： Arenas-Sánchez, P Rodríguez-Artalejo, M Univ Complutense Madrid Dpto Sist Informat & Program Madrid 28040 Spain

We propose a general framework for first-order functional logic programming, supporting lazy functions, non-determinism and polymorphic datatypes whose data constructors obey a set C of equational axioms. On top of a given C, we specify a program as a set R of C-based conditional rewriting rules for defined functions. We argue that equational logic does not supply the proper semantics for such programs. Therefore, we present an alternative logic which includes W-based rewriting calculi and a notion of model. We get soundness and completeness for C-based rewriting w.r.t. models, existence of free models for all programs, and type preservation results. As operational semantics, we develop a sound and complete procedure for goal solving, which is based on the combination of lazy narrowing with unification modulo C. Our framework is quite expressive for many purposes, such as solving action and change problems, or realizing the GAMMA computation model.

关键词： functional logic programming polymorphic types algebraic data constructor lazy narrowing

来源：评论

学校读者我要写书评

暂无评论

Constructing a bidirectional transformation between BPMN and BPEL with a functional logic programming language

引用

JOURNAL OF VISUAL LANGUAGES AND COMPUTING 2011年第1期22卷 66-89页

作者： Mazanek, Steffen Hanus, Michael Univ Bundeswehr Munchen Munich Germany Univ Kiel D-24098 Kiel Germany

In this article we show how functional logic programming techniques can be used to construct a bidirectional transformation between structured process models of the business process modeling notation (BPMN) and executable models of the business process execution language (BPEL). We specify the abstract syntax of structured process models by a context-free hypergraph grammar. This grammar can be subsequently transformed into a graph parser using our previously developed GRAPPA framework of functional logic GRAPh PArser combinators. The GRAPPA framework has been implemented using the functional logic programming language Curry. Furthermore, we show how the constructed parsers can be enriched with semantic computations as required for the synthesis of BPEL from BPMN. Since our parser is a function implemented in a functional logic language, it can be applied in both directions. Thus, given a BPEL model, a corresponding BPMN graph can be constructed with the very same parser. Finally, logic-based parsers can be used for model completion and language generation in a straightforward way. In order to be self-contained, this article also surveys context-free hypergraph grammars, the concepts of the programming language Curry, the example languages BPMN and BPEL. and the ideas of the GRAPPA framework Actually, this article is a literate Curry program and, as such, directly executable. Thus, it contains the complete concise source code of our application. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Graph parsing functional logic programming Parser combinators Curry Business process models BPMN BPEL

来源：评论

学校读者我要写书评

暂无评论

Evaluation strategies for functional logic programming

引用

JOURNAL OF SYMBOLIC COMPUTATION 2005年第1期40卷 875-903页

作者： Antoy, S Portland State Univ Dept Comp Sci Portland OR 97207 USA

Recent advances in the foundations and the implementations of functional logic programming languages originate from far-reaching results on narrowing evaluation strategies. Narrowing is a computation similar to rewriting which yields substitutions in addition to normal forms. In functional logic programming, the classes of rewrite systems to which narrowing is applied are, for the most part, subclasses of the constructor-based, possibly conditional, rewrite systems. Many interesting narrowing strategies, particularly for the smallest subclasses of the constructor-based rewrite systems, are generalizations of well-known rewrite strategies. However, some strategies for larger non-confluent subclasses have been developed just for functional logic computations. This paper discusses the elements that play a relevant role in evaluation strategies for functional logic computations, describes some important classes of rewrite systems that model functional logic programs, shows examples of the differences in expressiveness provided by these classes, and reviews the characteristics of narrowing strategies proposed for each class of rewrite systems. (c) 2005 Elsevier Ltd. All rights reserved.

关键词： evaluation strategies narrowing definitional trees constructor-based rewrite systems functional logic programming

来源：评论

学校读者我要写书评

暂无评论

A Proposal for the Cooperation of Solvers in Constraint functional logic programming

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年 188卷 37-51页

作者： Estevez-Martin, S. Fernandez, A. J. Hortala-Gonzalez, T. Rodriguez-Artalejo, M. Saenz-Perez, F. del Vado-Virseda, R. Univ Complutense Madrid Dept Sistemas Informaticos & Programac Madrid Spain Univ Malaga Dept Lenguajes & Ciencias Computac Malaga Spain

This paper presents a proposal for the cooperation of solvers in constraint functional logic programming, a quite expressive programming paradigm which combines functional, logic and constraint programming using constraint lazy narrowing as goal solving mechanism. Cooperation of solvers for different constraint domains can improve the efficiency of implementations since solvers can take advantage of other solvers' deductions. We restrict our attention to the cooperation of three solvers, dealing with syntactic equality and disequality constraints, real arithmetic constraints, and finite domain (FD) constraints, respectively. As cooperation mechanism, we consider to propagate to the real solver the constraints which have been submitted to the FD solver (and viceversa), imposing special communication constraints to ensure that both solvers will allow the same integer values for all the variables involved in the cooperation.

关键词： Cooperating Solvers Constraints functional logic programming Lazy Narrowing Implementation

来源：评论

学校读者我要写书评

暂无评论

Qualified Computations in functional logic programming

Qualified Computations in Functional Logic Programming

引用

25th International Conference on logic programming (ICLP)

作者： Caballero, Rafael Rodriguez-Artalejo, Mario Romero-Diaz, Carlos A. Univ Complutense Fac Informat Dept Sistemas Informat & Computac E-28040 Madrid Spain

ISBN: (纸本)9783642028458

Qualification has been recently introduced as a generalization Of uncertainty in the field of logic programming. In this paper we investigate a more expressive language for First-Order functional logic programming with Constraints and Qualification. We present a Rewriting logic which characterizes the intended semantics of programs, and a prototype implementation based on a semantically correct, program transformation. Potential applications of the resulting language include flexible information retrieval. As a concrete illustration, we show how to write program rules to compute qualified answers for user queries concerning the books available in a given library.

关键词： Constraints functional logic programming Program Transformation Qualification Rewriting logic

来源：评论

学校读者我要写书评

暂无评论

TOWARDS A PARALLEL VIRTUAL MACHINE FOR functional logic programming

TOWARDS A PARALLEL VIRTUAL MACHINE FOR FUNCTIONAL LOGIC PROG...

引用

26th International Conference on logic programming (ICLP)

作者： Alqaddoumi, Abdulla New Mexico State Univ Dept Comp Sci MSC CS POB 30001 Las Cruces NM 88003 USA

ISBN: (纸本)9783939897170

functional logic programming is a multi-paradigm programming that combines the best features of functional programming and logic programming. functional programming provides mechanisms for demand-driven evaluation, higher order functions and polymorphic typing. logic programming deals with non-determinism, partial information and constraints. Both programming paradigms fall under the umbrella of declarative programming. For the most part, the current implementations of functional logic languages belong to one of two categories: (1) Implementations that include the logic programming features in a functional language. (2) Implementations that extend logic languages with functional programming features. In this paper we describe the undergoing research efforts to build a parallel virtual machine that performs functional logic computations. The virtual machine will tackle several issues that other implementations do not tackle: (1) Sharing of sub-terms among different terms especially when such sub-terms are evaluated to more than one value (non-determinism). (2) Exploitation of all forms of parallelism present in computations. The evaluation strategy used to evaluate functional logic terms is needed narrowing, which is a complete and sound strategy.

关键词： functional logic programming term rewriting system non-determinism needed narrowing and-parallelism or-parallelism

来源：评论

学校读者我要写书评

暂无评论

Implementing a functional logic programming Language via the Fair Scheme

Implementing a Functional Logic Programming Language via the...

引用

作者： Jost, Andrew Michael Portland State University

学位级别：Ph.D., Doctor of Philosophy

This document presents a new compiler for the functional logic programming language Curry based on a novel pull-tabbing evaluation strategy called the Fair Scheme. A simple version of the Fair Scheme is proven sound, complete, and optimal. An elaborated version is also developed, which supports narrowing computations and other features of Curry, such as constraint programming, equational constraints, and set functions. The Fair Scheme is used to develop a new Curry system called Sprite, a high-quality, performant implementation whose aims are to promote practical uses of Curry and to serve as a laboratory for further research. An important aspect of Sprite is its integration with the popular imperative language Python. This combination allows one to write hybrid programs in which the programmer may move between declarative and non-declarative styles with relative ease. Benchmarking data show Sprite to be more complete than other Curry systems and competitive in terms of execution time, particularly for non-deterministic programs.

关键词： Curry functional logic programming Non-determinism Pull tabbing Set functions

来源：评论

学校读者我要写书评

暂无评论

Collaborative constraint functional logic programming system in an open environment

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2003年第1期E86D卷 63-70页

作者： Kobayashi, N Marin, M Ida, T Univ Tsukuba Doctoral Program Engn Tsukuba Ibaraki 3058573 Japan Univ Tsukuba Inst Informat Sci Tsukuba Ibaraki 3058573 Japan

In this paper we describe collaborative constraint functional logic programming and the system called Open CFLP that supports this programming paradigm. The system solves equations by collaboration of various equational constraint solvers. The solvers include higher-order lazy narrowing calculi that serve as the interpreter of higher-order functional logic programming, and specialized solvers for solving equations over specific domains, such as a polynomial solver and a differential equation solver. The constraint solvers are distributed in an open environment such as the Internet. They act as providers of constraint solving services. The collaboration between solvers is programmed in a coordination language embedded in a host language. In Open CFLP the user can solve equations in a higher-order functional logic programming style and yet exploit solving resources in the Internet without giving low-level programs of distributions of resources or specifying details of solvers deployed in the Internet.

关键词： equational solving functional logic programming solver collaboration constraint solving CORBA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：