---

Home | DMP | Project | Journal | Contact
Relevant Java Classes | Delete Call Site | Template Call Graph | Research | Final Report

---

• Type Handling Procedures
• Type Classification*
  • Concrete Types vs. Abstract Types
    • Concrete Types
    • Abstract Types
    • Class Types
    • Relevance
  • General Types vs. Specific Types
    • Introduction
    • Relevance
• Polymorphism*
• Type Inference Algorithms and Call Graph Construction*
  • Introduction
  • The Basic Algorithm: Introduction to Constraint-Based Analysis
  • Templates
    • Agesen
    • Simplified View
  • Shortcomings of the Basic Algorithm
  • Polyvariant Algorithms
  • The Cartesian Product Algorithm (CPA)
    • Cartesian Products
    • CPA In Action
    • Avoiding Iteration
    • Additional Reading
• Flow-Sensitive Analysis of Variable Accesses*
• Reaching Definitions*
  • Introduction
  • What Are Reaching Definitions?
  • Using Reaching Definitions In Type Inference
  • Computation of Reaching Definitions
    • Polyvariance
    • Integration of Type Inference and Reaching Definitions
  • Reaching Definitions in FLEX
• Incremental Analysis

* Some or all information in these sections from two papers by Ole Agesen: The Cartesian Product Algorithm: Simple and Precise Type Inference of Parametric Polymorphism and Concrete Type Inference: Delivering Object-Oriented Applications. Other sources are cited within the text.