Customizing an XML–Haskell data binding with type isomorphism inference in Generic Haskell

Atanassow, Frank; Jeuring, Johan

doi:10.1016/j.scico.2006.01.005

Cited by 6 publications

(8 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Evaluation improvements are discussed in [43] on template expansion and in [8] on schema validation. [1] deals with XML typing in general, and particularly with type isomorphism in Haskell. The overall meaning of polymorphism in terms of XML is discussed in [36].…”

Section: B Preparationsmentioning

confidence: 99%

Narrowing Down XML Template Expansion and Schema Validation

Haberland¹

2019

Preprint

View full text Add to dashboard Cite

Section: B Preparationsmentioning

confidence: 99%

Narrowing Down XML Template Expansion and Schema Validation

Haberland¹

2019

Preprint

View full text Add to dashboard Cite

“…Furthermore, the extracted data elements are also well typed so that the coherence of the data structure during the query is guaranteed. Some other studies also try to introduce the data types representing XML schemas into the conventional functional languages like Haskell [3]. In addition, some query languages [33] without a type system also adopt regular expression in their pattern structure and thus can be used to efficiently query the documents with regular structures.…”

Section: Related Workmentioning

confidence: 99%

XTQ: A Declarative Functional XML Query Language

Li,

Liu,

Zhu

et al. 2014

Preprint

View full text Add to dashboard Cite

Various query languages have been proposed to extract and restructure information in XML documents. These languages, usually claiming to be declarative, mainly consider the conjunctive relationships among data elements. In order to present the operations where the hierarchical and the disjunctive relationships need to be considered, such as restructuring hierarchy and handling heterogeneity, the programs in these languages often exhibit a procedural style and thus the declarativeness in them is not so prominent as in conventional query languages like SQL.In this paper, we propose a declarative pattern-based functional XML query language named XML Tree Query (XTQ). XTQ adopts expressive composite patterns to present data extraction, meanwhile establishing the conjunctive, the disjunctive and the hierarchical relationships among data elements. It uses the matching terms, a composite structure of the variables bound to the matched data elements, to present a global sketch of the ex-✩ This research is partially supported by National Science Foundation of China and Open Foundation of State Key Lab of Software Engineering.✩✩ The authors wish to thank the anonymous referees for their valuable comments and suggestions, which greatly improved the technical content and the presentation of the paper. Also thanks to Tieyun Qian and Ming Zhong for their valuable advice and efforts in revising the submission.

show abstract

“…<xsl:template match="top[count(child:: * )=2] and a[1] and a[2]"> <xsl:text>a</xsl:text> </xsl:template> Example 2) Example using append Match arbitrary nodes whose attribute id equals 1234. template(element(_,A,_),[text('.…”

mentioning

confidence: 99%

Using Prolog for Transforming XML Documents

Haberland

2019

Preprint

View full text Add to dashboard Cite

Proponents of the programming language Prolog share the opinion Prolog is more appropriate for transforming XML-documents as other well-established techniques and languages like XSLT. In order to clarify this position this work proposes a tuProlog-styled interpreter for parsing XMLdocuments into Prolog-internal lists and vice versa for serialising lists into XML-documents.Based on this implementation a comparison between XSLT and Prolog follows. First, criteria are researched, such as considered language features of XSLT, usability and expressibility. These criteria are validated. Second, it is assessed when Prolog distinguishes between input and output parameters towards reversible transformation.

show abstract

Customizing an XML–Haskell data binding with type isomorphism inference in Generic Haskell

Cited by 6 publications

References 34 publications

Narrowing Down XML Template Expansion and Schema Validation

Narrowing Down XML Template Expansion and Schema Validation

XTQ: A Declarative Functional XML Query Language

Using Prolog for Transforming XML Documents

Contact Info

Product

Resources

About