Jun.-Prof. Dr. rer. nat. habil. Janis Voigtländer

(Juniorprofessor - Programmiersprachen / Programming Languages / Програмни Езици)

	Address:	University of Bonn Institute of Computer Science Department III Römerstraße 164 D - 53117 Bonn Germany
	Room:	A 224
	Phone:	+49 228 73 4535
	Fax:	+49 228 73 4382 (please include a cover page)
	E-mail:

Resume

News:

• A joint grant application with Portuguese partners Joao Saraiva and Joao Paulo Fernandes, both at the University of Minho, was approved by the DAAD.
• I am invited speaker at PPL'10 (Japanese Conference on Programming and Programming Languages, March 3-5, 2010).
• I will also speak at Bi-Trans in ABC.
• I serve on the program committee for IFL'10.
• Ich organisiere den Bonner Hochschultag der Informatik 2010.
• Type Theory Comes of Age!

Teaching (in German):

Im Sommersemester 2010 halte ich die Vorlesung Deskriptive Programmierung.

Research:

Grants:

• A joint grant application with Portuguese partners Joao Saraiva and Joao Paulo Fernandes, both at the University of Minho, was approved by the DAAD.
• I have been awarded a Short-Term JSPS Postdoctoral Fellowship (sponsoring a visit to the group of Zhenjiang Hu for one month in Winter/Spring 2010).
• I hold a SICSA Distinguished Visiting Fellowship (sponsoring visits to the group Mathematically Structured Programming at University of Strathclyde, Glasgow, and the Laboratory for Foundations of Computer Science at University of Edinburgh).
• I lead a DFG-funded project (sponsoring a full research position for 36 months, currently held by my PhD student Daniel Seidel, at 75%).

Activities:

Since 2008, I serve as editor of the Haskell Communities and Activities Report (appearing twice a year).

In March 2009, I served on the PhD committee of Joao Paulo Fernandes at University of Minho, Portugal.

Go to Talk Slides

Publications: (@dblp, @citeulike, @acm, @researchr)

Edited (1):

• J. Gallagher and J. Voigtländer
  Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM'10, Madrid, Spain, © ACM Press, January 2010.

Journals (7, sorted by recency):

• P. Johann and J. Voigtländer
  A family of syntactic logical relations for the semantics of Haskell-like languages (bib+abstract)
  Information and Computation, volume 207(2), pages 341-368, Elsevier, 2009.
  The definitive version of this work is available from http://dx.doi.org/10.1016/j.ic.2007.11.009.
• J. Voigtländer and P. Johann
  Selective strictness and parametricity in structural operational semantics, inequationally (bib+abstract)
  Theoretical Computer Science, volume 388(1-3), pages 290-318, Elsevier, 2007.
  The definitive version of this work is available from http://dx.doi.org/10.1016/j.tcs.2007.09.014.
• J. Voigtländer
  Formal Efficiency Analysis for Tree Transducer Composition (bib+abstract)
  Theory of Computing Systems, volume 41(4), pages 619-689, Springer-Verlag, 2007.
  The original publication is available from http://dx.doi.org/10.1007/s00224-006-1235-9.
• J. Giesl, A. Kühnemann, and J. Voigtländer
  Deaccumulation techniques for improving provability (bib+abstract)
  Journal of Logic and Algebraic Programming, volume 71(2), pages 79-113, Elsevier, 2007.
  The definitive version of this work is available from http://dx.doi.org/10.1016/j.jlap.2006.11.001.
• P. Johann and J. Voigtländer
  The Impact of seq on Free Theorems-Based Program Transformations (bib+abstract)
  Fundamenta Informaticae, volume 69(1-2), pages 63-102, IOS Press, 2006.
• J. Voigtländer
  Using Circular Programs to Deforest in Accumulating Parameters (bib+abstract)
  Higher-Order and Symbolic Computation, volume 17(1-2), pages 129-163, © Kluwer Academic Publishers, 2004.
  The definitive version of this work is available from http://dx.doi.org/10.1023/B:LISP.0000029450.36668.cb.
• J. Voigtländer and A. Kühnemann
  Composition of functions with accumulating parameters (bib+abstract, proof appendix)
  Journal of Functional Programming, volume 14(3), pages 317-363, © Cambridge University Press, 2004.

Conferences (15, sorted by acceptance rate):

P. Johann and J. Voigtländer Free Theorems in the Presence of seq (bib+abstract) In 31st Symposium on Principles of Programming Languages (POPL'04, acceptance rate 29/176), Venice, Italy, Proceedings, volume 39(1) of SIGPLAN Notices, pages 99-110, © ACM Press, January 2004. This (authors') version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/982962.964010). An extended version of this work appeared in Fundamenta Informaticae, see above.

