C. Paulin-Mohring. Extracting F# 's programs from proofs in second order lambda-calculus. In ACM, editor, Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989.  Home/Search   Document Not in Database   Summary   Related Articles

....to the final result of the computation are detected and deleted. Dead code can arise during the compilation process due to program transformations and during the evolution of programs. Program extracts from proofs also tend to contain a lot of code irrelevant to the result of the computation [2, 7, 3, 4, 17, 20]. In this paper, we investigate dependence analysis in the context of dead code elimination, bearing in mind it is readily applicable to the problems mentioned above. We give a method for dead code elimination for typed # calculus based languages, such as ML and typed intermediate languages for ....

....is di#erent as well. To our knowledge, there is no work on dependence analysis using set constraints. Another group of researchers became interested in dead code elimination in trying to optimize programs extracted from proofs, which usually contain a lot of dead code. Representative examples are [17, 3, 4, 7]. Although types are used, the type systems are complicated and are not readily extendable to di#erent problems, since typing rules are tailored to one specific problem. Similarly, type inference is non standard and complicated. A more complete discussion can be found in [8] 7 Conclusion In ....

C. Paulin-Mohring. Extracting F# 's programs from proofs in second order lambda-calculus. In ACM, editor, Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC