Grammar-based analysis of string expressions

Proceedings of the TLDI'05: 2005 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation

Volumn , Issue , 2005, Pages 59-70

  Thiemann, Peter ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Constraints; String expression analysis; Type inference

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONTEXT FREE GRAMMARS; HIERARCHICAL SYSTEMS; PROBLEM SOLVING;

LAMBDA CALCULUS; REFERENCE GRAMMAR; STRING EXPRESSION ANALYSIS; TYPE INFERENCE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 29144520841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1040294.1040300     Document Type: Conference Paper

References (12)

1. Aske Simon Christensen, Anders Møller, and Michael I. Schwartzbach. Precise analysis of string expressions. In Radhia Cousot, editor, Proc. International Static Analysis Symposium, SAS'03, number 2694 in Lecture Notes in Computer Science, pages 1-18. San Diego, CA, USA, June 2003. Springer-Verlag.
2. Jay Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102. February 1970.
3. Thorn Frühwirth. Constraint Handling Rules. In Andreas Podelski, editor, Constraint Programming: Basics and Trends, number 910 in Lecture Notes in Computer Science. Springer, 1995. (Châtillon-sur-Seine Spring School, France, May 1994).
4. John E. Hopcroft. On the equivalence and containment problems for context-free languages. Math. Systems Theory, 3(2):119-124, 1969.
5. Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. In Hanne Riis Nielson, editor, Proceedings of the 2001 A CM SIGPLAN Symposium on Principles of Programming Languages, pages 67-80, London, England, January 2001. ACM Press.
6. Haruo Hosoya, Jérôme Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Philip Wadler, editor, Proc. International Conference on Functional Programming 2000, pages 11-22, Montreal, Canada, September 2000. ACM Press, New York.
7. Mehryar Mohri and Mark-Jan Nederhof. Regular approximation of context-free grammars through transformation. In Jean-Claude Junqua and Gertjan van Noord, editors, Robustness in Language and Speech Technology, pages 153-163. Kluwer Academic Publishers, Dordrecht, 2001.
8. Martin Odersky, Martin Sulzmann, and Martin Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35-55, 1999.
9. Naoshi Tabuchi, Eijiro Sumii, and Akinori Yonezawa. Regular expression types for strings in a text processing language. In Gilles Barthe and Peter Thiemann, editors, Proceedings of Workshop on Types in Programming (TIP02), volume 75 of ENTCS, pages 1-19, 2003.
10. Eelco Visser. Scannerless generalized-LR parsing. Technical Report P9707, Programming Research Group, University of Amsterdam. 1997.
11. Seth White, Maydene Fisher, Rick Cattell, Graham Hamilton, and Mark Hapner. JDBC(TM) API Tutorial and Reference: Universal Data Access for the Java(TM) 2 Platform. Addison-Wesley, 1999.
12. Andrew Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, 1994.