POPL 1998
32 papers
- A Functional Representation of Data Structures with a Hole
- A Type System for Java Bytecode Subroutines
- A Typed Language for Distributed Mobile Processes (Extended Abstract)
- Alias Analysis of Executable Code
- Array SSA Form and Its Use in Parallelization
- Barrier Inference
- Bridging the Gulf: A Common Intermediate Language for ML and Haskell
- Classes and Mixins
- Correctness of Monadic State: An Imperative Call-by-Need Calculus
- Data Flow Analysis is Model Checking of Abstract Interpretations
- Dynamic Typing as Staged Type Inference
- Edge Profiling versus Path Profiling: The Showdown
- Escape Analysis: Correctness Proof, Implementation and Experimental Results
- Fast Interprocedural Class Analysis
- From Polyvariant Flow Information to Intersection and Union Types
- From System F to Typed Assembly Language
- Higher-Order unCurrying
- Inference of Polymorphic and Conditional Strictness Properties
- Javalight is Type-Safe - Definitely
- Local Type Inference
- Manufacturing Cheap, Resilient, and Stealthy Opaque Constructs
- Maximal Static Expansion
- Parallel Beta Reduction is not Elementary Recursive
- Parallelization in Calculational Forms
- Path-Sensitive Value-Flow Analysis
- Putting Pointer Analysis to Work
- Second-Order Unification and Type Inference for Church-Style Polymorphism
- Secure Information Flow in a Multi-Threaded Imperative Language
- Security Properties of Typed Applets
- Single and Loving It: Must-Alias Analysis for Higher-Order Languages
- Static Typing for Dynamic Messages
- The SLam Calculus: Programming with Secrecy and Integrity