Haskell and XML: Generic combinators or type-based translation?

Citation
M. Wallace et C. Runciman, Haskell and XML: Generic combinators or type-based translation?, ACM SIGPL N, 34(9), 1999, pp. 148-159
Citations number
16
Categorie Soggetti
Computer Science & Engineering
Journal title
ACM SIGPLAN NOTICES
ISSN journal
15232867 → ACNP
Volume
34
Issue
9
Year of publication
1999
Pages
148 - 159
Database
ISI
SICI code
1523-2867(199909)34:9<148:HAXGCO>2.0.ZU;2-D
Abstract
We present two complementary approaches to writing XML document-processing applications in a functional language. In the first approach, the generic tree structure of XML documents is used as the basis far the design of a library of combinators for generic process ing: selection, generation, and transformation of XML trees. The second approach is to use a type-translation framework for treating XML document type definitions (DTDs) as declarations of algebraic data types, and a derivation of the corresponding functions for reading and writing doc uments as typed values in Haskell.