Dead code elimination through dependent types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1551 LNCS, Issue , 1999, Pages 228-242

  Xi, Hongwei ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPILE TIME; DEPENDENT TYPE SYSTEM; DEPENDENT TYPES; HASKELL; PROGRAM ERRORS; REDUNDANT MATCHING; RUNTIMES; TECHNICAL CONTRIBUTION;

PATTERN MATCHING;

TELECOMMUNICATION NETWORKS;

EID: 84867453844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (21)

1. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers. Addison-Wesley, Reading, Massachusetts, 1986.
2. Rowan Davies. Practical refinement-type checking. Thesis Proposal, November 1997.
3. Manuel Fähndrich and Alexander Aiken. Program analysis using mixed term and set constraints. In Proceedings of the 4th International Static Analysis Symposium, September 1997.
4. Tim Freeman and Frank Pfenning. Refinement types for ML. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 268-277, Toronto, Ontario, 1991.
5. F. Gecseg and M Steinb. Tree automata. Akademiai Kiado, 1991.
6. Paul Hudak, S. L. Peyton Jones, and Philip Wadler. Report on the programming language Haskell, a non-strict purely-functional programming language, Version 1.2. SIGPLAN Notices, 27(5), May 1992.
7. John Hughes. Compile-time analysis of functional programs. In D. Turner, editor, Research Topics in Functional Programming, pages 117-153. Addison-Wesley, 1990.
8. N. Jones and S. Muchnick. Flow analysis and optimization of lisp-like structures. In Conference Record of 6th ACM SIGPLAN Symposium on Principles of Programming Languages, pages 244-256, January 1979.
9. Gilles Kahn. Natural semantics. In Proceedings of the S ym posiu m on T heoretical Aspects of Computer Science, pages 22-39. Springer-Verlag LNCS 247, 1987.
10. J. Knoop, O. Rüthing, and B. Steffen. Partial dead code elimination. In Proceedings of the ACM SIGPLAN Conference on Programming Language Implementation and Design, pages 147 - 158, June 1994.
11. Y. Liu and D. Stoller. Dead code elimination using program-based regular tree grammars. Available at http://ftp.cs.indiana.edu/pub/liu/ElimDeadRec-TR97. ps.Z.
12. Robin Milner, Mads Tofte, Robert W. Harper, and D. MacQueen. The Definition of Standard ML. MIT Press, Cambridge, Massachusetts, 1997.
13. Heintze Nevin. Set-based Program Analysis of ML programs. Ph. D dissertation, Carnegie Mellon University, 1992.
14. F. Tip. A survey of program slicing. Journal of Programming Languages, 3(3):121-189, 1995.
15. P. Wadler and J. Hughes. Projections for strictness analysis. In Proceedings of the 3rd International Conference on Functional Programming and Computer Architecture, volume 274 of Lecture Notes in Computer Science, pages 385 - 407. Springer-Verlag, 1987.
16. Pierre Weis and Xavier Leroy. Le langage Caml. InterEditions, Paris, 1993.
17. H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 249-257, June 1998.
18. H. Xi and F. Pfenning. Dependent types in practical programming. In Proceedings of ACM SIGPLAN Symposium on Principles of Programming Languages, January 1999.
19. Hongwei Xi. Some examples of DML programming. Available at http://www.cs.cmu.edu/~hwxi/DML/examples/, November 1997.
20. Hongwei Xi. Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University, 1998. pp. viii+189. Forthcoming. The current version is available as http://www.cs.cmu.edu/~hwxi/DML/thesis.ps.
21. K. Yi and S. Ryu. Towards a cost-effective estimation of uncaught exceptions in standard ml programs. In Proceedings of the 4th International Static Analysis Symposium, September 1997.