Haskell and XML
- 1 September 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 34 (9) , 148-159
- https://doi.org/10.1145/317636.317794
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 for the design of a library of combinators for generic processing: 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 documents as typed values in Haskell.Keywords
This publication has 5 references indexed in Scilit:
- Building program optimizers with rewriting strategiesPublished by Association for Computing Machinery (ACM) ,1998
- Monadic parsing in HaskellJournal of Functional Programming, 1998
- Why Functional Programming MattersThe Computer Journal, 1989
- Making form follow function: An exercise in functional programming styleSoftware: Practice and Experience, 1987
- A new implementation technique for applicative languagesSoftware: Practice and Experience, 1979