%0 Conference Paper %1 PerstSeidel2002 %A Perst, Thomas %A Seidl, Helmut %B Proceedings of Extreme Markup Languages %D 2002 %K markuplanguages programming macros xml %T A Type-safe Macro System for XML %U http://www.idealliance.org/papers/extreme/Proceedings/html/2002/Perst01/EML2002Perst01.html %X XML is originally designed for the use in document processing. Every classical document processing system supports a mechanism which is called macro. In general, a macro is a named collection of actions. These actions are executed whenever the name of the macro appears in a document instance. We describe a very small but powerful macro language for XML. The presented language supports macros with arguments. As a main result we will show that for a macro expansion H and a recognizable set R the set H-1(R) of trees t, whose macro expansion H(t) are in R, is recognizable. This implies that the typechecking problem for macro expansion is decidable. A major drawback of this approach is the time complexity. Therefore we designed a practical typechecking discipline. We equip every macro definition with a type expression describing the input forests. On the basis of this type information the macro processor computes an output type for the macro. Having inferred this output type, we aim at extending the given output DTD to a DTD for admissible input possibly containing unexpanded macros.

@inproceedings{PerstSeidel2002, abstract = {XML is originally designed for the use in document processing. Every classical document processing system supports a mechanism which is called macro. In general, a macro is a named collection of actions. These actions are executed whenever the name of the macro appears in a document instance. We describe a very small but powerful macro language for XML. The presented language supports macros with arguments. As a main result we will show that for a macro expansion H and a recognizable set R the set H-1(R) of trees t, whose macro expansion H(t) are in R, is recognizable. This implies that the typechecking problem for macro expansion is decidable. A major drawback of this approach is the time complexity. Therefore we designed a practical typechecking discipline. We equip every macro definition with a type expression describing the input forests. On the basis of this type information the macro processor computes an output type for the macro. Having inferred this output type, we aim at extending the given output DTD to a DTD for admissible input possibly containing unexpanded macros.}, added-at = {2006-10-13T13:54:12.000+0200}, author = {Perst, Thomas and Seidl, Helmut}, biburl = {https://www.bibsonomy.org/bibtex/2966212a2ee86cdb6ec05fb7a0d7bfaac/tmalsburg}, booktitle = {Proceedings of Extreme Markup Languages}, description = {It seems that these people didn't know XSLT.}, interhash = {799475ee8a4e23fd1060ff751b5f2927}, intrahash = {966212a2ee86cdb6ec05fb7a0d7bfaac}, keywords = {markuplanguages programming macros xml}, timestamp = {2006-10-13T13:54:12.000+0200}, title = {A Type-safe Macro System for XML}, url = {http://www.idealliance.org/papers/extreme/Proceedings/html/2002/Perst01/EML2002Perst01.html}, year = 2002 }