Abstract is missing.
- Improving Binding Times Without Explicit CPS-ConversionAnders Bondorf. 1-10 [doi]
- Safe Fusion of Functional ExpressionsWei-Ngan Chin. 11-20 [doi]
- Compiling Lazy Pattern MatchingLuc Maranget. 21-31 [doi]
- Caching Considerations for Generational Garbage CollectionPaul R. Wilson, Michael S. Lam, Thomas G. Moher. 32-42 [doi]
- Improving the Performance of SML Garbage Collection Using Application-Specific Virtual Memory ManagementEric Cooper, Scott Nettles, Indira Subramanian. 43-52 [doi]
- Polymorphic Type Reconstruction for Garbage Collection Without TagsBenjamin Goldberg, Michael Gloger. 53-65 [doi]
- Projective MLDidier Rémy. 66-75 [doi]
- Parsers in MLDaniel de Rauglaudre, Michel Mauny. 76-85 [doi]
- Interactive Modular Programming in SchemeSho-Huan Simon Tung. 86-95 [doi]
- Finiteness Conditions for Fixed Point IterationFlemming Nielson, Hanne Riis Nielson. 96-108 [doi]
- A Syntactic Approach to Fixed Point Computation on Finite DomainsTyng-Ruey Chuang, Benjamin Goldberg. 109-118 [doi]
- Abstract Interpretation in Weak PowerdomainsRobert Muller, Yuli Zhou. 119-126 [doi]
- A Precise Relationship Between the Deductive Power of Forward and Backward Strictness AnalysisMarc Neuberger, Prateek Mishra. 127-138 [doi]
- Proving Memory Management Invariants for a Language Based on Linear LogicJawahar Chirimar, Carl A. Gunter, Jon G. Riecke. 139-150 [doi]
- Proving the Correctness of Storage RepresentationsMitchell Wand, Dino Oliva. 151-160 [doi]
- On Extending Computational Adequacy by Data AbstractionVal Tannen, Ramesh Subrahmanyam. 161-169 [doi]
- Parametric Type ClassesKung Chen, Paul Hudak, Martin Odersky. 170-181 [doi]
- A Calculus for Overloaded Functions with SubtypingGiuseppe Castagna, Giorgio Ghelli, Giuseppe Longo. 182-192 [doi]
- Type Inference in the Presence of Overloading, Subtyping and Recursive TypesStefan Kaes. 193-204 [doi]
- Global Tagging Optimization by Type InferenceFritz Henglein. 205-215 [doi]
- Taming the Y OperatorGuillermo Juan Rozas. 226-234 [doi]
- Integrating the Scheme and C LanguagesJohn R. Rose, Hans Muller. 247-259 [doi]
- Tachyon Common Lisp: An Efficient and Portable Implementation of CLtL2Atsushi Nagasaka, Yoshihiro Shintani, Tanji Ito, Hiroshi Gomi, Junichi Takahashi. 270-277 [doi]
- A Confluent Calculus of Macro Expansion and EvaluationAna Bove, Laura Arbilla. 278-287 [doi]
- Reasoning About Programs in Continuation-Passing StyleAmr Sabry, Matthias Felleisen. 288-298 [doi]
- Back to Direct Style II: First-Class ContinuationsOlivier Danvy, Julia L. Lawall. 299-310 [doi]
- Dynamic Program ParallelizationLorenz Huelsbergen, James R. Larus. 311-323 [doi]
- Global Analysis for Partitioning Non-Strict Programs into Sequential ThreadsKenneth R. Traub, David E. Culler, Klaus E. Schauser. 324-334 [doi]
- Fast Parallel Implementation of Lazy Languages - The EQUALS ExperienceOwen Kaser, Shaunak Pawagi, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar. 335-344 [doi]
- A Foundation for an Efficient Multi-Threaded Scheme SystemSuresh Jagannathan, James Philbin. 345-357 [doi]