Sistemas Informáticos y Computación

1999

1. A design strategy for low cost experimental telerobotics platforms

   Robot and Human Communication - Proceedings of the IEEE International Workshop

2. A fully syntactic AC-RPO

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

3. A functional-logic perspective of parsing

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

4. A partial evaluation framework for curry programs

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

5. An axiomatization of probabilistic testing

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

6. Approach to declarative programming based on a rewriting logic

   Journal of Logic Programming, Vol. 40, Núm. 1, pp. 47-87

7. Calculating encoding and decoding functions for prefix codes

   SIGPLAN Notices (ACM Special Interest Group on Programming Languages), Vol. 34, Núm. 4, pp. 54-60

8. Denotational semantics for probabilistic refusal testing

   Electronic Notes in Theoretical Computer Science

9. Functional plus logic programming with built-in and symbolic constraints

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

10. Higher-order recursive path ordering

    Proceedings - Symposium on Logic in Computer Science, pp. 402-411

11. Implementing Eden - Or: Dreams become reality?

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

12. On non-decidability of reachability for timed-arc Petri nets

    Proceedings - 8th International Workshop on Petri Nets and Performance Models, PNPM 1999

13. Paramodulation with non-monotonic orderings

    Proceedings - Symposium on Logic in Computer Science

14. Relating may and must testing semantics for discrete timed process algebras

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

15. TOY: A multiparadigm declarative system

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

16. The maude system

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

17. Using reflection to specify transaction sequences in rewriting logic

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