Janis Voigtländer

Lutz Straßburger

Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

Formalizing Semantic Bidirectionalization with Dependent Types.

[BibT_eX]

[DOI]

Helmut Grohne

Andres Löh

Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

2013

Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins.

[BibT_eX]

[DOI]

J. Funct. Program., 2013

A Generic Scheme and Properties of Bidirectional Transformations.

[BibT_eX]

[DOI]

CoRR, 2013

Vorwort zur 6. Arbeitstagung Programmiersprachen (ATPS 2013).

[BibT_eX]

[DOI]

Jens Knoop

Proceedings of the Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium), Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar, 2013

6. Arbeitstagung Programmiersprachen (ATPS 2013).

[BibT_eX]

[DOI]

Jens Knoop

Proceedings of the Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar, 2013

Understanding idiomatic traversals backwards and forwards.

[BibT_eX]

[DOI]

Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell, 2013

2012

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

[BibT_eX]

[DOI]

Frank Hermann

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012

5. Arbeitstagung Programmiersprachen (ATPS 2012).

[BibT_eX]

[DOI]

Frank Huch

Proceedings of the Software Engineering 2012: Fachtagung des GI-Fachbereichs Softwaretechnik, 27. Februar, 2012

Ideas for connecting inductive program synthesis and bidirectionalization.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, 2012

Programming language approaches to bidirectional transformation.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Language Descriptions, 2012

2011

Improvements for Free

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Acta Informatica, 2011

Strictification of circular programs.

[BibT_eX]

[DOI]

Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2011

2010

Editorial.

[BibT_eX]

[DOI]

John P. Gallagher

High. Order Symb. Comput., 2010

An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry.

[BibT_eX]

[DOI]

Jan Christiansen

Proceedings of the Functional and Constraint Logic Programming, 2010

Proving Properties about Functions on Lists Involving Element Tests.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 2010

Three Complementary Approaches to Bidirectional Programming.

[BibT_eX]

[DOI]

Nate Foster

Kazutaka Matsuda

Proceedings of the Generic and Indexed Programming - International Spring School, 2010

Free theorems for functional logic programs.

[BibT_eX]

[DOI]

Jan Christiansen

Proceedings of the 4th ACM Workshop Programming Languages meets Program Verification, 2010

A Generic Operational Metatheory for Algebraic Effects.

[BibT_eX]

[DOI]

Alex Simpson

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Combining syntactic and semantic bidirectionalization.

[BibT_eX]

[DOI]

Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

Automatically Generating Counterexamples to Naive Free Theorems.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009

Free theorems for functional logic programs: (abstract only).

[BibT_eX]

[DOI]

Jan Christiansen

ACM SIGPLAN Notices, 2009

A family of syntactic logical relations for the semantics of Haskell-like languages.

[BibT_eX]

[DOI]

Inf. Comput., 2009

Parametricity for Haskell with Imprecise Error Semantics.

[BibT_eX]

[DOI]

Florian Stenger

Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

Bidirectionalization for free! (Pearl).

[BibT_eX]

[DOI]

Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

Free theorems involving type constructor classes: functional pearl.

[BibT_eX]

[DOI]

Proceedings of the Proceeding of the 14th ACM SIGPLAN international conference on Functional programming, 2009

Taming Selective Strictness.

[BibT_eX]

[DOI]

Proceedings of the 39. Jahrestagung der Gesellschaft für Informatik, Im Focus das Leben, INFORMATIK 2009, Lübeck, Germany, September 28, 2009

2008

Much ado about two (pearl): a pearl on parallel prefix computation.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, 2008

Asymptotic Improvement of Computations over Free Monads.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

Semantics and Pragmatics of New Shortcut Fusion Rules.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

2007

Selective strictness and parametricity in structural operational semantics, inequationally.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Formal Efficiency Analysis for Tree Transducer Composition.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Deaccumulation techniques for improving provability.

[BibT_eX]

[DOI]

Jürgen Giesl

Armin Kühnemann

J. Log. Algebraic Methods Program., 2007

2006

The Impact of seq on Free Theorems-Based Program Transformations.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

2005

Tree transducer composition as program transformation.

[BibT_eX]

[DOI]

PhD thesis, 2005

2004

Using Circular Programs to Deforest in Accumulating Parameters.

[BibT_eX]

[DOI]

High. Order Symb. Comput., 2004

Composition of functions with accumulating parameters.

[BibT_eX]

[DOI]

Armin Kühnemann

J. Funct. Program., 2004

Free theorems in the presence of <i>seq</i>.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

2003

Deaccumulation - Improving Provability.

[BibT_eX]

[DOI]

Jürgen Giesl

Armin Kühnemann

Proceedings of the Advances in Computing Science, 2003

2002

Conditions for Efficiency Improvement by Tree Transducer Composition.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

Concatenate, reverse and map vanish for free.

[BibT_eX]

[DOI]