Search the dblp DataBase

Publications of Author

1. Jürgen Giesl, Armin Kühnemann, Janis Voigtländer
   Deaccumulation - Improving Provability. [Citation Graph (0, 0)][DBLP]
   ASIAN, 2003, pp:146-160 [Conf]
   
2. Janis Voigtländer
   Concatenate, reverse and map vanish for free. [Citation Graph (0, 0)][DBLP]
   ICFP, 2002, pp:14-25 [Conf]
   
3. Janis Voigtländer
   Using circular programs to deforest in accumulating parameters. [Citation Graph (0, 0)][DBLP]
   ASIA-PEPM, 2002, pp:126-137 [Conf]
   
4. Patricia Johann, Janis Voigtländer
   Free theorems in the presence of seq. [Citation Graph (0, 0)][DBLP]
   POPL, 2004, pp:99-110 [Conf]
   
5. Janis Voigtländer
   Conditions for Efficiency Improvement by Tree Transducer Composition. [Citation Graph (0, 0)][DBLP]
   RTA, 2002, pp:222-236 [Conf]
   
6. Patricia Johann, Janis Voigtländer
   The Impact of seq on Free Theorems-Based Program Transformations. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 2006, v:69, n:1-2, pp:63-102 [Journal]
   
7. Janis Voigtländer, Armin Kühnemann
   Composition of functions with accumulating parameters. [Citation Graph (0, 0)][DBLP]
   J. Funct. Program., 2004, v:14, n:3, pp:317-363 [Journal]
   
8. Janis Voigtländer
   Using Circular Programs to Deforest in Accumulating Parameters. [Citation Graph (0, 0)][DBLP]
   Higher-Order and Symbolic Computation, 2004, v:17, n:1-2, pp:129-163 [Journal]
   
9. Jürgen Giesl, Armin Kühnemann, Janis Voigtländer
   Deaccumulation techniques for improving provability. [Citation Graph (0, 0)][DBLP]
   J. Log. Algebr. Program., 2007, v:71, n:2, pp:79-113 [Journal]
   
10. 
    Semantics and Pragmatics of New Shortcut Fusion Rules. [Citation Graph (, )][DBLP]
    
    
11. 
    Automatically Generating Counterexamples to Naive Free Theorems. [Citation Graph (, )][DBLP]
    
    
12. 
    Taming Selective Strictness. [Citation Graph (, )][DBLP]
    
    
13. 
    Free theorems involving type constructor classes: functional pearl. [Citation Graph (, )][DBLP]
    
    
14. 
    A Generic Operational Metatheory for Algebraic Effects. [Citation Graph (, )][DBLP]
    
    
15. 
    Asymptotic Improvement of Computations over Free Monads. [Citation Graph (, )][DBLP]
    
    
16. 
    Proving correctness via free theorems: the case of the destroy/build-rule. [Citation Graph (, )][DBLP]
    
    
17. 
    Much ado about two (pearl): a pearl on parallel prefix computation. [Citation Graph (, )][DBLP]
    
    
18. 
    Bidirectionalization for free! (Pearl). [Citation Graph (, )][DBLP]
    
    
19. 
    Parametricity for Haskell with Imprecise Error Semantics. [Citation Graph (, )][DBLP]
    
    
20. 
    Free theorems for functional logic programs. [Citation Graph (, )][DBLP]