| Productivity of Stream Definitions J Endrullis, C Grabmayer, D Hendriks, A Isihara, JW Klop Theoretical Computer Science 411 (4), 765-782, 2010 | 80 | 2010 |
| Data-oblivious stream productivity J Endrullis, C Grabmayer, D Hendriks International Conference on Logic for Programming Artificial Intelligence …, 2008 | 56 | 2008 |
| Automated proof construction in type theory using resolution M Bezem, D Hendriks, H de Nivelle Journal of Automated Reasoning 29 (3), 253-275, 2002 | 55 | 2002 |
| Productivity of Stream Definitions J Endrullis, C Grabmayer, D Hendriks, A Isihara, JW Klop Fundamentals of Computation Theory (FCT 2007), 274-287, 2007 | 38 | 2007 |
| A coinductive framework for infinitary rewriting and equational reasoning J Endrullis, HH Hansen, D Hendriks, A Polonsky, A Silva 26th International Conference on Rewriting Techniques and Applications (RTA …, 2015 | 34 | 2015 |
| Lazy productivity via termination J Endrullis, D Hendriks Theoretical Computer Science 412 (28), 3203-3225, 2011 | 31 | 2011 |
| Adbmal D Hendriks, V van Oostrom Automated Deduction-CADE-19: 19th International Conference on Automated …, 2003 | 30 | 2003 |
| On the mechanization of the proof of Hessenberg˘s theorem in coherent logic M Bezem, D Hendriks Journal of Automated Reasoning 40 (1), 61-85, 2008 | 29 | 2008 |
| Highlights in infinitary rewriting and lambda calculus J Endrullis, D Hendriks, JW Klop Theoretical Computer Science 464, 48-71, 2012 | 27 | 2012 |
| Degrees of streams J Endrullis, D Hendriks, JW Klop Journal of Integers B 11, 1-40, 2011 | 25 | 2011 |
| Proving infinitary normalization J Endrullis, C Grabmayer, D Hendriks, JW Klop, R de Vrijer Types for Proofs and Programs, 64-82, 2009 | 25 | 2009 |
| Circular coinduction in Coq using bisimulation-up-to techniques J Endrullis, D Hendriks, M Bodin International Conference on Interactive Theorem Proving, 354-369, 2013 | 24 | 2013 |
| Complexity of Fractran and Productivity J Endrullis, C Grabmayer, D Hendriks Conference on Automated Deduction (CADE-22), 371-387, 2009 | 24 | 2009 |
| From Outermost to Context-Sensitive Rewriting J Endrullis, D Hendriks Rewriting Techniques and Applications (RTA 2009), 305-319, 2009 | 24 | 2009 |
| Automated proof construction in type theory using resolution M Bezem, D Hendriks, H De Nivelle International Conference on Automated Deduction, 148-163, 2000 | 22* | 2000 |
| Automatic sequences and zip-specifications C Grabmayer, J Endrullis, D Hendriks, JW Klop, LS Moss 2012 27th Annual IEEE Symposium on Logic in Computer Science, 335-344, 2012 | 18 | 2012 |
| A coinductive treatment of infinitary rewriting J Endrullis, HH Hansen, D Hendriks, A Polonsky, A Silva arXiv preprint arXiv:1306.6224, 2013 | 14 | 2013 |
| Proof reflection in Coq D Hendriks Journal of Automated Reasoning 29 (3-4), 277-307, 2002 | 14 | 2002 |
| Modular construction of fixed point combinators and clocked Böhm trees J Endrullis, D Hendriks, JW Klop 2010 25th Annual IEEE Symposium on Logic in Computer Science, 111-119, 2010 | 12 | 2010 |
| Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting J Endrullis, C Grabmayer, D Hendriks, JW Klop, V van Oostrom Rewriting Techniques and Applications (RTA 2010) 10, 85-102, 2010 | 11 | 2010 |
Jörg EndrullisVU University AmsterdamVerified email at endrullis.de
