O. Hafizogullari, C. Kreitz  Home/Search
Context
Related
| cornell.edu/Info/P...licdependency.pdf From: cornell.edu/Info/Pr...publication (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a method for dependence analysis in typed functional programming languages. Our approach relies on a type system with simple subtypes for specifying dead code and a type inference algorithm for it. Through a careful seperation of the type system and the problem-specific assumptions we avoid ad hoc rules in the type system. This, combined with the fact that our approach makes the flow information in a program explicit and is based on well-understood concepts makes our approach a... (Update)
Active bibliography (related documents): More All
0.6: Detecting and Removing Dead Code using Rank 2 Intersection - Damiani, Prost (1997) (Correct)
0.5: A Proof Environment for the Development of Group.. - Kreitz, Hayden, Hickey (1998) (Correct)
0.4: Type-Based Useless-Variable Elimination - Naoki Kobayashi Koba (1999) (Correct)
Similar documents based on text: More All
0.2: Partial Dead Code Elimination - Knoop, Rüthing, Steffen (1994) (Correct)
0.2: ML Type Inference for Dead Code Analysis - Prost (1997) (Correct)
0.2: Partial Dead Code Elimination using Slicing Transformations - Bodik, Gupta (1997) (Correct)
BibTeX entry: (Update)
@misc{ hafizogullari-dependence,
author = "O. Hafizogullari and C. Kreitz",
title = "Dependence Analysis Through Type Inference",
url = "citeseer.ist.psu.edu/hafizogullari99dependence.html" }
Citations (may not include all citations):866 Techniques and Tools (context) - Aho, Sethi et al. - 1986
809 A theory of type polymorphism in programming (context) - Milner - 1978
318 IEEE Transactions on Software Engineering (context) - Weiser - 1984
210 Til: A type-directed optimizing compiler for ML - Tarditi, Morrisett et al. - 1996
165 Set-based analysis of ML programs (context) - Heintze - 1994
146 The Glasgow Haskell compiler: a technical overview - Jones, Hall et al. - 1993
143 Foundations of Constructive Mathematics (context) - Beeson - 1985
94 Projections for strictness analysis - Wadler, Hughes - 1987
85 Type inference with simple subtypes (context) - Mitchell - 1991
54 Strictness analysis on non-flat domains (context) - Wadler - 1987
47 Program specialization via program slicing - Reps, Turnidge - 1996
34 Department of Computer Science (context) - Birkedal, Rothwell et al. - 1993
31 Optimizing layered communication protocols (context) - Hayden, van Renesse - 1996
19 Partial Evaluation and Mixed Computation (context) - Bjorner, Ershov et al. - 1987
18 Dependence analysis for recursive data - Liu - 1998
13 A proof environment for the development of group communicati.. - Kreitz, Hayden et al. - 1998
11 Formal reasoning about communication systems I: Embedding ML.. (context) - Kreitz - 1997
8 Using subtyping in program optimization (context) - Berardi, Boerio - 1995
8 Extraction of redundancy-free programs from constructive nat.. (context) - Takayama - 1991
6 Projection Factorizations in Partial Evaluation (context) - Launchbury - 1989
6 Pruning simply typed lambda terms (context) - Berardi
4 Refinement Types for Program Analysis (context) - Coppo, Damiani et al. - 1996
2 Dead code elimination through type inference (context) - Hafizogullari, Kreitz - 1998
1 s programs from proofs in second order lambda-calculus (context) - Paulin-Mohring - 1989
Documents on the same site (http://www.cs.cornell.edu/Info/Projects/NuPrl/html/publication.html): More
The Structure of Nuprl's Type Theory - Constable (1997) (Correct)
Formalizing Constructive Real Analysis - Forester (1993) (Correct)
Formalizing Automata II: Decidable Properties - Constable (Correct)
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