Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Sabel, David"'
To support the understanding of declarative probabilistic programming languages, we introduce a lambda-calculus with a fair binary probabilistic choice that chooses between its arguments with equal probability. The reduction strategy of the calculus
Externí odkaz:
http://arxiv.org/abs/2205.14916
Autor:
Schmidt-Schauß, Manfred, Sabel, David
Publikováno v:
EPTCS 339, 2021, pp. 59-75
In order to understand the relative expressive power of larger concurrent programming languages, we analyze translations of small process calculi which model the communication and synchronization of concurrent processes. The source language SYNCSIMPL
Externí odkaz:
http://arxiv.org/abs/2108.11226
Autor:
Schmidt-Schauß, Manfred, Sabel, David
In order to understand the relative expressive power of larger concurrent programming languages, we analyze translations of small process calculi which model the communication and synchronization of concurrent processes. The source language SYNCSIMPL
Externí odkaz:
http://arxiv.org/abs/2107.14651
Motivated by questions from program transformations, eight notions of isomorphisms between term rewriting systems are defined, analysed, and classified. The notions include global isomorphisms, where the renaming of variables and function symbols is
Externí odkaz:
http://arxiv.org/abs/2106.13520
Autor:
Schmidt-Schauß, Manfred, Sabel, David
Publikováno v:
EPTCS 322, 2020, pp. 88-105
Comparison of concurrent programming languages and correctness of program transformations in concurrency are the focus of this research. As criterion we use contextual semantics adapted to concurrency, where may -- as well as should -- convergence ar
Externí odkaz:
http://arxiv.org/abs/2008.13359
Autor:
Schmidt-Schauß, Manfred, Sabel, David
Publikováno v:
In Journal of Logical and Algebraic Methods in Programming October 2023 135
Autor:
Sabel, David
Publikováno v:
EPTCS 289, 2019, pp. 17-33
We report on the automation of a technique to prove the correctness of program transformations in higher-order program calculi which may permit recursive let-bindings as they occur in functional programming languages. A program transformation is corr
Externí odkaz:
http://arxiv.org/abs/1902.08420
Autor:
Niehren, Joachim, Sabel, David
Publikováno v:
EPTCS 289, 2019
This volume contains the formal proceedings of the 5th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2018), held on 8th of Juli 2018 in Oxford, United Kingdom, and affiliated with FLoC 2018 and FSCD 2
Externí odkaz:
http://arxiv.org/abs/1902.07818
Autor:
Cirstea, Horatiu, Sabel, David
Publikováno v:
EPTCS 265, 2018
This volume contains the formal proceedings of the 4th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2017), held on 8th September 2017 in Oxford, United Kingdom, and affiliated with the Second Interna
Externí odkaz:
http://arxiv.org/abs/1802.05862
Autor:
Sabel, David, Zantema, Hans
Publikováno v:
Logical Methods in Computer Science, Volume 13, Issue 1 (March 17, 2017) lmcs:3206
We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main technique is to transform cycle rewriting into string rewriting and then apply st
Externí odkaz:
http://arxiv.org/abs/1609.07065