David Sabel

Proceedings of the Proceedings Combined 28th International Workshop on Expressiveness in Concurrency and 18th Workshop on Structural Operational Semantics, 2021

Minimal Translations from Synchronous Communication to Synchronizing Locks (Extended Version).

[BibT_eX]

[DOI]

Michael Christian Fink Amores

CoRR, 2021

Complexity of Deciding Syntactic Equivalence up to Renaming for Term Rewriting Systems (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2021

2020

Correctly Implementing Synchronous Message Passing in the Pi-Calculus By Concurrent Haskell's MVars.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Combined 27th International Workshop on Expressiveness in Concurrency and 17th Workshop on Structural Operational Semantics, 2020

2019

Nominal unification with atom-variables.

[BibT_eX]

[DOI]

Yunus D. K. Kutz

J. Symb. Comput., 2019

2018

Automating the Diagram Method to Prove Correctness of Program Transformations.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2018

Nominal Unification with Atom and Context Variables.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Sequential and Parallel Improvements in a Concurrent Functional Programming Language.

[BibT_eX]

[DOI]

Nils Dallmeyer

Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

2017

Improvements in a call-by-need functional core language: Common subexpression elimination and resource preserving translations.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2017

Termination of Cycle Rewriting by Transformation and Matrix Interpretation.

[BibT_eX]

[DOI]

Hans Zantema

Log. Methods Comput. Sci., 2017

Alpha-renaming of higher-order meta-expressions.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

2016

A Call-by-Need Lambda Calculus with Scoped Work Decorations.

[BibT_eX]

[DOI]

Proceedings of the Gemeinsamer Tagungsband der Workshops der Tagung Software Engineering 2016 (SE 2016), 2016

Unification of program expressions with recursive bindings.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

2015

Observational program calculi and the correctness of translations.

[BibT_eX]

[DOI]

Joachim Niehren

Jan Schwinghammer

Theor. Comput. Sci., 2015

Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

Transforming Cycle Rewriting into String Rewriting.

[BibT_eX]

[DOI]

Hans Zantema

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Observing Success in the Pi-Calculus.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2015

Improvements in a functional core language with call-by-need operational semantics.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, 2015

Sharing-aware improvements in a call-by-need functional core language.

[BibT_eX]

[DOI]

Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages, 2015

2014

A Haskell-Implementation of STM Haskell with Early Conflict Detection.

[BibT_eX]

[DOI]

Proceedings of the Gemeinsamer Tagungsband der Workshops der Tagung Software Engineering 2014, 2014

Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report).

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2014

Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB.

[BibT_eX]

[DOI]

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Structural Rewriting in the pi-Calculus.

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2014

2013

A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions.

[BibT_eX]

[DOI]

J. Autom. Reason., 2013

Parallelizing DPLL in Haskell.

[BibT_eX]

[DOI]

Till Berger

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

Algorithms for Extended Alpha-Equivalence and Complexity.

[BibT_eX]

[DOI]

Conrad Rau

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Correctness of an STM Haskell implementation.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012

An abstract machine for concurrent haskell with futures.

[BibT_eX]

[DOI]

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

Conservative Concurrency in Haskell.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Correctness of Program Transformations as a Termination Problem.

[BibT_eX]

[DOI]

Conrad Rau

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011

Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

A contextual semantics for concurrent Haskell with futures.

[BibT_eX]

[DOI]

Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

Congruence Closure of Compressed Terms in Polynomial Time.

[BibT_eX]

[DOI]

Altug Anis

Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

2010

On generic context lemmas for higher-order calculi with sharing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Closures of may-, should- and must-convergences for contextual equivalence.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Simulation in the Call-by-Need Lambda-Calculus with letrec.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009

Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi.

[BibT_eX]

[DOI]

Frederik Harwath

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

2008

A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2008

Safety of Nöcker's strictness analysis.

[BibT_eX]

[DOI]

Marko Schütz

J. Funct. Program., 2008

Adequacy of Compositional Translations for Observational Semantics.

[BibT_eX]

[DOI]

Joachim Niehren

Jan Schwinghammer

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Semantik eines verzögert auswertenden Lambdakalküls mit McCarthy's amb für Programmäquivalenz [Semantics of a Call-by-Need Lambda Calculus with McCarthy's Amb for Program Equivalence].

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2008, 2008

Semantics of a call-by-need lambda calculus with McCarthy's amb for programm equivalence.

[BibT_eX]

[DOI]