Abstract is missing.
- Fast and Accurate Flow-Insensitive Points-To AnalysisMarc Shapiro 0002, Susan Horwitz. 1-14 [doi]
- Partitioning Dataflow Analyses Using TypesErik Ruf. 15-26 [doi]
- Shape TypesPascal Fradet, Daniel Le Métayer. 27-39 [doi]
- Objective ML: A Simple Object-Oriented Extension of MLDidier Rémy, Jerome Vouillon. 40-53 [doi]
- Rolling Your Own MADT - A Connection Between Linear Types and MonadsChih-Ping Chen, Paul Hudak. 54-66 [doi]
- Search and Imperative ProgrammingKrzysztof R. Apt, Andrea Schaerf. 67-79 [doi]
- A Unified Computation Model for Functional and Logic ProgrammingMichael Hanus. 80-93 [doi]
- Call by Need Computations to Root-Stable FormAart Middeldorp. 94-105 [doi]
- Proof-Carrying CodeGeorge C. Necula. 106-119 [doi]
- Is Just in Time = Better Late than Never ?Michael P. Plezbert, Ron Cytron. 120-131 [doi]
- Parameterized Types for JavaAndrew C. Myers, Joseph A. Bank, Barbara Liskov. 132-145 [doi]
- Pizza into Java: Translating Theory into PracticeMartin Odersky, Philip Wadler. 146-159 [doi]
- Determining the Idle Time of a TilingKarin Högstedt, Larry Carter, Jeanne Ferrante. 160-173 [doi]
- Model Checking for Programming Languages using VerisoftPatrice Godefroid. 174-186 [doi]
- Synchronization Transformations for Parallel ComputingPedro C. Diniz, Martin C. Rinard. 187-200 [doi]
- Maximizing Parallelism and Minimizing Synchronization with Affine TransformsAmy W. Lim, Monica S. Lam. 201-214 [doi]
- A Curry-Howard Foundation for Functional Computation with ControlC.-H. Luke Ong, Charles A. Stewart. 215-227 [doi]
- The Pi-calculus in Direct StyleGérard Boudol. 228-241 [doi]
- Behavioral Equivalence in the Polymorphic Pi-calculusBenjamin C. Pierce, Davide Sangiorgi. 242-255 [doi]
- Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculusCatuscia Palamidessi. 256-265 [doi]
- Program Fragments, Linking, and ModularizationLuca Cardelli. 266-277 [doi]
- Minimal Typings in Atomic SubtypingJakob Rehof. 278-291 [doi]
- Typing Algorithm in Type Theory with InheritanceAmokrane Saïbi. 292-301 [doi]
- Type-Checking Higher-Order Polymorphic Multi-MethodsFrançois Bourdoncle, Stephan Merz. 302-315 [doi]
- Infinitary Control Flow Analysis: a Collecting Semantics for Closure AnalysisHanne Riis Nielson, Flemming Nielson. 332-345 [doi]
- Automatic Verification of Parameterized Linear Networks of ProcessesDavid Lesens, Nicolas Halbwachs, Pascal Raymond. 346-357 [doi]
- A Demand-Driven Set-Based AnalysisSandip K. Biswas. 372-385 [doi]
- Denotational Semantics Using an Operationally-Based Term ModelMitchell Wand, Gregory T. Sullivan. 386-399 [doi]
- Constraints to Stop Higher-Order DeforestationHelmut Seidl, Morten Heine Sørensen. 400-413 [doi]
- Reducing Nondeterminism while Specializing Logic ProgramsAlberto Pettorossi, Maurizio Proietti, Sophie Renault. 414-427 [doi]
- From SOS Rules to Proof Principles: An Operational Metatheory for Functional LanguagesDavid Sands. 428-441 [doi]
- Relational Parametricity and Units of MeasureAndrew Kennedy. 442-455 [doi]
- High Level Reading and Data Structure CompilationRobert Paige, Zhe Yang. 456-469 [doi]
- Polyp - A Polytypic Programming LanguagePatrik Jansson, Johan Jeuring. 470-482 [doi]
- First-class Polymorphism with Type InferenceMark P. Jones. 483-496 [doi]