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

19th International Conference on Knowledge Engineering and Knowledge Management (EKAW)

作者： Nickles, Matthias Natl Univ Ireland Insight Ctr Data Analyt Galway Ireland Natl Univ Ireland Dept Informat Technol Galway Ireland

ISBN: (纸本)9783319137049;9783319137032

We propose a unified approach to semantically rich knowledge representation, querying and exchange for the Web, based on functional-logic programming. JavaScript- and JSON-based so-called information scripts serve as a unified knowledge representation and query format, with logical reasoning being a constraint solving or narrowing task. This way, our framework provides a highly versatile, easy to use and radically different alternative compared to conventional forms of knowledge representation and exchange for the Web.

关键词： Knowledge representation JSON-LD JSON JavaScript functional-logic programming Relational programming Linked Data Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Safe typing of functional logic programs with opaque patterns and local bindings.

引用

INFORMATION AND COMPUTATION 2014年 235卷 36-69页

作者： Lopez-Fraguas, Francisco J. Martin-Martin, Enrique Rodriguez-Hortala, Juan Univ Complutense Madrid Dept Sistemas Informat & Comp Fac Informat E-28040 Madrid Spain

Type systems are widely used in programming languages as a powerful tool providing safety to programs. functional logic languages have inherited Damas-Milner type system from their functional part due to its simplicity and popularity. In this paper we address a couple of aspects that can be subject of mprovement. One is related to a problematic feature of functional logic languages not taken under consideration by standard systems: it is known that the use of opaque HO patterns in left-hand sides of program rules may produce undesirable effects from the point of view of types. We re-examine the problem, and propose two variants of a Damas-Milner-like type system where certain uses of HO patterns (even opaque) are permitted while preserving type safety. The considered formal framework is that of programs without extra variables and using let-rewriting as reduction mechanism. The other aspect addressed is the different ways in which polymorphism of local definitions can be handled. At the same time that we formalize the type system, we have made the effort of technically clarifying the overall process of type inference in a whole program. (C) 2014 Elsevier Inc. All rights reserved.

关键词： functional-logic programming Type systems Opaque patterns Let bindings

来源：评论

学校读者我要写书评

暂无评论

XPath Query Processing in a functional-logic Language

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2012年 282卷 19-34页

作者： Almendros-Jimenez, J. M. Caballerob, R. Garcia-Ruiz, Y. Saenz-Perez, F. Univ Almeria Dpto Lenguajes & Computac Almeria Spain Univ Complutense Madrid Dpto Sistemas Informat & Computac Madrid Spain Univ Complutense Madrid Dpto Ingn Software & Inteligencia Artificial Madrid Spain

XPath is a well-known query language for finding and extracting information from XML documents. This paper shows how the characteristics of this domain-specific language fits very well into the functional-logic paradigm. The proposed framework allows the user to write XPath-like queries as first-class citizens of the functional-logic language TOY, using higher-order combinators for constructing the queries and non-determinism in order to obtain the different answers that XPath queries can return. The result is a very good example of cross-fertilization of two different areas. In the case of TOY, the users can now integrate XML queries in their programs without using any external library or ad hoc interface. In the case of XPath, the use of higher-order patterns allow us to define functions for easily processing the queries. In particular, the paper shows how to trace and debug erroneous queries, and how to detect that a query is a refinement of another query, which can be useful for improving the efficiency of query processing.

关键词： functional-logic programming Non-Deterministic Functions XPath Higher-Order Patterns

来源：评论

学校读者我要写书评

暂无评论

Integrating XPath with the functional-logic Language Toy

引用

13th International Symposium on Practical Aspects of Declarative Languages

作者： Caballero, Rafael Garcia-Ruiz, Yolanda Saenz-Perez, Fernando Univ Complutense Madrid Dept Sistemas Informat & Computac E-28040 Madrid Spain Univ Complutense Madrid Depart Inge Soft & Inteli E-28040 Madrid Spain

ISBN: (纸本)9783642183775

This paper presents a programming framework for incorporating XPath queries into the functional-logic language Toy. The proposal exploits the language characteristics, including non-determinism, logic variables, and higher-order functions and patterns. Our setting covers a wide range of standard XPath axes and tests. In particular reverse axes are implemented thanks to the double nature of XPath queries, which are both higher-order functions and data terms in our setting. The combination of these two different worlds, the functional-logic paradigm and the XML query language XPath, is very enriching for both of them. From the point of view of functional-logic programming, the language is now able to deal with XML documents in a very simple way. From the point of view of XPath, our approach presents several nice properties as the generation of XML test-cases for XPath queries, which can be useful for finding bugs in erroneous queries.

关键词： functional-logic programming Non-Deterministic Functions XPath Queries Higher-Order Patterns

来源：评论

学校读者我要写书评

暂无评论

XQuery in the functional-logic Language Toy 20th

XQuery in the Functional-Logic Language Toy

引用

20th International Workshop on functional and Constraint logic programming

作者： Almendros-Jimenez, Jesus M. Caballero, Rafael Garcia-Ruiz, Yolanda Saenz-Perez, Fernando Univ Almeria Dpto Lenguajes & Computac Almeria Spain Univ Complutense Madrid Dept Sistemas Informat & Computac E-28040 Madrid Spain Univ Complutense Madrid Dept Ingn Software Int Artificial Madrid Spain

ISBN: (纸本)9783642225307;9783642225314

This paper presents an encoding of the XML query language XQuery in the functional-logic language TOY. The encoding is based on the definition of for-let-where-return constructors by means of TOY functions, and uses the recently proposed XPath implementation for this language as a basis. XQuery expressions can be executed in TOY obtaining sequences of XML elements as answers. Our setting exploits the non-deterministic nature of TOY by retrieving the elements of the XML tree once at a time when necessary. We show that one of the advantages of using a rewriting-based language for implementing XQuery is that it can be used for optimizing XQuery expressions by query rewriting. With this aim, XQuery expressions are converted into higher order patterns that can be analyzed and modified by TOY functions.

