ACM Home Page
Please provide us with feedback. Feedback
Haskell and XML: generic combinators or type-based translation?
Full text PdfPdf (1.48 MB)
Source International Conference on Functional Programming archive
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming table of contents
Paris, France
Pages: 148 - 159  
Year of Publication: 1999
ISBN:1-58113-111-9
Also published in ...
Authors
Malcolm Wallace  University of York, UK
Colin Runciman  University of York, UK
Sponsors
INRIA : Institut Natl de Recherche en Info et en Automatique
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 48,   Citation Count: 31
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/317636.317794
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Tim Bray, Jean Paoli, and C.M. Sperberg-Macqueen. Extensible Markup Language (XML) 1.0 (W3C Recommendation), http://wT~-~, w3. org/TR/REg-xml, W~ Consortium, February 1998.
 
2
W H Burge. Recursive Programming Techniques. Addison-Wesley, 1975.
 
3
James Clark (ed). XSL Transformations (Working Draft). http://~, w3. org/TR/WD-xslt, YVWW Consortium, April 1999.
 
4
 
5
Benedict ROaster. Records, Variants, and Qualified Types. Dept of Computer Science, University of Nottingham, PhD Thesis, 1998.
 
6
 
7
 
8
 
9
 
10
 
11
David A Turner. A new implementation technique for applicative languages. Software - Practice and Experience, 9(1):31-50, January 1979.
 
12
Unknown. Document Style Semantics and Specification Language (DSSSL) (Final Draft). http://occam, sjf. novell, com/dsssl/dss s196/, Novell Publications, 1996.
13
 
14
 
15
Philip Wadler. A formal model of pattern matching in XSL. Technical Report http://w~;w, cs. bell-labs, com/~wadler/xsl/, Bell Labs, January 1999.
 
16
Noel Winstanley. Reflections on instance derivation. In 1997 Glasgow Functional Programming Workshop. BCS Workshops in Computer Science, September 1997.

CITED BY  31

Collaborative Colleagues:
Malcolm Wallace: colleagues
Colin Runciman: colleagues