David Sabel

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Minimal translations from synchronous communication to synchronizing locks	2024-11-26	Paper
Program equivalence in a typed probabilistic call-by-need functional language	2023-09-25	Paper
https://portal.mardi4nfdi.de/entity/Q5020947	2022-01-07	Paper
https://portal.mardi4nfdi.de/entity/Q4993360	2021-06-15	Paper
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)	2019-10-24	Paper
Structural Rewriting in the pi-Calculus.	2019-10-24	Paper
Observing Success in the Pi-Calculus	2019-10-24	Paper
Nominal unification with atom-variables	2018-06-14	Paper
Transforming Cycle Rewriting into String Rewriting	2017-07-12	Paper
Conservative Concurrency in Haskell	2017-05-16	Paper
Termination of Cycle Rewriting by Transformation and Matrix Interpretation	2017-05-08	Paper
Algorithms for Extended Alpha-Equivalence and Complexity	2017-02-01	Paper
Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings	2017-02-01	Paper
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures	2015-07-10	Paper
Observational program calculi and the correctness of translations	2015-04-01	Paper
Correctness of an STM Haskell implementation	2015-03-30	Paper
Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq	2015-03-17	Paper
Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB	2014-07-24	Paper
A two-valued logic for properties of strict functional programs allowing partial functions	2013-07-05	Paper
Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec	2013-04-04	Paper
Correctness of Program Transformations as a Termination Problem	2012-09-05	Paper
Simulation in the call-by-need lambda-calculus with letrec	2012-04-25	Paper
Congruence Closure of Compressed Terms in Polynomial Time	2011-10-07	Paper
Closures of may-, should- and must-convergences for contextual equivalence	2010-09-07	Paper
On generic context lemmas for higher-order calculi with sharing	2010-03-29	Paper
Safety of Nöcker's strictness analysis	2008-08-15	Paper
A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations	2008-08-15	Paper
Deciding inclusion of set constants over infinite non-strict data structures	2008-02-15	Paper

Research outcomes over time

This page was built for person: David Sabel