1. Termination of Term Rewriting Using Dependency Pairs;Arts;Theoretical Computer Science,2000
2. Context-Sensitive Dependency Pairs;Alarcón,2006
3. Building .NET GUIs for Haskell applications;Alarcón,2006
4. Recursive Path Orderings can be Context-Sensitive;Borralleras,2002
5. Solving Partial Order Constraints for LPO Termination;Codish,2006