|
Search the dblp DataBase
Janis Voigtländer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jürgen Giesl, Armin Kühnemann, Janis Voigtländer
Deaccumulation - Improving Provability. [Citation Graph (0, 0)][DBLP] ASIAN, 2003, pp:146-160 [Conf]
- Janis Voigtländer
Concatenate, reverse and map vanish for free. [Citation Graph (0, 0)][DBLP] ICFP, 2002, pp:14-25 [Conf]
- Janis Voigtländer
Using circular programs to deforest in accumulating parameters. [Citation Graph (0, 0)][DBLP] ASIA-PEPM, 2002, pp:126-137 [Conf]
- Patricia Johann, Janis Voigtländer
Free theorems in the presence of seq. [Citation Graph (0, 0)][DBLP] POPL, 2004, pp:99-110 [Conf]
- Janis Voigtländer
Conditions for Efficiency Improvement by Tree Transducer Composition. [Citation Graph (0, 0)][DBLP] RTA, 2002, pp:222-236 [Conf]
- 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]
- 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]
- 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]
- 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]
Semantics and Pragmatics of New Shortcut Fusion Rules. [Citation Graph (, )][DBLP]
Automatically Generating Counterexamples to Naive Free Theorems. [Citation Graph (, )][DBLP]
Taming Selective Strictness. [Citation Graph (, )][DBLP]
Free theorems involving type constructor classes: functional pearl. [Citation Graph (, )][DBLP]
A Generic Operational Metatheory for Algebraic Effects. [Citation Graph (, )][DBLP]
Asymptotic Improvement of Computations over Free Monads. [Citation Graph (, )][DBLP]
Proving correctness via free theorems: the case of the destroy/build-rule. [Citation Graph (, )][DBLP]
Much ado about two (pearl): a pearl on parallel prefix computation. [Citation Graph (, )][DBLP]
Bidirectionalization for free! (Pearl). [Citation Graph (, )][DBLP]
Parametricity for Haskell with Imprecise Error Semantics. [Citation Graph (, )][DBLP]
Free theorems for functional logic programs. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|