10. PLILP / 7. ALP 1998: Pisa, Italy

Catuscia Palamidessi, Hugh Glaser, Karl Meinke (Eds.): Principles of Declarative Programming, 10th International Symposium, PLILP'98 Held Jointly with the 7th International Conference, ALP'98, Pisa, Italy, September 16-18, 1998, Proceedings. Lecture Notes in Computer Science 1490 Springer 1998, ISBN 3-540-65012-1

Verification: Invited Paper

Baoqiu Cui, Yifei Dong, Xiaoqun Du, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Abhik Roychoudhury, Scott A. Smolka, David Scott Warren:
Logic Programming and Model Checking. 1-20

Logic Programming I

Bart Demoen, Konstantinos F. Sagonas:
CAT: The Copying Approach to Tabling. 21-35
Jesper Eskilson, Mats Carlsson:
SICStus MT - A Multithreaded Execution Environment for SICStus Prolog. 36-53
Wim Vanhoof, Danny De Schreye, Bern Martens:
A Framework for Bottom Up Specialisation of Logic Programs. 54-72
Jan-Georg Smaus, Patricia M. Hill, Andy King:
Termination of Logic Programs with block Declarations Running in Several Modes. 73-88

Static Analysis

Michael Codish, Harald Søndergaard:
The Boolean Logic of Set Sharing Analysis. 89-101
Giorgio Levi, Paolo Volpe:
Derivation of Proof Methods by Abstract Interpretation. 102-117
Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker:
Detecting Unsolvable Queries for Definite Logic Programs. 118-133
John Hatcliff, Matthew B. Dwyer, Shawn Laubach:
Staging Static Analyses Using Abstraction-Based Program Specialization. 134-151
Giorgio Levi, Fausto Spoto:
An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. 152-169

Software Methodologies: Invited Paper

Charles Consel, Renaud Marlet:
Architecture Software Using: A Methodology for Language Development. 170-194

Object Oriented Programming

Delia Kesner, Pablo E. Martínez López:
Explicit Substitutions for Objects and Functions. 195-212
Enrico Pontelli, Desh Ranjan, Gopal Gupta:
The Complexity of Late-Binding in Dynamic Object-Oriented Languages. 213-229

Term Rewriting

Pierre-Etienne Moreau, Hélène Kirchner:
A Compiler for Rewrite Programs in Associative-Commutative Theories. 230-249
Takahito Aoto:
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems. 250-265
Sébastien Limet, Frédéric Saubion:
A General Framework for R-Unification Problems. 266-281

Semantics: Tutorial

Andrew M. Pitts:
Operational Versus Denotational Methods in the Semantics of Higher Order Languages. 282-283

Functional Programming

Conal Elliott:
Functional Implementations of Continuos Modeled Animation. 284-299
Marc Feeley, Martin Larose:
Compiling Erlang to Scheme. 300-317
Silvia Breitinger, Ulrike Klusik, Rita Loogen:
From (Sequential) Haskell to (Parallel) Eden: An Implementation Point of View. 318-334
David Wakeling:
Mobile Haskell: Compiling Lazy Functional Programs for the Java Virtual Machine. 335-352

Metaprogramming: Tutorial

John Hannan:
Program Analysis in Lambda-Prolog. 353-354

Logic Programming II

Roberto Di Cosmo, Jean-Vincent Loddo, Stephane Nicolet:
A Game Semantics Foundation for Logic Programming (Extended Abstract). 355-373
Michael Hanus, Frank Steiner:
Controlling Search in Declarative Programs. 374-390
James Lipton, Robert McGrail:
Encapsulating Data in Logic Programming via Categorial Constraints. 391-410
John G. Cleary, Lunjin Lu:
Constructive Negation Using Typed Existence Properties. 411-426

Optimal Evaluation: Tutorial

Andrea Asperti:
Optimal Reduction of Functional Expressions. 427-428

Integration

Puri Arenas-Sánchez, Francisco Javier López-Fraguas, Mario Rodrúguez-Arteljo:
Embedding Multiset Constraints into a Lazy Functional Logic Language. 429-444
Joseph A. Goguen, Grant Malcolm, Tom Kemp:
A Hidden Herbrand Theorem. 445-462

Constraint Solving

Farid Ajili, Hendrik C. R. Lock:
Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems. 463-480
Philippe Refalo:
Approaches to the Incremental Detection of Implicit Equalities with the Revised Simplex Method. 481-496