PPDP 1999: Paris, France

Gopalan Nadathur (Ed.): Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29 - October 1, 1999, Proceedings. Lecture Notes in Computer Science 1702 Springer 1999, ISBN 3-540-66540-4

@proceedings{DBLP:conf/ppdp/1999,
  editor    = {Gopalan Nadathur},
  title     = {Principles and Practice of Declarative Programming, International
               Conference PPDP'99, Paris, France, September 29 - October 1,
               1999, Proceedings},
  booktitle = {PPDP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1702},
  year      = {1999},
  isbn      = {3-540-66540-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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