|
|
| ||
|---|---|---|---|---|
|
|
| |||
|
|
| |||
|
|
| |||
|
|
![]() |
Außerdem organisiere ich das Informatik-Kolloquium.
One area of particular interest to me recently is bidirectional transformations. I got (separate) DFG-funding for work on this topic.
I am a member of the IFIP Working Group 2.1 on Algorithmic Languages and Calculi since 2012.
I am a member of the steering committee for the Haskell Symposium series since 2011.
I am a member of the steering committee for the BX workshop series since 2012.
I was a member of the steering committee for the PEPM workshop series from 2010 to 2012, serving as its chair from 2011 to 2012.
I co-edited a special issue of Electronic Communications of the EASST devoted to selected papers from BX'12.
I co-edited a special issue of Higher-Order and Symbolic Computation devoted to selected papers from PEPM'10.
I serve(d) as chair or co-chair of the program committees for:
I served on the external review committee for POPL'13.
I co-organized CSXW'11.
Since 2008, I serve as editor of the Haskell Communities and Activities Report (appearing twice a year). CCC depicts the situation quite aptly here.
I was the keynote speaker at LDTA'12.
I was one of two keynote speakers at PPL'10 (Japanese conference on Programming and Programming Languages, about 130 participants).
I served on the PhD committees of some very fine candidates (and now PhD holders...):
Ich organisier(t)e die Bonner Hochschultage der Informatik 2013, 2012, 2011 und 2010.
|
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). It is available via the ACM DL Author-ize feature here. 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). It is available via the ACM DL Author-ize feature here. |
|
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). It is available via the ACM DL Author-ize feature here. 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 (bib+abstract) In 25th Symposium on Logic in Computer Science (LICS'10, acceptance rate 40/149), Edinburgh, Scotland, Proceedings, pages 209-218, © IEEE Press, July 2010. |
|
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). It is available via the ACM DL Author-ize feature here. 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). It is available via the ACM DL Author-ize feature here. |
|
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). It is available via the ACM DL Author-ize feature here. A video of the conference presentation is available here. |
|
J. Voigtländer, Z. Hu, K. Matsuda, and M. Wang Combining Syntactic and Semantic Bidirectionalization (bib+abstract) In 15th International Conference on Functional Programming (ICFP'10, acceptance rate 33/99), Baltimore, Maryland, Proceedings, volume 45(9) of SIGPLAN Notices, pages 181-192, © ACM Press, September 2010. 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/1863543.1863571). It is available via the ACM DL Author-ize feature here. A web interface to the methods discussed in this paper is accessible here. 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 (bib+abstract) 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.P. Fernandes, J. Saraiva, D. Seidel, and J. Voigtländer Strictification of Circular Programs (bib+abstract) In Workshop on Partial Evaluation and Program Manipulation (PEPM'11, acceptance rate 15/35), Austin, Texas, Proceedings, pages 131-140, © ACM Press, January 2011. 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/1929501.1929526). It is available via the ACM DL Author-ize feature 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. |
|
D. Seidel and J. Voigtländer Proving Properties About Functions on Lists Involving Element Tests (bib+abstract) In 20th International Workshop on Algebraic Development Techniques (WADT'10), Schloss Etelsen, Germany, Revised Selected Papers (acceptance rate 15/32), volume 7137 of LNCS, pages 270-286, © Springer-Verlag, February 2012. |
|
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 Ideas for Connecting Inductive Program Synthesis and Bidirectionalization (bib+abstract) In Workshop on Partial Evaluation and Program Manipulation (PEPM'12, acceptance rate 19/37), Philadelphia, Pennsylvania, Proceedings, pages 39-42, © ACM Press, January 2012. 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://dx.doi.org/10.1145/2103746.2103757). It is available via the ACM DL Author-ize feature here. |
|
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). It is available via the ACM DL Author-ize feature here. An extended version of this work appeared in Higher-Order and Symbolic Computation, see above. |
|
J. Christiansen, D. Seidel, and J. Voigtländer An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry (bib+abstract) In 19th International Workshop on Functional and (Constraint) Logic Programming (WFLP'10, acceptance rate 12/15), Madrid, Spain, Revised Selected Papers (acceptance rate 8/12), volume 6559 of LNCS, pages 119-136, © Springer-Verlag, 2011. We found that two of the conjectures in the paper do not hold, see the online appendix for details. There is also a revised version available as a technical report, incorporating the corrections, see below. |
|
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). It is available via the ACM DL Author-ize feature here. 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. An extended version of this work appeared in Acta Informatica, see above. |
|
D. Seidel and J. Voigtländer Improvements for Free (bib+abstract) In 9th Workshop on Quantitative Aspects of Programming Languages (QAPL'11, acceptance rate 11/13), Saarbrücken, Germany, Post-Proceedings, volume 57 of EPTCS, pages 89-103, 2011. |
|
|
|
| ACM | ACM SIGPLAN | DHV | GI | GI-FG "Programmiersprachen und Rechenkonzepte" |