2018

  1. Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems
    Jörg Endrullis, Jan Willem Klop, and Roy Overbeek
    In: Proc. Conf. on Formal Structures for Computation and Deduction (FSCD 2018), pp. 14:1–14:15, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)
  2. Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic
    Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, and Alexandra Silva
    Logical Methods in Computer Science , 14 (1) (2018)

2017

  1. Clocked Lambda Calculus
    Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, and Andrew Polonsky
    Mathematical Structures in Computer Science , 27 (5) , pp. 782–806 (2017)

2015

  1. Proving Non-Termination by Finite Automata
    Jörg Endrullis, and Hans Zantema
    In: Proc. Conf. on Rewriting Techniques and Applications (RTA 2015), pp. 160–176, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)
  2. A Coinductive Framework for Infinitary Rewriting and Equational Reasoning
    Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, and Alexandra Silva
    In: Proc. Conf. on Rewriting Techniques and Applications (RTA 2015), pp. 143–159, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)

2014

  1. Discriminating Lambda-Terms Using Clocked Boehm Trees
    Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, and Andrew Polonsky
    Logical Methods in Computer Science , 10 (2) (2014)
  2. Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples
    Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, and Vincent van Oostrom
    Logical Methods in Computer Science , 10 (2:7) , pp. 1–33 (2014)
    bib
  3. On the Complexity of Stream Equality
    Jörg Endrullis, Dimitri Hendriks, Rena Bakhshi, and Grigore Rosu
    Journal of Functional Programming , 24 (2-3) , pp. 166–217 (2014)

2013

  1. De Bruijn’s Weak Diamond Property Revisited
    Jörg Endrullis, and Jan Willem Klop
    Indagationes Mathematicae , 24 (4) , pp. 1050–1072 (2013)
    bib
  2. SAT Compilation for Termination Proofs via Semantic Labelling
    Alexander Bau, Jörg Endrullis, and Johannes Waldmann
    In: Proc. Workshop on Termination (WST 2007) (2013)
    bib
  3. Clocks for Functional Programs
    Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, and Andrew Polonsky
    In: The Beauty of Functional Code - Essays Dedicated to Rinus Plasmeijer on the Occasion of His 61st Birthday, pp. 97–126, Springer (2013)
  4. Circular Coinduction in Coq Using Bisimulation-Up-To Techniques
    Jörg Endrullis, Dimitri Hendriks, and Martin Bodin
    In: Proc. Conf. on Interactive Theorem Proving (ITP 2013), pp. 354–369, Springer (2013)

2012

  1. Automatic Sequences and Zip-Specifications
    Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, and Lawrence S. Moss
    In: Proc. Symp. on Logic in Computer Science (LICS 2012), pp. 335–344, IEEE Computer Society (2012)
  2. Highlights in Infinitary Rewriting and Lambda Calculus
    Jörg Endrullis, Dimitri Hendriks, and Jan Willem Klop
    Theoretical Computer Science , 464 , pp. 48–71 (2012)
  3. On the Complexity of Equivalence of Specifications of Infinite Objects
    Jörg Endrullis, Dimitri Hendriks, and Rena Bakhshi
    In: Proc. Int. Conf. on Functional Programming (ICFP 2012), pp. 153–164, ACM (2012)

2011

  1. On Equal μ-Terms
    Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, and Vincent van Oostrom
    Theoretical Computer Science , 412 (28) , pp. 3175–3202 (2011)
  2. Lazy Productivity via Termination
    Jörg Endrullis, and Dimitri Hendriks
    Theoretical Computer Science , 412 (28) , pp. 3203–3225 (2011)
  3. Proving Equality of Streams Automatically
    Hans Zantema, and Jörg Endrullis
    In: Proc. Conf. on Rewriting Techniques and Applications (RTA 2011), pp. 393–408, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)
  4. Infinitary Rewriting Coinductively
    Jörg Endrullis, and Andrew Polonsky
    In: Proc. Conf. on Types for Proofs and Programs (TYPES 2012), pp. 16–27, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)
  5. Levels of Undecidability in Rewriting
    Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, and Hans Zantema
    Information and Computation , 209 (2) , pp. 227–245 (2011)

