Type-based specialization of XML transformations

Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation and Program Manipulation, PEPM'09

Volumn , Issue , 2009, Pages 61-71

  Matsuda, Kazutaka ^a   Hu, Zhenjiang ^b   Takeichi, Masato ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Languages

Indexed keywords

INJECTIVITY; INPUT TYPE; LANGUAGES; SUBTYPING; XML TRANSFORMATION;

MARKUP LANGUAGES; XML;

LINGUISTICS;

EID: 67650697490     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480945.1480955     Document Type: Conference Paper

References (32)

1. V. Benzaken, G. Castagna, and A. Frisch. CDuce: an XMLcentric general-purpose language. In ICFP '03: Proceedings of the 2003 ACM SIGPLAN international conference on Functional programming, pages 51-63, 2003.
2. R. S. Bird. Introduction to Functional Programming Using Haskell. Prentice Hall
3. C. Brabrand, R. Giegerich, and A. Møller. Analyzing ambiguity of context-free grammars. In Proceedings of 12th International Conference on Implementation and Application of Automata, CIAA '07, volume 4783 of LNCS. Springer-Verlag, July 2007.
4. C. Brabrand, A. Møller, and M. I. Schwartzbach. Dual syntax for XML languages. Information Systems, 33(4), June 2008. Earlier version in Proc. 10th International Workshop on Database Programming Languages, DBPL '05, Springer-Verlag LNCS vol. 3774.
5. P. Bunneman and B. C. Pierce. Union types for seminstrcutred data. Technical Report MS-CIS-99-109, University of Pennsylvania Department of Computer and Information Science, 1999.
6. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997. release October, 1st 2002.
7. J. Engelfriet. Top-down tree transducers with regular look-ahead. Mathematical Systems Theory, 10:289-303, 1977.
8. J. Engelfriet and S. Maneth. A comparison of pebble tree transducers with macro tree transducers. Acta Informatica, 39(9):613-698, 2003.
9. D. Eppstein. A heuristic approach to program inversion. In International Joint Conference on Artificial Intelligence (IJCAI-85), pages 219-221, 1985.
10. A. Frisch. Regular tree language recognition with static information. In Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), pages 661-674, 2004.
11. A. Frisch, G. Castagna, and V. Benzaken. Semantic subtyping. In LICS '02: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, pages 137-146, Washington, DC, USA, 2002. IEEE Computer Society. (Pubitemid 34911803)
12. R. Glück and M. Kawabe. Derivation of deterministic inverse programs based on LR parsing. In FLOPS '04: The Seventh International Symposium on Functional and Logic Programming, pages 291-306, 2004.
13. R. Glück and M. Kawabe. Revisiting an automatic program inverter for lisp. SIGPLAN Notices, 40(5):8-17, 2005.
14. D. Gries. The Science of Programming, chapter 21 Inverting Programs. Springer, 1981.
15. H. Hosoya. Regular expression pattern matching-a simpler design. Technical Report 1397, RIMS, Kyoto University, 2003.
16. H. Hosoya and B. C. Pierce. XDuce: A statically typed XML processing language. ACM Trans. Internet Technol., 3(2):117-148, 2003.
17. K. Inaba, H. Hosoya, and S. Maneth. Multi-return macro tree transducers. In Proceedings of 13th International Conference on Implementation and Application of Automata, CIAA '08, pages 102- 111, 2008.
18. M. Y. Levin. Run, Xtatic, Run: Efficient Implementation of an Object- Oriented Language with Regular Pattern Matching. PhD thesis, University of Pennsylvania, 2005.
19. M. Y. Levin and B. C. Pierce. Type-based optimization for regular patterns. In DBPL '05: Proceedings of 10th International Symposium on Database Programming Languages, pages 184-198, 2005. (Pubitemid 43943737)
20. S. Maneth. The macro tree transducer hierarchy collapses for functions of linear size increase. In FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, pages 326-337, 2003.
21. S. Maneth, A. Berlea, T. Perst, and H. Seidl. XML type checking with macro tree transducers. In PODS '05: Proceedings of the twentyfourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 283-294, 2005. (Pubitemid 43275490)
22. S. Maneth and K. Nakano. XML type checking for macro tree transducers with holes. In PLAN-X '08: Programming Languages Technologies for XML, 2008.
23. S. Maneth, T. Perst, and H. Seidl. Exact XML type checking in polynomial time. In ICDT '07: Proceedings of the 11th International Conference of Database Theory, volume 4353 of LNCS, pages 254- 268, 2007.
24. K. Matsuda, Z. Hu, K. Nakano, M. Hamana, and M. Takeichi. Bidirectionalization transformation based on automatic derivation of view complement functions. In ICFP '07: Proceedings of the 2007 ACM SIGPLAN international conference on Functional programming, pages 47-58, New York, NY, USA, 2007. ACM. (Pubitemid 351203745)
25. T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. Journal of Computer and System Sciences, 66(1):66-97, 2003.
26. M. Mohri and M.-J. Nederhof. Regular approximation of context-free grammars through transformation. In J.-C. Junqua and G. van Noord, editors, Robusteness in Language and Speech Technology. Kluwer Academic Publishers, The Netherlands, 2001.
27. Murata. Hedge automata: a formal model for XML schemata, 1999. Available on: http://www.xml.gr.jp/relax/hedgenice.html
28. M. Murata, D. Lee, M. Mani, and K. Kawaguchi. Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Technol., 5(4):660-704, 2005.
29. N. Nishida, M. Sakai, and T. Sakabe. Generation of inverse term rewriting systems for pure treeless functions. In Y. Toyama, editor, Proceedings of the International Workshop on Rewriting in Proof and Computation (RPC'01), pages 188-198, 10 2001.
30. T. Perst and H. Seidl. Macro forest transducers. Information Processsing Letters, 89(3):141-149, 2004.
31. E. L. Post. A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society, 52(4):264-268, 1946.
32. P. Wadler. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science, 73(2):231-248, 1990.