Proc. of a conference on Functional programming languages and computer architecture
Principles and practice of unification factoring
ACM Transactions on Programming Languages and Systems (TOPLAS)
Regular expression pattern matching for XML
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Fast and Effective Procedure Inlining
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
MK Pattern Match Compilation and Partial Evaluation
Selected Papers from the Internaltional Seminar on Partial Evaluation
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
Shrinking lambda expressions in linear time
Journal of Functional Programming
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Polymorphic regular tree types and patterns
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference for unique pattern matching
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Type-Safe Embedding of XDuce into ML
Electronic Notes in Theoretical Computer Science (ENTCS)
XPath whole query optimization
Proceedings of the VLDB Endowment
Type-based optimization for regular patterns
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
The design space of type checkers for XML transformation languages
ICDT'05 Proceedings of the 10th international conference on Database Theory
XML goes native: run-time representations for XTATIC
CC'05 Proceedings of the 14th international conference on Compiler Construction
| Hi-index | 0.00 |
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing tree-structured data such as XML. A compiler for such a language must address not only the familiar problems of pattern optimization for ML-style algebraic datatypes and pattern matching, but also some new ones, arising principally from the use of recursion in patterns. We identify several factors playing a significant role in the quality of the generated code, propose two pattern compilers---one generating backtracking target programs, the other non-backtracking---and sketch proofs of their correctness.