Proceedings of the 2003 ACM Symposium on Document Engineering
Subtitle: November 20-22, Grenoble, France
By: editors, Christine Vanoirbeek, Cécile Roisin, Ethan Munson.
Contributors: Vanoirbeek, C.; Roisin, Cécile.; Munson, Ethan V.; Association for Computing Machinery. Special Interest Group on Information Retrieval.; Association for Computing Machinery. Special Interest Group on Hypertext, Hypermedia and Web.
Publisher: Association for Computing Machinery, c2003.
Published: 2003
Place of publication: New York, N.Y
Language: eng
Number of pages: 249
Subjects: Text processing (Computer science) -- Congresses.
Genres: Congresses.
Other titles: DocEng 2003
Description: We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tree are computed only upon initial access. As these computations have limited fan-in, sparse output coverage propagates backwards through the pipeline. In comparative measurements with traditional eager implementations, our approach is on par for complete coverage and excels as coverage becomes sparser. In contrast to eager evaluation, lazy evaluation also admits infinite intermediate results, thus extending the design space for transformation sequences. To demonstrate that lazy evaluation preserves the semantics of XSLT, we reduce XSLT to the lambda calculus via a functional language. While this is possible for all languages, most imperative languages cannot profit from the confluence of lambda as only one reduction applies at a time.
Notes: Includes bibliographical references and author index.
"ACM order number 605034"--T.p. verso.