J. Voigtländer Much Ado about Two: A Pearl on Parallel Prefix Computation (bib+abstract) In 35th Symposium on Principles of Programming Languages (POPL'08, acceptance rate 35/212), San Francisco, California, Proceedings, volume 43(1) of SIGPLAN Notices, pages 29-35, © ACM Press, January 2008. This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/1328897.1328445).

J. Voigtländer Bidirectionalization for Free! (bib+abstract) In 36th Symposium on Principles of Programming Languages (POPL'09, acceptance rate 36/160), Savannah, Georgia, Proceedings, volume 44(1) of SIGPLAN Notices, pages 165-176, © ACM Press, January 2009. This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/1480881.1480904).

J. Voigtländer Proving Correctness via Free Theorems: The Case of the destroy/build-Rule (bib+abstract) In Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'08, acceptance rate 20/74), San Francisco, California, Proceedings, pages 13-20, © ACM Press, January 2008. This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/1328408.1328412).

J. Giesl, A. Kühnemann, and J. Voigtländer Deaccumulation - Improving Provability (bib+abstract) In 8th Asian Computing Science Conference (ASIAN'03, acceptance rate 16/53), Mumbai, India, Proceedings, volume 2896 of LNCS, pages 146-160, © Springer-Verlag, December 2003. An extended version of this work appeared in Journal of Logic and Algebraic Programming, see above.

J. Voigtländer Concatenate, Reverse and Map Vanish For Free (bib+abstract) In 7th International Conference on Functional Programming (ICFP'02, acceptance rate 24/76), Pittsburgh, Pennsylvania, Proceedings, volume 37(9) of SIGPLAN Notices, pages 14-25, © ACM Press, October 2002. This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/583852.581481).

J. Voigtländer Free Theorems Involving Type Constructor Classes (bib+abstract) In 14th International Conference on Functional Programming (ICFP'09, acceptance rate 32/101), Edinburgh, Scotland, Proceedings, volume 44(9) of SIGPLAN Notices, pages 173-184, © ACM Press, September 2009. This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/1596550.1596577). A video of the conference presentation is available here.

J. Voigtländer Semantics and Pragmatics of New Shortcut Fusion Rules (bib+abstract) In 9th International Symposium on Functional and Logic Programming (FLOPS'08, acceptance rate 20/59), Ise, Japan, Proceedings, volume 4989 of LNCS, pages 163-179, © Springer-Verlag, April 2008.

D. Seidel and J. Voigtländer Automatically Generating Counterexamples to Naive Free Theorems In 10th International Symposium on Functional and Logic Programming (FLOPS'10, acceptance rate 21/49), Sendai, Japan, Proceedings, volume 6009 of LNCS, © Springer-Verlag, April 2010.

J. Voigtländer Asymptotic Improvement of Computations over Free Monads (bib+abstract) In 9th International Conference on Mathematics of Program Construction (MPC'08, acceptance rate 18/41), Marseille, France, Proceedings, volume 5133 of LNCS, pages 388-403, © Springer-Verlag, July 2008.

J. Voigtländer Conditions for Efficiency Improvement by Tree Transducer Composition (bib+abstract) In 13th International Conference on Rewriting Techniques and Applications (RTA'02, acceptance rate 20/40), Copenhagen, Denmark, Proceedings, volume 2378 of LNCS, pages 222-236, © Springer-Verlag, July 2002.

F. Stenger and J. Voigtländer Parametricity for Haskell with Imprecise Error Semantics (bib+abstract) In 9th International Conference on Typed Lambda Calculi and Applications (TLCA'09, acceptance rate 27/53), Brasília, Brazil, Proceedings, volume 5608 of LNCS, pages 294-308, © Springer-Verlag, July 2009.

J. Voigtländer Using Circular Programs to Deforest in Accumulating Parameters (bib+abstract) In Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (ASIA-PEPM'02, acceptance rate 11/21), Aizu, Japan, Proceedings, pages 126-137, © ACM Press, September 2002. This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/568173.568187). An extended version of this work appeared in Higher-Order and Symbolic Computation, see above.

J. Christiansen, D. Seidel, and J. Voigtländer Free Theorems for Functional Logic Programs (bib+abstract) In 4th Workshop on Programming Languages meets Program Verification (PLPV'10, acceptance rate 7/10), Madrid, Spain, Proceedings, pages 39-48, © ACM Press, January 2010. This (authors') version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/1707790.1707797).

D. Seidel and J. Voigtländer Taming Selective Strictness (bib+abstract) In 4. Arbeitstagung Programmiersprachen (ATPS'09, acceptance rate 8/11) der GI-Fachgruppe "Programmiersprachen und Rechenkonzepte" im Rahmen der GI-Jahrestagung Informatik 2009, Lübeck, Germany, Proceedings, volume 154 of Lecture Notes in Informatics, pages 2916-2930, GI, October 2009.

Theses:

• J. Voigtländer
  Types for Programming and Reasoning
  Habilitation thesis, Technische Universität Dresden, defended in July 2009.
• J. Voigtländer
  Tree Transducer Composition as Program Transformation (bib+abstract)
  PhD thesis, Technische Universität Dresden, defended in January 2005.
  This thesis is also available as a book.
• J. Voigtländer
  Composition of restricted Macro Tree Transducers (bib+abstract)
  Master thesis, Technische Universität Dresden, defended in April 2001.
  An article based on this thesis appeared in Journal of Functional Programming, see above.

Technical Reports:

• D. Seidel and J. Voigtländer
  Taming Selective Strictness
  Technical Report TUD-FI09-06, Technische Universität Dresden, June 2009.
• F. Stenger and J. Voigtländer
  Parametricity for Haskell with Imprecise Error Semantics (bib+abstract)
  Technical Report TUD-FI08-08, Technische Universität Dresden, November 2008.
• J. Voigtländer and P. Johann
  Selective Strictness and Parametricity in Structural Operational Semantics (bib+abstract)
  Technical Report TUD-FI06-02, Technische Universität Dresden, June 2006.
  A revised version of this work appeared in Theoretical Computer Science, see above.
• J. Giesl, A. Kühnemann, and J. Voigtländer
  Deaccumulation Techniques for Improving Provability (bib+abstract)
  Technical Report TUD-FI05-14, Technische Universität Dresden, December 2005.
  A slightly revised version of this work appeared in Journal of Logic and Algebraic Programming, see above.
• J. Voigtländer
  Formal Efficiency Analysis for Tree Transducer Composition (bib+abstract)
  Technical Report TUD-FI04-08, Technische Universität Dresden, June 2004.
  An abridged and revised version of this work appeared in Theory of Computing Systems, see above.
• J. Voigtländer and A. Kühnemann
  Composition of Functions with Accumulating Parameters (bib+abstract)
  Technical Report TUD-FI01-08, Technische Universität Dresden, August 2001.
  A much revised version of this work appeared in Journal of Functional Programming, see above.
• A. Kühnemann and J. Voigtländer
  Tree Transducer Composition as Deforestation Method for Functional Programs (bib+abstract)
  Technical Report TUD-FI01-07, Technische Universität Dresden, August 2001.

Slides of some Talks:

• Free Theorems Involving Type Constructor Classes
  at ICFP'09, Edinburgh, September 1, 2009.
  A video of this talk is available here.
• News About a Recent Application of Parametricity
  at ISS-AiPL'09, Edinburgh, August 25, 2009.
• Typbasierte Programmtransformation (in German)
  at my Habilitation defense, July 14, 2009.
• Parametricity for Haskell with Imprecise Error Semantics
  at TLCA'09, Brasilia, July 2, 2009.
  (similarly held earlier at NWPT'08, Tallinn, November 19, 2008)
• Short Course "Free Theorems and Applications" at University of Edinburgh, April 22-24, 2009:
  Free Theorems - Foundations
  Knuth's 0-1-Principle and Beyond
  Free Theorems and "Real" Languages
• Semantic Bidirectionalisation
  as LFCS seminar at University of Edinburgh, April 21, 2009.
• Circular vs. Higher-Order Shortcut Fusion
  as departmental talk at University of Minho, March 30, 2009.
• Type-Based Reasoning and Imprecise Errors
  as colloquium at University of Strathclyde in Glasgow, March 6, 2009.
• Type-Based Reasoning and Bidirectional Transformation
  as colloquium at CAU Kiel, February 20, 2009.
• Bidirectionalization for Free!
  at POPL'09, Savannah, January 22, 2009.
• Free Theorems for Bidirectional Transformation (short talk)
  A Constant-Complement Perspective on Bidirectionalization for Free (technical presentation)
  at GRACE-BX'08, Shonan Village, December 15 and 16, 2008.
• Asymptotic Improvement of Computations over Free Monads
  at MPC'08, Marseille, July 16, 2008.
• Freie Theoreme - Was und Wie (in German)
  at HaL3, Leipzig, April 18, 2008.
• Semantics and Pragmatics of New Shortcut Fusion Rules
  at FLOPS'08, Ise, April 15, 2008.
• Much Ado about Two: A Pearl on Parallel Prefix Computation
  at POPL'08, San Francisco, January 10, 2008.
• Proving Correctness via Free Theorems: The Case of the destroy/build-Rule
  at PEPM'08, San Francisco, January 7, 2008.
• Free Theorems - The Basics
  in our working group, January 6, 2006.
• Komposition von Baumübersetzern als Programmtransformation (in German)
  at my PhD defense, January 24, 2005.
• The Impact of seq on Free Theorems-Based Program Transformations
  in our working group, October 22, 2004.
• Elimination of Intermediate Results in Functional Programs
  as colloquium at TU Munich, November 18, 2003.
• Efficiency Improvement by Tree Transducer Composition
  at workshop of the postgraduate programme GK 334, Gohrisch, April 2, 2003.
• Concatenate, Reverse and Map Vanish For Free
  at ICFP'02, Pittsburgh, October 4, 2002.
• Using Circular Programs to Deforest in Accumulating Parameters
  at ASIA-PEPM'02, Aizu, September 14, 2002.
• Conditions for Efficiency Improvement by Tree Transducer Composition
  at RTA'02, Copenhagen, July 23, 2002.
• Composition of Unrestricted Macro Tree Transducers
  in our working group, April 19, 2002.

Some organizations I am associated with (mainly as corrector in math competitions):

Also, I am a member of: