Search the dblp DataBase

Publications of Author

1. Marc Bezem, Dimitri Hendriks, Hans de Nivelle
   Automated Proof Construction in Type Theory Using Resolution. [Citation Graph (0, 0)][DBLP]
   CADE, 2000, pp:148-163 [Conf]
   
2. Dimitri Hendriks, Vincent van Oostrom
   adbmal [Citation Graph (0, 0)][DBLP]
   CADE, 2003, pp:136-150 [Conf]
   
3. Marc Bezem, Dimitri Hendriks, Hans de Nivelle
   Automated Proof Construction in Type Theory Using Resolution. [Citation Graph (0, 0)][DBLP]
   J. Autom. Reasoning, 2002, v:29, n:3-4, pp:253-275 [Journal]
   
4. Dimitri Hendriks
   Proof Reflection in Coq. [Citation Graph (0, 0)][DBLP]
   J. Autom. Reasoning, 2002, v:29, n:3-4, pp:277-307 [Journal]
   
5. Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
   Productivity of Stream Definitions. [Citation Graph (0, 0)][DBLP]
   FCT, 2007, pp:274-287 [Conf]
   
6. 
   Complexity of Fractran and Productivity. [Citation Graph (, )][DBLP]
   
   
7. 
   Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. [Citation Graph (, )][DBLP]
   
   
8. 
   Data-Oblivious Stream Productivity. [Citation Graph (, )][DBLP]
   
   
9. 
   From Outermost to Context-Sensitive Rewriting. [Citation Graph (, )][DBLP]
   
   
10. 
    Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. [Citation Graph (, )][DBLP]
    
    
11. 
    Proving Infinitary Normalization. [Citation Graph (, )][DBLP]
    
    
12. 
    Data-Oblivious Stream Productivity [Citation Graph (, )][DBLP]
    
    
13. 
    Complexity of Fractran and Productivity [Citation Graph (, )][DBLP]
    
    
14. 
    Let's Make a Difference! [Citation Graph (, )][DBLP]
    
    
15. 
    Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting [Citation Graph (, )][DBLP]
    
    
16. 
    Modular Construction of Fixed Point Combinators and Clocked Boehm Trees [Citation Graph (, )][DBLP]
    
    
17. 
    Transforming Outermost into Context-Sensitive Rewriting [Citation Graph (, )][DBLP]