| 3 |
A tool for reasoning about qualitative temporal information: the theory of S-languages with a Lisp implementation
|
|
|
|
In: ISSN: 0948-695X ; EISSN: 0948-6968 ; Journal of Universal Computer Science ; https://hal.archives-ouvertes.fr/hal-00350036 ; Journal of Universal Computer Science, Graz University of Technology, Institut für Informationssysteme und Computer Medien, 2008, 14 (20), pp.3282-3306 (2008)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
A Case Study of the Convergence of Mildly Context-Sensitive Formalisms for Natural Language Syntax: from Minimalist Grammars to Multiple Context-Free Grammars
|
|
|
|
In: https://hal.inria.fr/inria-00117306 ; [Research Report] RR-6042, INRIA. 2006, pp.67 (2006)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
Decidable Call-by-Need Computations in Term Rewriting
|
|
|
|
In: ISSN: 0890-5401 ; EISSN: 1090-2651 ; Information and Computation ; https://hal.archives-ouvertes.fr/hal-00338565 ; Information and Computation, Elsevier, 2005, 2 (196), pp.95-126 (2005)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
Architecture de l'ordinateur
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-00338556 ; Dunod, pp.224, 2005, Sciences sup (2005)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Autowrite: A Tool for Term Rewrite Systems and Tree Automata
|
|
|
|
In: Proceedings of the Workshop on Rewriting Strategies ; Workshop on Rewriting Strategies ; https://hal.archives-ouvertes.fr/hal-00344274 ; Workshop on Rewriting Strategies, 2004, Aachen, Germany. pp.5--14 (2004)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Autowrite: A Tool for Checking Properties of Term Rewriting Systems
|
|
|
|
In: Proceedings of the 13th International Conference on Rewriting Systems ; 13th International Conference on Rewriting Techniques and Applications ; https://hal.archives-ouvertes.fr/hal-00344294 ; 13th International Conference on Rewriting Techniques and Applications, 2002, Denmark. pp.371--375 (2002)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
On the Modularity of Deciding Call-by-Need
|
|
|
|
In: Foundations of Software Science and Computation Structures ; https://hal.archives-ouvertes.fr/hal-00344304 ; Foundations of Software Science and Computation Structures, 2001, Italy. pp.199-213 (2001)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
Decidable Call by Need Computations in Term Rewriting
|
|
|
|
In: Proceedings of the 14th International Conference on Automated Deduction ; 14th International Conference on Automated Deduction ; https://hal.archives-ouvertes.fr/hal-00344328 ; 14th International Conference on Automated Deduction, 1997, Australia. pp.4--18 (1997)
|
|
BASE
|
|
Show details
|
|
|
| 11 |
Bounded, Strongly Sequential and Forward-branching Term Rewriting Systems
|
|
|
|
In: ISSN: 0747-7171 ; EISSN: 1095-855X ; Journal of Symbolic Computation ; https://hal.archives-ouvertes.fr/hal-00344335 ; Journal of Symbolic Computation, Elsevier, 1994, 18, pp.319--352 (1994)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Constructor Equivalent Term Rewriting Systems are Strongly Sequential: a direct proof
|
|
|
|
In: ISSN: 0020-0190 ; Information Processing Letters ; https://hal.archives-ouvertes.fr/hal-00344330 ; Information Processing Letters, Elsevier, 1994, 52, pp.137--145 (1994)
|
|
BASE
|
|
Show details
|
|
|
| 13 |
Constructor Equivalent Term Rewriting Systems
|
|
|
|
In: ISSN: 0020-0190 ; Information Processing Letters ; https://hal.archives-ouvertes.fr/hal-00344333 ; Information Processing Letters, Elsevier, 1993, 47, pp.131--137 (1993)
|
|
BASE
|
|
Show details
|
|
|
|
|
