Sistemas Informáticos y Computación

1996

1. A recursive path ordering for higher-order terms in η-long β-normal form

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2. A rewriting logic for declarative programming

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

3. Eden - the paradise of functional concurrent programming

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

4. Free variable tableaux for a many sorted logic with preorders

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

5. Functional skeletons generate process topologies in Eden

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

6. New look at pattern matching in abstract data types

   Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

7. Proving progress properties of non terminating programs under fairness assumptions

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

8. Reasoning with preorders and dynamic sorts using free variable tableaux

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

9. Supporting object reuse through case-based reasoning

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

10. Theorem proving modulo associativity

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)