APLAS 2001
29 papers
- A Compositional Framework for Querying Optimized Ranges
- A Differential Evaluation of Fixpoint Iterations
- A Type System for the Push-Enter Model
- Abstract A* Algorithm and Its Application to Linearly Priced Timed Automata
- Abstract Interpretation over Infinite Abstract Domains (Tentative Report)
- An Accumulative Parallel Skeleton for All
- An Effect System Combining Alias and Liveness for Explicit Memory Reuse
- Analysis of Secure Information Flow by Model-Checking
- Collaborative Constraint Functional Logic Programming in an Open Environment
- Computability and Complexity Results for a Spatial Assertion Language for Data Structures
- Developing the Generic Path Algorithmic Program and its Instantiations Using PAR Method
- Dynamic Control Operators in Type Theory
- Efficient Interpretation of Chart Pattern Language
- Efficient Model-Checking of Timed Automata with Clock-Restriction Diagram
- Estimating Exception-Induced Control Flow for Java
- Exploring Dataflow in Legacy Systems
- Functional Quantum Programming
- Higher-Order Polymorphic Sized Types for Safety Checks
- Jones Optimality and the Strength of Program Specializers
- Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
- On Modular Transformations of Structural Content
- Optimizing Compilation of Concurrent Logic Programs Directed by Interface Analysis
- Proof-Directed Compilation for Inter-operable Languages
- Resource Usage Analysis
- Resource-Passing Concurrent Programming
- Simple Type Inference for Structural Polymorphism
- Static Monotonicity Analysis for lambda-Definable Functions. over Lattices
- VM lambda: a Functional Calculus for Scientific Discovery
- Verifying the CPS Transformation in Isabelle/HOL