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

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

Address:
University of Bonn
Institute for 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:

News:

Current Teaching (in German):

Im Sommersemester 2010 hielt ich die Vorlesung Deskriptive Programmierung.

Im Wintersemester 2010/11 halte ich die Vorlesung Typ-basiertes Programmieren und Schließen in Funktionalen Sprachen.

Previous Teaching

Research:

My research centers around the semantics of functional programming languages. Currently, my focus is on parametricity results (also called free theorems) for polymorphically typed languages. I am also investigating applications of the obtained theoretical results in diverse problem domains. For more details, see my DFG-funded project.

One area of particular interest to me recently is bidirectional transformations (see the Dagstuhl Seminar "bx").

Grants:

Activities:

I am a member of the steering committee for the PEPM workshop series.

I am vice-chairman of the Working Group 2.1.4 "Programming Languages and Computing Concepts" of the German Computer Science Organization GI.

I serve(d) on the program committees for IFL'10, HaL5, PEPM'10 (co-chair), APLAS'09, ATPS'09, Haskell'09, HaL4, WST'09, PEPM'09, and ICFP'07.

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.

I was invited speaker at PPL'10 (Japanese conference on Programming and Programming Languages, about 130 participants).

Ich organisierte den Bonner Hochschultag der Informatik 2010.

Go to Talk Slides

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

Edited (1):

Journals (7, sorted by recency):

Conferences (17, 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).
A web interface to the library developed in this paper is accessible here.

P. Johann, A. Simpson, and J. Voigtländer
A Generic Operational Metatheory for Algebraic Effects
LICS'10.

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).
The tool used in this paper to derive free theorems is now accessible via a web interface here.

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, Z. Hu, K. Matsuda, and M. Wang
Combining Syntactic and Semantic Bidirectionalization
ICFP'10, to appear.

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, pages 175-190, © Springer-Verlag, April 2010.
The implementation of the algorithm presented in this paper is accessible via a web interface here.

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). An abstract-only version appeared in volume 44(11) of SIGPLAN Notices, page 7 (http://doi.acm.org/10.1145/1816027.1816035).

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.
The implementation of the algorithm developed in this paper is accessible via a web interface here.

Theses:

Technical Reports:

Slides of some Talks:

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

MO e.V. eLeMeNTe e.V. Bundeswettbewerb Mathematik

Also, I am a member of:

ACM ACM SIGPLAN DHV GI GI-FG "Programmiersprachen und Rechenkonzepte"
Last Updated: July 2010, Janis Voigtlaender.