Type-Based XML Processing in Logic Programming

Coelho, Jorge; Florido, Mário

doi:10.1007/3-540-36388-2_19

Cited by 6 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…XML values can be 'embedded' in an existing programming language (the "target") by finding a suitable translation between XML types and types of the programming language [30]. Examples include JAXB [42] for Java, WASH [44] and HaXml [53] for Haskell, various tools [33] such as EaseXML [34] for Python and X-Prolog [11] for Prolog.…”

Section: An Xml Schema-haskell Data Bindingmentioning

confidence: 99%

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

Atanassow

Jeuring

2007

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

Section: An Xml Schema-haskell Data Bindingmentioning

confidence: 99%

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

Atanassow

Jeuring

2007

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…Our proposal requires the representation of XML documents into logic programming, and thus it can be compared with those ones representing XML documents in logic programming for instance, (Schaffert and Bry 2002;Coelho and Florido 2003;Cabeza and Hermenegildo 2001;Wielemaker 2005) and, with those ones representing XML documents in relational databases for instance, (Boncz et al 2005;O'Neil et al 2004;Tatarinov et al 2002). In our case, rules are used for expressing the structure of well-formed XML documents, and XML elements are represented by means of facts.…”

Section: Related Workmentioning

confidence: 99%

Querying XML documents in logic programming

Almendros-Jiménez¹,

Becerra-Terón²,

Enciso-Baños³

2008

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Extensible Markup Language (XML) is a simple, very flexible text format derived from SGML. Originally designed to meet the challenges of large-scale electronic publishing, XML is also playing an increasingly important role in the exchange of a wide variety of data on the Web and elsewhere. XPath language is the result of an effort to provide address parts of an XML document. In support of this primary purpose, it becomes in a query language against an XML document. In this paper we present a proposal for the implementation of the XPath language in logic programming. With this aim we will describe the representation of XML documents by means of a logic program. Rules and facts can be used for representing the document schema and the XML document itself. In particular, we will present how to index XML documents in logic programs: rules are supposed to be stored in main memory, however facts are stored in secondary memory by using two kind of indexes: one for each XML tag, and other for each group of terminal items. In addition, we will study how to query by means of the XPath language against a logic program representing an XML document. It evolves the specialization of the logic program with regard to the XPath expression. Finally, we will also explain how to combine the indexing and the top-down evaluation of the logic program.

show abstract

“…An XML data binding [23] translates an XML document to a value of some programming language. Such bindings have been defined for a number of programming languages including Java [21,24], Python [26], Prolog [7] and Haskell [35,37,1]. The default translation scheme of a data binding may produce unwieldy, convoluted and redundant types and values.…”

Section: Improving a Haskell-xml Schema Data Bindingmentioning

confidence: 99%

Inferring Type Isomorphisms Generically

Atanassow

Jeuring

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary products. In some canonical cases, the conversion function is uniquely determined solely by the two types involved. In this article we describe and implement a program in Generic Haskell which automatically infers this function by normalizing types w.r.t. an algebraic theory of canonical isomorphisms. A simple generalization of this technique also allows to infer some non-invertible coercions such as projections, injections and ad hoc coercions between base types. We explain how this technique has been used to drastically improve the usability of a Haskell-XML Schema data binding, and suggest how it might be applied to improve other type-safe language embeddings.

show abstract

Type-Based XML Processing in Logic Programming

Cited by 6 publications

References 14 publications

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

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

Querying XML documents in logic programming

Inferring Type Isomorphisms Generically

Contact Info

Product

Resources

About