# Publications on Infinitary rewriting

## 2018

- Coinductive Foundations of Infinitary Rewriting and Infinitary Equational LogicJörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, and Alexandra SilvaLogical Methods in Computer Science , 14 (1) (2018)

## 2017

- Clocked Lambda CalculusJörg Endrullis, Dimitri Hendriks, Jan Willem Klop, and Andrew PolonskyMathematical Structures in Computer Science , 27 (5) , pp. 782–806 (2017)

## 2015

- A Coinductive Framework for Infinitary Rewriting and Equational ReasoningJörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, and Alexandra SilvaIn: Proc. Conf. on Rewriting Techniques and Applications (RTA 2015), pp. 143–159, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)

## 2014

- Discriminating Lambda-Terms Using Clocked Boehm TreesJörg Endrullis, Dimitri Hendriks, Jan Willem Klop, and Andrew PolonskyLogical Methods in Computer Science , 10 (2) (2014)
- Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and CounterexamplesJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, and Vincent van OostromLogical Methods in Computer Science , 10 (2:7) , pp. 1–33 (2014)

## 2013

- Clocks for Functional ProgramsJörg Endrullis, Dimitri Hendriks, Jan Willem Klop, and Andrew PolonskyIn: The Beauty of Functional Code - Essays Dedicated to Rinus Plasmeijer on the Occasion of His 61st Birthday, pp. 97–126, Springer (2013)

## 2012

- Highlights in Infinitary Rewriting and Lambda CalculusJörg Endrullis, Dimitri Hendriks, and Jan Willem KlopTheoretical Computer Science , 464 , pp. 48–71 (2012)

## 2011

- Lazy Productivity via TerminationJörg Endrullis, and Dimitri HendriksTheoretical Computer Science , 412 (28) , pp. 3203–3225 (2011)
- Proving Equality of Streams AutomaticallyHans Zantema, and Jörg EndrullisIn: Proc. Conf. on Rewriting Techniques and Applications (RTA 2011), pp. 393–408, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)
- Infinitary Rewriting CoinductivelyJörg Endrullis, and Andrew PolonskyIn: Proc. Conf. on Types for Proofs and Programs (TYPES 2012), pp. 16–27, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)

## 2010

- Productivity of Stream DefinitionsJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, and Jan Willem KlopTheoretical Computer Science , 411 (4-5) , pp. 765–782 (2010)
- Modular Construction of Fixed Point Combinators and Clocked Böhm TreesJörg Endrullis, Dimitri Hendriks, and Jan Willem KlopIn: Proc. Symp. on Logic in Computer Science (LICS 2010), pp. 111–119, IEEE Computer Society (2010)
- Unique Normal Forms in Infinitary Weakly Orthogonal RewritingJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, and Vincent van OostromIn: Proc. Conf. on Rewriting Techniques and Applications (RTA 2010), pp. 85–102, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)

## 2008

- Data-Oblivious Stream ProductivityJörg Endrullis, Clemens Grabmayer, and Dimitri HendriksIn: Proc. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2008), pp. 79–96, Springer (2008)
- Proving Infinitary NormalizationJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, and Roel C. de VrijerIn: Proc. Conf. on Types for Proofs and Programs (TYPES 2008), pp. 64–82, Springer (2008)

## 2007

- Productivity of Stream DefinitionsJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, and Jan Willem KlopIn: Proc. Symp. on Fundamentals of Computation Theory (FCT 2007), pp. 274–287, Springer (2007)
- Root Stabilisation Using Dependency PairsJörg Endrullis, and Jeroen KetemaIn: Proc. Workshop on Termination (WST 2007), pp. 17–21 (2007)