POPL 1997
37 papers
- A Curry-Howard Foundation for Functional Computation with Control
- A Demand-Driven Set-Based Analysis
- A Unified Computation Model for Functional and Logic Programming
- Automatic Verification of Parameterized Linear Networks of Processes
- Behavioral Equivalence in the Polymorphic Pi-calculus
- Call by Need Computations to Root-Stable Form
- Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculus
- Constraints to Stop Higher-Order Deforestation
- Denotational Semantics Using an Operationally-Based Term Model
- Determining the Idle Time of a Tiling
- Fast and Accurate Flow-Insensitive Points-To Analysis
- First-class Polymorphism with Type Inference
- From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages
- High Level Reading and Data Structure Compilation
- Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis
- Is "Just in Time" = "Better Late than Never"?
- Maximizing Parallelism and Minimizing Synchronization with Affine Transforms
- Minimal Typings in Atomic Subtyping
- Model Checking for Programming Languages using Verisoft
- Objective ML: A Simple Object-Oriented Extension of ML
- On the Complexity of Escape Analysis
- Parameterized Types for Java
- Partitioning Dataflow Analyses Using Types
- Pizza into Java: Translating Theory into Practice
- Polyp - A Polytypic Programming Language
- Program Fragments, Linking, and Modularization
- Proof-Carrying Code
- Reducing Nondeterminism while Specializing Logic Programs
- Relational Parametricity and Units of Measure
- Rolling Your Own MADT - A Connection Between Linear Types and Monads
- Search and Imperative Programming
- Shape Types
- Synchronization Transformations for Parallel Computing
- The Pi-calculus in Direct Style
- Type-Checking Higher-Order Polymorphic Multi-Methods
- Types as Abstract Interpretations
- Typing Algorithm in Type Theory with Inheritance