Combination of transformation and schema languages described by a complete formal semantics

Authors:
Catherine Pugin;Rolf Ingold
Affiliations:
University of Fribourg;University of Fribourg
Venue:
Proceedings of the 2007 ACM symposium on Document engineering
Year:
2007

Citing 8
Cited 0

Introduction to the theory of programming languages

Introduction to the theory of programming languages
Regular expression types for XML

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
The denotational semantics of programming languages

Communications of the ACM
Towards static type checking for XSLT

DocEng '01 Proceedings of the 2001 ACM Symposium on Document engineering
XDuce: A statically typed XML processing language

ACM Transactions on Internet Technology (TOIT)
CDuce: an XML-centric general-purpose language

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Taxonomy of XML schema languages using formal language theory

ACM Transactions on Internet Technology (TOIT)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML and its associated languages, namely DTD, XML Schema and XSLT, have tremendous importance for lots of applications even if their semantics is often hard to understand and incomplete. In this paper, we concentrate on transformation languages and propose a new one in XML syntax and focusing on strong specifications. Since our language is completely defined by formal semantics, conceptual drawbacks have been avoided and complexity has been reduced. Thus, static type checking could easily be provided. Finally, we combine our transformation language with our own schema language in order to perform static typing.