7 citations · 15 across the 11 of their papers we have counts for
11 papers
Star Games and Hydras
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
The recursive path ordering is an established and crucial tool in term rewriting to prove termination. We revisit its presentation by means of some simple rules on trees (or corres…
Decreasing Diagrams for Confluence and Commutation
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Like termination, confluence is a central property of rewrite systems. Unlike for termination, however, there exists no known complexity hierarchy for confluence. In this paper we…
Degrees of Infinite Words, Polynomials, and Atoms (Extended Version)
Jörg Endrullis, Juhani Karhumäki Jan Willem Klop, Aleksi Saarela
We study finite-state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal…
An Introduction to the Clocked Lambda Calculus
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop +1
We give a brief introduction to the clocked lambda calculus, an extension of the classical lambda calculus with a unary symbol tau used to witness the beta-steps. In contrast to th…
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples
Joerg Endrullis, Clemens Grabmayer, Dimitri Hendriks +2
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show…
Discriminating Lambda-Terms Using Clocked Boehm Trees
Joerg Endrullis, Dimitri Hendriks, Jan Willem Klop +1
As observed by Intrigila, there are hardly techniques available in the lambda-calculus to prove that two lambda-terms are not beta-convertible. Techniques employing the usual Boehm…