Erik Meijer and Mark Shields. XMLambda: A Functional Programming Language for Constructing and Manipulating XML Documents. http://www.cse.ogi.edu/mbs, 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....two new properties: 1) our algorithm is provably complete, and (2) it allows a useful subtagging relation between different labels in XML trees. 1 Introduction The recent rush to adopt XML is due in part to the hope that the static typing provided by DTDs [XML] or more sophisticated mechanisms such as XML Schema [XS00] will improve the safety of data exchange and processing. However, although XML documents can be checked for conformance with DTDs, current XML processing languages offer no way of verifying that programs operating on these documents will always produce conforming ....

....static typing provided by DTDs [XML] or more sophisticated mechanisms such as XML Schema [XS00] will improve the safety of data exchange and processing. However, although XML documents can be checked for conformance with DTDs, current XML processing languages offer no way of verifying that programs operating on these documents will always produce conforming outputs. In this paper, we propose regular expression types as a foundation for statically typed processing of XML documents. Regular expression types are a natural generalization of DTDs, describing, as DTDs do, structures in XML ....

[Article contains additional citation context not shown here]

Erik Meijer and Mark Shields. Xmlambda: A functional programming language for constructing and manipulating xml documents. page 13. Submitted to USENIX 2000 Technical Conference.

....in the other direction is that our type system does not currently support higher order functions or parametric polymorphism. We are working on both of these extensions. Another piece of work along similar lines is the functional language XM for XML processing, proposed by Meijer and Shields [18]. Their type system is close to Haskell s, except that they incorporate so called Glushkov automata in type checking, resulting in a more flexible type system. However, neither their type system nor Glushkov automata are described in detail in their paper, making comparison with our work ....

E. Meijer and M. Shields. XMLambda: A Functional Programming Language for Constructing and Manipulating XML Documents. page 13. Submitted to USENIX 2000 Technical Conference.

....A difference in the other direction is that XDuce does not currently support higher order functions or parametric polymorphism. We are working on both of these extensions. Another piece of work along similar lines is the functional language XM for XML processing, proposed by Meijer and Shields [8]. Their type system is not described in detail in this paper, but seems to be close to Haskell s, except that they incorporate Glushkov automata in type checking, resulting in a more flexible type system. A closer relative to XDuce is the query language YAT [11] which allows optional use of ....

E. Meijer and M. Shields. Xmlambda: A functional programming language for constructing and manipulating xml documents. In Submitted to USENIX 2000 Technical Conference, page 13 pages.

....domain specific languages is by embedding into Haskell [10] and HSP is no exception. However, a necessary condition for this to work is that all the features of the domain specific language can be mapped to a corresponding feature of Haskell. In the case of HSP, Haskell falls short in two areas [24,31]: Proper pattern matching on XML fragments requires the use of a Glushkov automaton to direct the matching of regular expressions [31] Because we are piggybacking on Haskell s more primitive pattern matching mechanisms, we are forced to introduce some over specification in certain places. ....

....in Haskell. Even well formedness and simple pattern matching on documents alone is already a much stronger property than most other competing languages can o#er, but there are many occasions where we do want to match and type arbitrary XML. For this we are developing a new language XMLambda [24] which has XML documents as its basic data types. 3 In the mean time, HSP remains an excellent example of the Pareto principle 2 ; we get 80 percent of the functionality of XMLambda for 20 percent of the cost. In the rest of this paper we will first give an overview of the current state of ....

Erik Meijer and Mark Shields. XMLambda: A Functional Programming Language for Constructing and Manipulating XML Documents. http://www.cse.ogi.edu/mbs, 2000.

....domain speci c languages is by embedding into Haskell [10] and HSP is no exception. However, a necessary condition for this to work is that all the features of the domain speci c language can be mapped to a corresponding feature of Haskell. In the case of HSP, Haskell falls short in two areas [24, 31]: Proper pattern matching on XML fragments requires the use of a Glushkov automaton to direct the matching of regular expressions. Because we are piggybacking on Haskell s more primitive pattern matching mechanisms, we are forced to introduce some over speci cation in certain places. ....

....in Haskell. Even well formedness and simple pattern matching on documents alone is already a much stronger property than most other competing languages can o er, but there are many occasions where we do want to match and type arbitrary XML. For this we are developing a new language XMLambda [24] which has XML documents as its basic data types. In the mean time, HSP remains an excellent example of the Pareto principle 2 ; we get 80 percent of the functionality of XMLambda for 20 percent of the cost. In the rest of this paper we will rst give an overview of the current state of a airs ....

Erik Meijer and Mark Shields. XMLambda: A Functional Programming Language for Constructing and Manipulating XML Documents. http://www.cse.ogi.edu/~mbs, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC