Pushdown machines for the macro tree transducer
Theoretical Computer Science
Macro tree transducers, attribute grammars, and MSO definable tree translations
Information and Computation
Towards static type checking for XSLT
DocEng '01 Proceedings of the 2001 ACM Symposium on Document engineering
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Automata theory for XML researchers
ACM SIGMOD Record
Monadic Second Order Logic and Node Relations on Graphs and Trees
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
CDuce: an XML-centric general-purpose language
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Information Processing Letters
Frontiers of tractability for typechecking simple XML transformations
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The design space of type checkers for XML transformation languages
ICDT'05 Proceedings of the 10th international conference on Database Theory
Regular expression filters for XML
Journal of Functional Programming
Journal of Computer and System Sciences
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters
XML graphs in program analysis
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Static validation of XSL transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
XML transformation by tree-walking transducers with invisible pebbles
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A crash course on database queries
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Multi-Return Macro Tree Transducers
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Language and Automata Theory and Applications
Type-based specialization of xml transformations
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Pebble Macro Tree Transducers with Strong Pebble Handling
Fundamenta Informaticae
Circularity, composition, and decomposition results for pebble macro tree transducers
Journal of Automata, Languages and Combinatorics
Parametric polymorphism for XML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient inclusion checking for deterministic tree automata and XML Schemas
Information and Computation
Higher-order multi-parameter tree transducers and recursion schemes for program verification
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards practical typechecking for macro tree transducers
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Equivalence of deterministic nested word to word transducers
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A learning algorithm for top-down XML transformations
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewrite-based verification of XML updates
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Verification of tree-processing programs via higher-order model checking
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
XML graphs in program analysis
Science of Computer Programming
XEvolve: an XML schema evolution framework
Proceedings of the 2011 ACM Symposium on Applied Computing
The complexity of text-preserving XML transformations
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Exact XML type checking in polynomial time
ICDT'07 Proceedings of the 11th international conference on Database Theory
XML type checking using high-level tree transducer
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
N-ary queries by tree automata
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Polynomial-time inverse computation for accumulative functions with multiple data traversals
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Computing transitive closures of hedge transformations
International Journal of Critical Computer-Based Systems
The equivalence problem for deterministic MSO tree transducers is decidable
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A pushdown machine for recursive XML processing
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Computing transitive closures of hedge transformations
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Pebble Macro Tree Transducers with Strong Pebble Handling
Fundamenta Informaticae
Static analysis of XML document adaptations
ER'12 Proceedings of the 2012 international conference on Advances in Conceptual Modeling
Deciding definability by deterministic regular expressions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Hi-index | 0.00 |
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a corresponding theoretical foundation of XML transformation languages, the "transformation language" TL is proposed. This language is based on the "document transformation language" DTL of Maneth and Neven which incorporates full MSO pattern matching, arbitrary navigation in the input tree using also MSO patterns, and named procedures. The new language generalizes DTL by additionally allowing procedures to accumulate intermediate results in parameters. It is proved that TL -- and thus in particular DTL - despite their expressiveness still allow for effective inverse type inference. This result is obtained by means of a translation of TL programs into compositions of top-down finite state tree transductions with parameters, also called (stay) macro tree transducers.