Compiling Regular Patterns

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn 8, Issue , 2003, Pages 65-77

  Levin, Michael Y ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Compilation; Pattern matching

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CODES (SYMBOLS); COMPUTER SOFTWARE; DATA STRUCTURES; OPTIMIZATION; PATTERN MATCHING; PROBLEM SOLVING; PROGRAM COMPILERS; XML;

COMPILATION; TREE-STRUCTURED DATA;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1142275485     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/944705.944712     Document Type: Conference Paper

References (19)

1. A. W. Appel and T. Jim. Shrinking lambda Expressions in Linear Time. Journal of Functional Programming, 7(5):515-540, 1997.
2. L. Augustsson. Compiling pattern matching. In J.-P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, pages 368-381. Springer-Verlag, Berlin, DE, 1985.
3. M. Baudinet and D. MacQueen. Tree pattern matching for ML. unpublished paper, 1985.
4. V. Benzaken, G. Castagna, and A. Frisch. CDuce: a white paper. In Informal Proceedings of the Workshop on Programming Language Technologies for XML (PLAN-X), 2002.
5. A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree languages over non-ranked alphabets, 1998.
6. A. S. Christensen, A. Moller, and M. I. Schwartzbach. Static analysis for dynamic XML. http://www.brics.dk/mis/planx.ps, 2002. Workshop on Programming Language Technologies for XML (PLAN-X).
7. J. Clark and S. DeRose. XML path language (XPath). http://www.w3.org/TR/xpath.
8. H. Common, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Draft book; http://www.grappa.univ-lille3.fr/tata.
9. S. Dawson, C. R. Ramakrishnan, S. Skiena, and T. Swift. Principles and practice of unification factoring. ACM Transactions on Programming Languages and Systems, 18(5):528-563, 1996.
10. F. L. Fessant and L. Maranget. Optimizing pattern-matching. In Proceedings of the 2001 International Conference on Functional Programming. ACM Press, 2001.
11. V. Gapeyev and B. C. Pierce. Regular object types. In European Conference on Object-Oriented Programming (ECOOP), 2003. A preliminary version was presented at FOOL '03.
12. H. Hosoya and B. Pierce. Regular expression pattern matching. In ACM Symposium on Principles of Programming Languages (POPL), London, England, 2001. Full version to appear in Journal of Functional Programming.
13. H. Hosoya and B. C. Pierce. XDuce: A statically typed XML processing language. ACM Transactions on Internet Technology, 2003. To appear.
14. S. P. Jones and S. Marlow. Secrets of the Glasgow Haskell Compiler Inliner. In IDL, 1999. revised version to appear in Journal of Functional Programming.
15. A. Krall. Implementation techniques for Prolog. In N. E. Fuchs, editor, 10. Workshop Logische Programmierung, Bericht, pages 1-15, Zürich, 1994. Universität Zürich.
16. M. Murata. Hedge Automata: a Formal Model for XML Schemata. Web page, 2000.
17. A. Neumann and H. Seidl. Locating matches of tree patterns in forests. In Foundations of Software Technology and Theoretical Computer Science, pages 134-145, 1998.
18. P. Sestoft. ML pattern match compilation and partial evaluation. Lecture Notes in Computer Science, 1110:446-??, 1996.
19. O. Waddell and R. K. Dybig. Fast and Effective Procedure Inlining. In Static Analysis Symposium, pages 35-52, 1997.