Term rewriting and all that
Algorithmic Program DeBugging
A Rewriting Logic for Declarative Programming
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Controlling Search in Declarative Programs
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
TOY: A Multiparadigm Declarative System
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
XQuery
An Encoding of XQuery in Prolog
XSym '09 Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
From XQuery to relational logics
ACM Transactions on Database Systems (TODS)
XML Path Language (XPath) 2.0 Standard
XML Path Language (XPath) 2.0 Standard
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
| Hi-index | 0.00 |
This paper addresses the problem of integrating a fragment of XQuery, a language for querying XML documents, into the functional-logic language $\mathcal{TOY}$ . The queries are evaluated by an interpreter, and the declarative nature of the proposal allows us to prove correctness and completeness with respect to the semantics of the subset of XQuery considered. The different fragments of XML that can be produced by XQuery expressions are obtained using the non-deterministic features of functional-logic languages. As an application of this proposal we show how the typical generate and test techniques of logic languages can be used for generating test-cases for XQuery expressions.