Janis Voigtländer

According to our database1, Janis Voigtländer
  • authored at least 46 papers between 2002 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Formalizing semantic bidirectionalization and extensions with dependent types.
J. Log. Algebr. Meth. Program., 2017

2014
Automatic Testing of Operation Invariance.
Proceedings of the 28th Workshop on (Constraint) Logic Programming (WLP 2014) Proceedings of the 23rd International Workshop on Functional and (Constraint) Logic Programming, 2014

Parametricity and Proving Free Theorems for Functional-Logic Languages.
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

Formalizing Semantic Bidirectionalization with Dependent Types.
Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

2013
Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins.
J. Funct. Program., 2013

A Generic Scheme and Properties of Bidirectional Transformations.
CoRR, 2013

Vorwort zur 6. Arbeitstagung Programmiersprachen (ATPS 2013).
Proceedings of the Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium), Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar, 2013

6. Arbeitstagung Programmiersprachen (ATPS 2013).
Proceedings of the Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar, 2013

Understanding idiomatic traversals backwards and forwards.
Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell, 2013

2012
First International Workshop on Bidirectional Transformations (BX 2012): Preface.
ECEASST, 2012

5. Arbeitstagung Programmiersprachen (ATPS 2012).
Proceedings of the Software Engineering 2012: Fachtagung des GI-Fachbereichs Softwaretechnik, 27. Februar, 2012

Ideas for connecting inductive program synthesis and bidirectionalization.
Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, 2012

Programming language approaches to bidirectional transformation.
Proceedings of the International Workshop on Language Descriptions, 2012

2011
Improvements for Free
Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011

Refined typing to localize the impact of forced strictness on free theorems.
Acta Inf., 2011

Strictification of circular programs.
Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2011

2010
Editorial.
Higher-Order and Symbolic Computation, 2010

An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry.
Proceedings of the Functional and Constraint Logic Programming, 2010

Proving Properties about Functions on Lists Involving Element Tests.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2010

Three Complementary Approaches to Bidirectional Programming.
Proceedings of the Generic and Indexed Programming - International Spring School, 2010

Free theorems for functional logic programs.
Proceedings of the 4th ACM Workshop Programming Languages meets Program Verification, 2010

A Generic Operational Metatheory for Algebraic Effects.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Combining syntactic and semantic bidirectionalization.
Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

Automatically Generating Counterexamples to Naive Free Theorems.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
Free theorems for functional logic programs: (abstract only).
SIGPLAN Notices, 2009

A family of syntactic logical relations for the semantics of Haskell-like languages.
Inf. Comput., 2009

Parametricity for Haskell with Imprecise Error Semantics.
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

Bidirectionalization for free! (Pearl).
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

Free theorems involving type constructor classes: functional pearl.
Proceedings of the Proceeding of the 14th ACM SIGPLAN international conference on Functional programming, 2009

Taming Selective Strictness.
Proceedings of the Informatik 2009: Im Focus das Leben, 2009

2008
Much ado about two (pearl): a pearl on parallel prefix computation.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

Proving correctness via free theorems: the case of the destroy/build-rule.
Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, 2008

Asymptotic Improvement of Computations over Free Monads.
Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

Semantics and Pragmatics of New Shortcut Fusion Rules.
Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

2007
Selective strictness and parametricity in structural operational semantics, inequationally.
Theor. Comput. Sci., 2007

Formal Efficiency Analysis for Tree Transducer Composition.
Theory Comput. Syst., 2007

Deaccumulation techniques for improving provability.
J. Log. Algebr. Program., 2007

2006
The Impact of seq on Free Theorems-Based Program Transformations.
Fundam. Inform., 2006

2005
Tree transducer composition as program transformation.
PhD thesis, 2005

2004
Using Circular Programs to Deforest in Accumulating Parameters.
Higher-Order and Symbolic Computation, 2004

Composition of functions with accumulating parameters.
J. Funct. Program., 2004

Free theorems in the presence of seq.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

2003
Deaccumulation - Improving Provability.
Proceedings of the Advances in Computing Science, 2003

2002
Conditions for Efficiency Improvement by Tree Transducer Composition.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

Using circular programs to deforest in accumulating parameters.
Proceedings of the ACM SIGPLAN ASIA-PEPM 2002, 2002

Concatenate, reverse and map vanish for free.
Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), 2002


  Loading...