GULP-PRODE 1994:
Peñiscola,
Spain
María Alpuente, Roberto Barbuti, Isidro Ramos (Eds.):
1994 Joint Conference on Declarative Programming, GULP-PRODE'94 Peñiscola, Spain, September 19-22, 1994, Volume 1.
1994 
- John W. Lloyd:
Practical Advtanages of Declarative Programming.
18-30
- Michael Nitsche:
Analysis and Refinement of Constraint Answer Sets in a Planning System.
31-45
- Paolo Mascellani, Dino Pedreschi:
Proving termination of Prolog programs.
46-61
- María Alpuente, Moreno Falaschi, María José Ramis, Germán Vidal:
A Compositional Semantics for Conditional Term Rewriting Systems.
62-76
- Roberto Giacobazzi:
Characterizing Abstract Program Properties by Abduction.
77-91
- Baudouin Le Charlier, Sabina Rossi, Pascal Van Hentenryck:
An Abstract Interpretation Framework for (almost) Full Prolog.
92-106
- Paolo Volpe:
Semantics of Concurrent Logic Programming as Uniform Proofs.
107-124
- Salvador Lucas, Javier Oliver:
El lambda-calculo Etiquetado Paralelo (LCEP).
125-139
- Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi:
Confluence and Concurrent Constraint Programming.
140-154
- F. Buffoli:
Split Resolution Tailoring Tableaux to Refute Clause Sets.
155-169
- Marco Comini, Giorgio Levi:
An Algebraic Theory of Observables.
170-186
- Maurizio Martelli, Alessandro Messora, Catuscia Palamidessi, Alain Hui-Bon-Hoa:
Fixpoint Semantics of L lambda.
187-201
- Maurizio Proietti, Alberto Pettorossi:
Total correctness of a goal replacement rule based on the unfold/fold proof method.
203-217
- Sandro Etalle, Maurizio Gabbrielli:
Modular Transformations of CLP Programs.
218-233
- K. Bohlmann, Rita Loogen, Yolanda Ortega-Mallén:
Towards a Functional Process Calculus.
234-250
- Ramiro Varela:
El modelo RPS para la gestion del paralelismo AND independiente en programas logicos.
251-265
- José E. Gallardo, P. Guerrero, Blas C. Ruiz:
Monadas y Procesos Funcionales Comunicantes.
266-280
- Francisco Bueno:
Methods for Automatic Compile-time Parallelization of Logic Programs: the MEL, CDG and UDG Algorithms Revisited.
281-295
- Nai-Wei Lin:
Optimizing Logic Programs with Finite Domain Constraints.
297-311
- Roberto Bagnara:
On the Detection of Implicit and Redundant Numeric Constraint in CLP Programs.
312-326
- Michael Codish, Bart Demoen:
Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop.
327-341
- María-del-Mar Gallardo, José M. Troya:
Granularity Analysis of Concurrent Logic Languages based on Abstract Interpretation.
342-356
- Gilberto Filé, Francesco Ranzato:
Improving Abstract Interpretations by Systematic Lifting to the Powerset.
357-371
- Agostino Cortesi, Gilberto Filé, William H. Winsborough:
The Quotient of an Abstract Interpretation for Comparing Static Analyses.
372-387
- Filomena Ferrucci, Giuliano Pacini, Maria I. Sessa:
Loop Checking for Reduced SLD-derivations.
388-402
- Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti, Gianfranco Rossi:
Solving Systems of Equations over Hypersets.
403-417
- Dino Pedreschi, Salvatore Ruggieri:
Termination is Language-Independent.
418-433
- Anastasia Analyti, Sakti Pramanik:
Semantics for Reasoning with Contradictory Extended Logic Programs.
434-448
- Francesco Buccafurri, Nicola Leone, Pasquale Rullo:
A non-deterministic semantics for ordered logic programs.
449-463
- Roberta Gori, Giorgio Levi:
Finite Failure is AND-Compositional.
464-478
Copyright © Tue Dec 22 21:40:36 2009
by Michael Ley (ley@uni-trier.de)
