Abstract is missing.
- Safe Folding/Unfolding with Conditional NarrowingMaría Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal. 1-15
- Optimal Non-deterministic Functional Logic ComputationsSergio Antoy. 16-30
- A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm ConstraintsMichael Codish, Cohavit Taboch. 31-45
- Parallelizing Functional Programs by GeneralizationAlfons Geser, Sergei Gorlatch. 46-60
- Higher-Order Equational Unification via Explicit SubstitutionsClaude Kirchner, Christophe Ringeissen. 61-75
- Parameterised Higher-Order Algebraic SpecificationsL. J. Steggles. 76-98
- Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic LanguageTaro Suzuki, Koji Nakagawa, Tetsuo Ida. 99-113
- On Composable Properties of Term Rewriting SystemsTakahito Aoto, Yoshihito Toyama. 114-128
- Needed Reductions with Context-Sensitive RewritingSalvador Lucas. 129-143
- Conditional Term Graph RewritingEnno Ohlebusch. 144-158
- Lazy Narrowing with Parametric Order Sorted TypesJesús Manuel Almendros-Jiménez, Ana Gil-Luezas. 159-173
- Termination of Algebraic Type Systems: The Syntactic ApproachGilles Barthe, Femke van Raamsdonk. 174-193
- Proof Net Semantics of Proof Search ComputationLuís Caires, Luís Monteiro. 194-208
- Explicit Substitutions for the Lambda-CalculusGilles Barthe, Fairouz Kamareddine, Alejandro Ríos. 209-223
- A Left-Linear Variant of Lambda-SigmaA. César, H. Muñoz. 224-239
- Perpetuality and Uniform NormalizationZurab Khasidashvili, Mizuhito Ogawa. 240-255
- Model Generation with Existentially Quantified Variables and ConstraintsSlim Abdennadher, Heribert Schütz. 256-272
- Optimal Left-to-Right Pattern-Matching AutomataNadia Nedjah, Colin D. Walter, Stephen E. Eldridge. 273-286 [doi]