#### Filter Results:

- Full text PDF available (49)

#### Publication Year

2006

2017

- This year (3)
- Last 5 years (30)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jörg Endrullis, Johannes Waldmann, Hans Zantema
- Journal of Automated Reasoning
- 2006

We present a new method for automatically proving termination of term rewriting. It is based on the well-known idea of interpretation of terms where every rewrite step causes a decrease, but instead of the usual natural numbers we use vectors of natural numbers, ordered by a particular nontotal well-founded ordering. Function symbols are interpreted by… (More)

We give an algorithm for deciding productivity of a large and natural class of recursive stream definitions. A stream definition is called ‘productive’ if it can be evaluated continually in such a way that a uniquely determined stream in constructor normal form is obtained as the limit. Whereas productivity is undecidable for stream definitions in general,… (More)

- Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
- LPAR
- 2008

We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidable, but for restricted formats computable sufficient conditions can be obtained. The usual analysis, also adopted here, disregards the identity of data, thus leading to approaches that we… (More)

- Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
- CADE
- 2009

In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarantee that every finite part of the result can be evaluated in finitely many steps. This is known as productivity. For programming with infinite structures, productivity is what termination in… (More)

- Jörg Endrullis, Andrew Polonsky
- TYPES
- 2011

We provide a coinductive definition of strongly convergent reductions between infinite lambda terms. This approach avoids the notions of ordinals and metric convergence which have appeared in the earlier definitions of the concept. As an illustration, we prove the existence part of the infinitary standardization theorem. The proof is fully formalized in Coq… (More)

- Jörg Endrullis, Dimitri Hendriks
- Theor. Comput. Sci.
- 2011

We present a procedure for transforming strongly sequential constructor-based term rewriting systems (TRSs) into context-sensitive TRSs in such a way that productivity of the input system is equivalent to termination of the output system. Thereby automated termination provers become available for proving productivity. A TRS is called productive if all its… (More)

We introduce a novel approach to comparing the complexity of streams, namely in terms of reducibility by finite state transducers. This gives rise to a hierarchy of stream ‘degrees,’ somewhat analogous to the recursion-theoretic degrees of unsolvability. It is the structure and properties of this partial order of degrees that we are primarily interested in.… (More)

- Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom
- Theor. Comput. Sci.
- 2011

We consider the rewrite system Rμ with μx.M →μ M[x := μx.M] as its single rewrite rule, where the signature consists of the variable binding operator commonly denoted by μ, first-order symbols, which in this paper are restricted to a binary function symbol F, and possibly some constant symbols. This kernel system denoting recursively defined objects occurs… (More)

We investigate an abstraction method, called meanfield method, for the performance evaluation of dynamic networks with pairwise communication between nodes. It allows us to evaluate systems with very large numbers of nodes, that is, systems of a size where traditional performance evaluation methods fall short. While the mean-field analysis is… (More)

- Jörg Endrullis, Dimitri Hendriks
- RTA
- 2009

We define a transformation from term rewriting systems (TRSs) to context-sensitive TRSs in such a way that termination of the target system implies outermost termination of the original system. For the class of left-linear TRSs the transformation is complete. Thereby state-of-the-art termination methods and automated termination provers for… (More)