 | 2012 |
| 16 |  | Jeroen Ketema:
Reinterpreting Compression in Infinitary Rewriting.
RTA 2012: 209-224 |
| 2011 |
| 15 |  | Niels Bjørn Bugge Grathwohl,
Jeroen Ketema,
Jens Duelund Pallesen,
Jakob Grue Simonsen:
Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus.
RTA 2011: 61-70 |
| 14 |  | Jeroen Ketema,
Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems.
Inf. Comput. 209(6): 893-926 (2011) |
| 13 |  | Jeroen Ketema:
Counterexamples in infinitary rewriting with non-fully-extended rules.
Inf. Process. Lett. 111(13): 642-646 (2011) |
| 2010 |
| 12 |  | Jeroen Ketema,
Jakob Grue Simonsen:
Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and lambda-Calculus.
FLOPS 2010: 272-287 |
| 11 |  | Helle Hvid Hansen,
Jeroen Ketema,
Bas Luttik,
Mohammad Reza Mousavi,
Jaco van de Pol,
Osmar Marchi dos Santos:
Automated Verification of Executable UML Models.
FMCO 2010: 225-250 |
| 10 |  | Helle Hvid Hansen,
Jeroen Ketema,
Bas Luttik,
Mohammad Reza Mousavi,
Jaco van de Pol:
Towards model checking executable UML specifications in mCRL2.
ISSE 6(1-2): 83-90 (2010) |
| 9 |  | Jeroen Ketema,
Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Logical Methods in Computer Science 6(1): (2010) |
| 2009 |
| 8 |  | Jeroen Ketema:
Comparing Böhm-Like Trees.
RTA 2009: 239-254 |
| 7 |  | Jeroen Ketema,
Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems: Confluence
Logical Methods in Computer Science 5(4): (2009) |
| 2008 |
| 6 |  | Jeroen Ketema:
On Normalisation of Infinitary Combinatory Reduction Systems.
RTA 2008: 172-186 |
| 2005 |
| 5 |  | Jeroen Ketema,
Jakob Grue Simonsen:
On Confluence of Infinitary Combinatory Reduction Systems.
LPAR 2005: 199-214 |
| 4 |  | Jeroen Ketema,
Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems.
RTA 2005: 438-452 |
| 3 |  | Jeroen Ketema:
Some Undecidable Approximations of TRSs.
Electr. Notes Theor. Comput. Sci. 124(2): 51-63 (2005) |
| 2 |  | Jeroen Ketema,
Jan Willem Klop,
Vincent van Oostrom:
Vicious Circles in Orthogonal Term Rewriting Systems.
Electr. Notes Theor. Comput. Sci. 124(2): 65-77 (2005) |
| 2004 |
| 1 |  | Jeroen Ketema:
Böhm-Like Trees for Term Rewriting Systems.
RTA 2004: 233-248 |