| Productivity of Stream Definitions J Endrullis, C Grabmayer, D Hendriks, A Isihara, JW Klop Theoretical Computer Science 411 (4), 765-782, 2010 | 82 | 2010 |
| Data-oblivious stream productivity J Endrullis, C Grabmayer, D Hendriks Logic for Programming, Artificial Intelligence, and Reasoning: 15th …, 2008 | 59 | 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 | 41 | 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 | 36 | 2015 |
| Adbmal D Hendriks, V van Oostrom Automated Deduction-CADE-19: 19th International Conference on Automated …, 2003 | 35 | 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 | 32 | 2008 |
| Lazy productivity via termination J Endrullis, D Hendriks Theoretical Computer Science 412 (28), 3203-3225, 2011 | 31 | 2011 |
| Degrees of streams J Endrullis, D Hendriks, JW Klop Journal of Integers B 11, 1-40, 2011 | 30 | 2011 |
| Highlights in infinitary rewriting and lambda calculus J Endrullis, D Hendriks, JW Klop Theoretical Computer Science 464, 48-71, 2012 | 29 | 2012 |
| Proving infinitary normalization J Endrullis, C Grabmayer, D Hendriks, JW Klop, R de Vrijer Types for Proofs and Programs, 64-82, 2009 | 26 | 2009 |
| Complexity of Fractran and Productivity J Endrullis, C Grabmayer, D Hendriks Conference on Automated Deduction (CADE-22), 371-387, 2009 | 26 | 2009 |
| Automated proof construction in type theory using resolution M Bezem, D Hendriks, H de Nivelle Automated Deduction-CADE-17: 17th International Conference on Automated …, 2000 | 26* | 2000 |
| Circular coinduction in Coq using bisimulation-up-to techniques J Endrullis, D Hendriks, M Bodin Interactive Theorem Proving: 4th International Conference, ITP 2013, Rennes …, 2013 | 25 | 2013 |
| From Outermost to Context-Sensitive Rewriting J Endrullis, D Hendriks Rewriting Techniques and Applications (RTA 2009), 305-319, 2009 | 24 | 2009 |
| 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 | 19 | 2012 |
| The degree of squares is an atom J Endrullis, C Grabmayer, D Hendriks, H Zantema Combinatorics on Words: 10th International Conference, WORDS 2015, Kiel …, 2015 | 15 | 2015 |
| A coinductive treatment of infinitary rewriting J Endrullis, HH Hansen, D Hendriks, A Polonsky, A Silva arXiv preprint arXiv:1306.6224, 2013 | 15 | 2013 |
| Proof reflection in Coq D Hendriks Journal of Automated Reasoning 29 (3-4), 277-307, 2002 | 15 | 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 | 13 | 2010 |
Jörg EndrullisVU University AmsterdamAdresse e-mail validée de endrullis.de