2010

  1. Productivity of Stream Definitions
    Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, and Jan Willem Klop
    Theoretical Computer Science , 411 (4-5) , pp. 765–782 (2010)
  2. Local Termination: Theory and Practice
    Jörg Endrullis, Roel C. de Vrijer, and Johannes Waldmann
    Logical Methods in Computer Science , 6 (3) (2010)
    bib
  3. Transforming Outermost into Context-Sensitive Rewriting
    Jörg Endrullis, and Dimitri Hendriks
    Logical Methods in Computer Science , 6 (2) (2010)
    bib
  4. Modular Construction of Fixed Point Combinators and Clocked Böhm Trees
    Jörg Endrullis, Dimitri Hendriks, and Jan Willem Klop
    In: Proc. Symp. on Logic in Computer Science (LICS 2010), pp. 111–119, IEEE Computer Society (2010)
  5. Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting
    Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, and Vincent van Oostrom
    In: Proc. Conf. on Rewriting Techniques and Applications (RTA 2010), pp. 85–102, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)

2009

  1. From Outermost to Context-Sensitive Rewriting
    Jörg Endrullis, and Dimitri Hendriks
    In: Proc. Conf. on Rewriting Techniques and Applications (RTA 2009), pp. 305–319, Springer (2009)
  2. Local Termination
    Jörg Endrullis, Roel C. de Vrijer, and Johannes Waldmann
    In: Proc. Conf. on Rewriting Techniques and Applications (RTA 2009), pp. 270–284, Springer (2009)
  3. Complexity of Fractran and Productivity
    Jörg Endrullis, Clemens Grabmayer, and Dimitri Hendriks
    In: Proc. Conf. on Automated Deduction (CADE 2009), pp. 371–387, Springer (2009)
  4. Degrees of Undecidability in Term Rewriting
    Jörg Endrullis, Herman Geuvers, and Hans Zantema
    In: Proc. Conf. on Computer Science Logic (CSL 2009), pp. 255–270, Springer (2009)

2008

  1. Data-Oblivious Stream Productivity
    Jörg Endrullis, Clemens Grabmayer, and Dimitri Hendriks
    In: Proc. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2008), pp. 79–96, Springer (2008)
  2. Matrix Interpretations for Proving Termination of Term Rewriting
    Jörg Endrullis, Johannes Waldmann, and Hans Zantema
    Journal of Automated Reasoning , 40 (2-3) , pp. 195–220 (2008)
  3. Reduction under Substitution
    Jörg Endrullis, and Roel C. de Vrijer
    In: Proc. Conf. on Rewriting Techniques and Applications (RTA 2008), pp. 425–440, Springer (2008)
  4. Proving Infinitary Normalization
    Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, and Roel C. de Vrijer
    In: Proc. Conf. on Types for Proofs and Programs (TYPES 2008), pp. 64–82, Springer (2008)

2007

  1. Productivity of Stream Definitions
    Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, and Jan Willem Klop
    In: Proc. Symp. on Fundamentals of Computation Theory (FCT 2007), pp. 274–287, Springer (2007)
  2. Root Stabilisation Using Dependency Pairs
    Jörg Endrullis, and Jeroen Ketema
    In: Proc. Workshop on Termination (WST 2007), pp. 17–21 (2007)
    bib

2006

  1. Matrix Interpretations for Proving Termination of Term Rewriting
    Jörg Endrullis, Johannes Waldmann, and Hans Zantema
    In: Proc. Int. Joint Conf. on Automated Reasoning (IJCAR 2006), pp. 574–588, Springer (2006)
  2. Decomposing Terminating Rewrite Relations
    JöEndrullis, Dieter Hofbauer, and Johannes Waldmann
    In: Proc. Workshop on Termination (WST 2006), pp. 39–43 (2006)
    bib