research
∙
05/30/2022
A Probabilistic Call-by-Need Lambda-Calculus – Extended Version
To support the understanding of declarative probabilistic programming la...
share
research
∙
08/24/2021
Minimal Translations from Synchronous Communication to Synchronizing Locks
In order to understand the relative expressive power of larger concurren...
research
∙
07/30/2021
Minimal Translations from Synchronous Communication to Synchronizing Locks (Extended Version)
In order to understand the relative expressive power of larger concurren...
research
∙
06/25/2021
Complexity of Deciding Syntactic Equivalence up to Renaming for Term Rewriting Systems (Extended Version)
Inspired by questions from program transformations, eight notions of iso...
research
∙
08/31/2020
Correctly Implementing Synchronous Message Passing in the Pi-Calculus By Concurrent Haskell's MVars
Comparison of concurrent programming languages and correctness of progra...
research
∙
02/22/2019
Automating the Diagram Method to Prove Correctness of Program Transformations
We report on the automation of a technique to prove the correctness of p...
research
∙
02/21/2019
Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation
This volume contains the formal proceedings of the 5th International Wor...
research
∙
02/16/2018
