Sistemas Informáticos y Computación

1996

1. A Maude specification of an object-oriented database model for telecommunication networks

   Electronic Notes in Theoretical Computer Science, Vol. 4, Núm. C, pp. 405-423

2. A new look at pattern matching in abstract data types

   SIGPLAN Notices (ACM Special Interest Group on Programming Languages), Vol. 31, Núm. 6, pp. 110-121

3. 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)

4. A rewriting logic for declarative programming

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

5. Eden - the paradise of functional concurrent programming

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

6. 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)

7. Functional skeletons generate process topologies in Eden

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

8. Graphical visualization of the evaluation of functional programs

   SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education), Vol. 28, Núm. Special Issu, pp. 36-38

9. Inclusions and subtypes I: First-order case

   Journal of Logic and Computation, Vol. 6, Núm. 3, pp. 409-438

10. Inclusions and subtypes II: Higher-order case

    Journal of Logic and Computation, Vol. 6, Núm. 4, pp. 541-572

11. New look at pattern matching in abstract data types

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

12. 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)

13. 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)

14. Rewriting Logic as a Logical and Semantic Framework This paper is a short version of [36], where the reader can find more examples and details not discussed here.

    Electronic Notes in Theoretical Computer Science, Vol. 4, Núm. C, pp. 190-225

15. Semánticas de pruebas para álgebras de procesos probabilísticos[«h»Recurso electrónico]

    Universidad Complutense de Madrid

16. Supporting object reuse through case-based reasoning

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

17. Theorem proving modulo associativity

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