Abstract is missing.
- Abstract Diagnosis of Functional ProgramsMaría Alpuente, Marco Comini, Santiago Escobar, Moreno Falaschi, Salvador Lucas. 1-16 [doi]
- A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/KleeneFrancisco Gutiérrez, Blas C. Ruiz. 17-31 [doi]
- Constraint Solver Synthesis Using Tabled Resolution for Constraint Logic ProgrammingSlim Abdennadher, Christophe Rigotti. 32-47 [doi]
- Translating Datalog-Like Optimization Queries into ILOG ProgramsGianluigi Greco, Sergio Greco, Irina Trubitsyna, Ester Zumpano. 48-49 [doi]
- Tabling Structures for Bottom-Up Logic ProgrammingRoger Clayton, John G. Cleary, Bernhard Pfahringer, Mark Utting. 50-51 [doi]
- A General Framework for Variable Aliasing: Towards Optimal Operators for Sharing PropertiesGianluca Amato, Francesca Scozzari. 52-70 [doi]
- Two Variables per Linear Inequality as an Abstract DomainAxel Simon, Andy King, Jacob M. Howe. 71-89 [doi]
- Convex Hull Abstractions in Specialization of CLP ProgramsJulio C. Peralta, John P. Gallagher. 90-108 [doi]
- Collecting Potential OptimisationsNancy Mazur, Gerda Janssens, Wim Vanhoof. 109-110 [doi]
- An Operational Approach to Program Extraction in the Calculus of ConstructionsMaribel Fernández, Paula Severi. 111-125 [doi]
- Refinement of Higher-Order Logic ProgramsRobert Colvin, Ian J. Hayes, David Hemer, Paul A. Strooper. 126-143 [doi]
- A Generic Program for Minimal Subsets with ApplicationsRudolf Berghammer. 144-157 [doi]
- Justification Based on Program TransformationHai-Feng Guo, C. R. Ramakrishnan, I. V. Ramakrishnan. 158-159 [doi]
- Combining Logic Programs and Monadic Second Order Logics by Program TransformationFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. 160-181 [doi]
- Verification in ACL2 of a Generic Framework to Synthesize SAT-ProversFrancisco-Jesús Martín-Mateos, José-Antonio Alonso, María-José Hidalgo, José-Luis Ruiz-Reina. 182-198 [doi]
- A Proof System for Information Flow SecurityAnnalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi. 199-218 [doi]
- Forward Slicing of Multi-paradigm Declarative Programs Based on Partial EvaluationGermán Vidal. 219-237 [doi]
- A Fixed Point Semantics for Logic Programs Extended with CutsWim Vanhoof, Remko Tronçon, Maurice Bruynooghe. 238-257 [doi]
- Abstract Partial Deduction ChallengedStefan Gruner. 258-259 [doi]
- Towards Correct Object-Oriented Design Frameworks in Computational LogicKung-Kiu Lau, Mario Ornaghi. 260-261 [doi]
- Mapping Modular SOS to Rewriting LogicChristiano de O. Braga, Edward Hermann Haeusler, José Meseguer, Peter D. Mosses. 262-277 [doi]
- Program Synthesis Based on the Equivalent Transformation Computation ModelKiyoshi Akama, Ekawit Nantajeewarawat, Hidekatsu Koike. 278-279 [doi]