Abstract is missing.
- Thunks (Continued)Olivier Danvy, John Hatcliff. 3-11
- Transformation of Gamma ProgramsChris Hankin, Daniel Le Métayer, David Sands. 12-19
- Value Transforming StyleChristian Queinnec. 20-28
- Automatic Generation of Valid Linear Measures for CLP(Q) ProgramsFrédéric Mesnard, Marianne Morillon. 29-34
- Efficient Analysis of Reactive Properties of Concurrent Constraint Logic ProgramsMichael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough. 35-42
- Static Analysis of CLP Programs over Numeric DomainsRoberto Bagnara, Roberto Giacobazzi, Giorgio Levi. 43-50
- The Mu-Calculus over Finite Domains as an Abstract Semantics of PrologMarc-Michel Corsini, Kaninda Musumbu, Antoine Rauzy. 51-59
- Minimal Function Graphs are not InstrumentedAlan Mycroft, Mads Rosendahl. 60-67
- Sharing Analysis of Lazy First-Order Functional ProgramsGeoff W. Hamilton. 68-78
- Approximations d évaluateurs fonctionnelsBernard P. Serpette. 79-90
- Order-of-Demand Analysis for Lazy LanguagesYoung Gil Park, Benjamin Goldberg. 91-101
- Partial Evaluation applied to Symbolic Pattern Matching with Intelligent BacktrackChristian Queinnec, P. Geffroy. 109-117
- Program Transformation in a Nonmonotonic Reasoning SystemTadashi Araragi. 135-143
- Axiomatising Uniform Properties of Recursive Data StructuresThomas P. Jensen. 144-151
- Speeding Up Parallelism Detection for Attribute GrammarsMatthijs F. Kuiper. 152-162
- Weighted Systems RevisitedPhilippe Devienne, Patrick Lebègue, Jean-Christophe Routier. 163-173
- Analysis of Concurrent Transactions in a Functional Database Programming LanguageGiuseppe Amato, Fosca Giannotti, Gianni Mainetto. 174-184
- Inférer rapidement la géométrie des collectionsJean-Louis Giavitto, Jean-Paul Sansonnet, Olivier Michel. 185-193
- Using Abstract Interpretation for Gate splitting in LOTOS SpecificationsFosca Giannotti, Diego Latella. 194-204
- An Application of Abstract Interpretation to Floating Point ArithmeticYamine Aït Ameur, Patrice Cros, J.-J. Falcon, A. Gomez. 205-212
- On Boolean Feature TypesPaul Y. Gloess, Y.-N. Huang, Chu Min Li, M.-A. Hernandez. 213-220
- Relevant Logic and Strictness AnalysisClement A. Baker-Finch. 221-228
- On the Design of Generic Abstract Interpretation FrameworksBaudouin Le Charlier, Pascal Van Hentenryck. 229-246
- Inference Systems for Binding Time AnalysisKirsten Lackner Solberg, Hanne Riis Nielson, Flemming Nielson. 247-254
- Decompilation is the Efficient Enumeration of TypesPeter T. Breuer, Jonathan P. Bowen. 255-273
- Fractional TypesBruno Monsuez. 274-284
- Static Analysis for Logic Program SpecificationJohn P. Gallagher. 285-294
- Towards Optimization of Full Prolog Programs guided by Abstract InterpretationAnne Parrain, Philippe Devienne, Patrick Lebègue. 295-303
- An Abstract Interpretation Algorithm for Residuating Logic ProgramsMichael Hanus. 304-312
- Control-Flow Effects for Escape AnalysisYan Mei Tang, Pierre Jouvelot. 313-321
- Partial Evaluation of Interaction NetsDenis Béchet. 331-338