Abstract is missing.
- Programming with Multiple Paradigms in LuaRoberto Ierusalimschy. 1-12 [doi]
- Constraint Based StrategiesClaude Kirchner, Florent Kirchner, Hélène Kirchner. 13-26 [doi]
- Integrating ILOG CP Technology into ::::TOY::::/mathcal{TOY}Ignacio Castiñeiras, Fernando Sáenz-Pérez. 27-43 [doi]
- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data StructuresStephan Falke, Deepak Kapur. 44-61 [doi]
- Semantic Labelling for Proving Termination of Combinatory Reduction SystemsMakoto Hamana. 62-78 [doi]
- A Taxonomy of Some Right-to-Left String-Matching AlgorithmsManuel Hernández. 79-95 [doi]
- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential TypesYuki Kato, Koji Nakazawa. 96-110 [doi]
- Fast and Accurate Strong Termination Analysis with an Application to Partial EvaluationMichael Leuschel, Salvador Tamarit, Germán Vidal. 111-127 [doi]
- New Results on Type Systems for Functional Logic ProgrammingFrancisco Javier López-Fraguas, Enrique Martin-Martin, Juan Rodríguez-Hortalá. 128-144 [doi]
- A Simple Region Inference Algorithm for a First-Order Functional LanguageManuel Montenegro, Ricardo Peña-Marí, Clara Segura. 145-161 [doi]
- A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda AbstractionsRafael del Vado Vírseda, Ignacio Castiñeiras. 162-178 [doi]