Recherche
-
Decidable Call by Need Computations in Term Rewriting
Communication dans un congrès -
Constructor Equivalent Term Rewriting Systems are Strongly Sequential: a direct proof
(Information Processing Letters. vol. 52, pp. 137--145, 1994)Article de revue -
Bounded, Strongly Sequential and Forward-branching Term Rewriting Systems
(Journal of Symbolic Computation. vol. 18, pp. 319--352, 1994)Article de revue