Haskell and XML: generic combinators or type-based translation?
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
TOY: A Multiparadigm Declarative System
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
The XML Query Language Xcerpt: Design Principles, Examples, and Semantics
Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
A typed representation for HTML and XML documents in Haskell
Journal of Functional Programming
XPath-logic and XPathLog: A logic-programming style XML data manipulation language
Theory and Practice of Logic Programming
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
XQuery
XCentric: logic programming for XML processing
Proceedings of the 9th annual ACM international workshop on Web information and data management
Evaluation of datalog extended with an XPath predicate
Proceedings of the 9th annual ACM international workshop on Web information and data management
XHaskell --- Adding Regular Expression Types to Haskell
Implementation and Application of Functional Languages
An Encoding of XQuery in Prolog
XSym '09 Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
Integrating XPath with the functional-logic language toy
PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages
Declaratively querying and visualizing knowledge bases in XML
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
Annotating "Fuzzy chance degrees" when debugging XPath queries
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
| Hi-index | 0.00 |
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.