关键词： functional-logic programming Non-Deterministic Functions XQuery Higher-Order Patterns

来源：评论

学校读者我要写书评

暂无评论

Database query languages and functional logic programming

引用

NEW GENERATION COMPUTING 2006年第2期24卷 129-184页

作者： Almendros-Jiménez, JM Becerra-Terón, A Univ Almeria Dpto Lenguajes & Comp Almeria 04120 Spain

functional logic programming is a paradigm which integrates functional and logic programming. It is based on the use of rewriting rules for defining programs, and rewriting for goal solving. In this context, goals, usually, consist of equality (and, sometimes, inequality) constraints, which are solved in order to obtain answers, represented by means of substitutions. On the other hand, database programming languages involve a data model, a, data definition language and, finally, a query language against the data defined according to the data model. To use functional logic programming as a database programming language, (1) we will propose a data model involving the main features adopted from functional logic programming (for instance, handling of partial and infinite data), (2) we will use conditional rewriting rules as data definition language, and finally, (3) we will deal with equality and inequality constraints as query language. Moreover, as most database systems, (4) we will propose an extended relational calculus and algebra, which can be used as alternative query languages in this framework. Finally, (5) we will prove that three alternative query languages are equivalent.

关键词： logic programming functional-logic programming deductive databases

来源：评论

学校读者我要写书评

暂无评论

A Fully Sound Goal Solving Calculus for the Cooperation of Solvers in the CFLP Scheme

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第1期177卷 235-252页

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

The CFLP scheme for Constraint functional logic programming has instances CFLP(D) corresponding to different constraint domains D. In this paper, we propose an amalgamated sum construction for building coordination domains C, suitable to represent the cooperation among several constraint domains D-1,..., D-n via a mediatorial domainM. Moreover, we present a cooperative goal solving calculus for CFLP(C), based on lazy narrowing, invocation of solvers for the different domains D-i involved in the coordination domain C, and projection operations for converting D-i constraints into D-j constraints with the aid of mediatorial constraints (so-called bridges) supplied by M. Under natural correctness assumptions for the projection operations, the cooperative goal solving calculus can be proved fully sound w.r.t. the declarative semantics of CFLP(C). As a relevant concrete instance of our proposal, we consider the cooperation between Herbrand, real arithmetic and finite domain constraints.

关键词： Cooperative Goal Solving Constraints functional-logic programming Lazy Narrowing

来源：评论

学校读者我要写书评

暂无评论

Implementing Dynamic-Cut in TOY

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第1期177卷 153-168页

作者： Caballero, R. Garcia-Ruiz, Y. Univ Complutense Madrid Dept Sistemas Informati Programac Madrid Spain

This paper presents the integration of the optimization known as dynamic cut within the functional-logic system TOY. The implementation automatically detects deterministic functions at compile time, and includes in the generated code the test for detecting at run-time the computations that can actually be pruned. The outcome is a much better performance when executing deterministic functions including either or-branches in their definitional trees or extra variables in their conditions, with no serious overhead in the rest of the computations. The paper also proves the correctness of the criterion used for detecting deterministic functions w.r.t. the semantic calculus CRWL.

关键词： determinism functional-logic programming program analysis programming language implementation

来源：评论

学校读者我要写书评

暂无评论

Semantic Determinism and functional logic Program Properties

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第1期174卷 3-15页

作者： Miguel Cleva, Jose Lopez-Fraguas, Francisco J. Univ Complutense Madrid Dept Sistemas Informat & Computac Madrid Spain

In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and non-terminating rewrite systems, defining possibly non-deterministic non-strict functions. Therefore, equational reasoning is not valid for deriving properties of such programs. In a previous work we showed how a mapping from CRWL -a well known logical framework for functional logic programming-into logic programming could be in principle used as logical conceptual tool for proving properties of functional logic programs. A severe problem faced in practice is that simple properties, even if they do not involve non-determinism, require difficult proofs when compared to those obtained using equational specifications and methods. In this work we improve our approach by taking into account determinism of (part of) the considered programs. This results in significant shortenings of proofs when we put in practice our methods using standard systems supporting equational reasoning like, e.g., Isabelle.

关键词： program properties functional-logic programming semantic determinism

来源：评论

学校读者我要写书评

暂无评论

Demand analysis with partial predicates

引用

THEORY AND PRACTICE OF logic programming 2007年第1-2期7卷 153-182页

作者： Marino, Julio Herranz, Angel Moreno-Navarro, Juan Jose Univ Politecn Madrid Fac Informat Boadilla Del Monte 28660 Spain

To alleviate the inefficiencies caused by the interaction of the logic and functional sides, integrated languages may take advantage of demand information, i.e. knowing in advance which computations are needed and, to which extent, in a particular context. This work studies demand analysis - which is closely related to backwards strictness analysis - in a semantic framework of partial predicates, which in turn are constructive realizations of ideals in a domain. This will allow us to give a concise, unified presentation of demand analysis, to relate it to other analyses based on abstract interpretation or strictness logics, some hints for the implementation, and, more important, to prove the soundness of our analysis based on demand equations. There are also some innovative results. One of them is that a set constraint-based analysis has been derived in a stepwise manner using ideas taken from the area of program transformation. The other one is the possibility of using program transformation itself to perform the analysis, specialty in those domains of properties where algorithms based on constraint solving are too weak.

关键词： functional-logic programming demand analysis strictness analysis program transformation abstract interpretation set-constraint analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：