Abstract is missing.
- C--: A Portable Assembly Language that Supports Garbage CollectionSimon L. Peyton Jones, Norman Ramsey, Fermin Reig. 1-28
- On Formalised Proofs of Termination of Recursive FunctionsFairouz Kamareddine, François Monin. 29-46
- Argument Filtering TransformationKeiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama. 47-61
- A Primitive Calculus for Module SystemsDavide Ancona, Elena Zucca. 62-79
- Non-dependent Types for Standard ML ModulesClaudio V. Russo. 80-97
- Constraint Programming in OPLPascal Van Hentenryck, Laurent Michel, Laurent Perron, Jean-Charles Régin. 98-116
- Compiling Constraint Handling Rules into Prolog with Attributed VariablesChristian Holzbaur, Thom W. Frühwirth. 117-133
- Parallel Execution Models for Constraint Programming over Finite DomainsAlvaro Ruiz-Andino, Lourdes Araujo, Fernando Sáenz, José J. Ruz. 134-151
- Functional Plus Logic Programming with Built-In and Symbolic ConstraintsPuri Arenas-Sánchez, Francisco Javier López-Fraguas, Mario Rodrúguez-Arteljo. 152-169
- A Calculus for Interaction NetsMaribel Fernández, Ian Mackie. 170-187
- Distributed Programming in a Multi-Paradigm Declarative LanguageMichael Hanus. 188-205
- Logical and Meta-Logical Frameworks (Abstract)Frank Pfenning. 206
- A Simple and General Method for Integrating Abstract Interpretation in SICStusDante Baldan, Nicola Civran, Gilberto Filé, Francesco Pulvirenti. 207-223
- Run Time Type Information in MercuryTyson Dowd, Zoltan Somogyi, Fergus Henderson, Thomas Conway, David Jeffery. 224-243
- A Virtual Machine for a Process CalculusLuís M. B. Lopes, Fernando M. A. Silva, Vasco Thudichum Vasconcelos. 244-260
- Optimising Bytecode Emulation for PrologVítor Santos Costa. 261-277
- OPENLOG: A Logic Programming Language Based on AbductionJacinto A. Dávila. 278-293
- An Operational Semantics of StarlogLunjin Lu, John G. Cleary. 294-310
- On the Verification of Finite FailureRoberta Gori, Giorgio Levi. 311-327
- Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-SlicesUlrich Neumerkel, Frédéric Mesnard. 328-342
- Modular Termination Proofs for Prolog with TablingSofie Verbaeten, Konstantinos F. Sagonas, Danny De Schreye. 342-359
- Declarative Program Transformation: A Deforestation Case-StudyLoïc Correnson, Étienne Duris, Didier Parigot, Gilles Roussel. 360-377
- A Semantic Account of Type-Directed Partial EvaluationAndrzej Filinski. 378-395
- A Parameterized Unfold/Fold Transformation Framework for Definite Logic ProgramsAbhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan. 396-413
- Widening SharingEnea Zaffanella, Roberto Bagnara, Patricia M. Hill. 414-432