David Sabel

From MaRDI portal
Person:352944

Available identifiers

zbMath Open sabel.davidMaRDI QIDQ352944

List of research outcomes





PublicationDate of PublicationType
Minimal translations from synchronous communication to synchronizing locks2024-11-26Paper
Program equivalence in a typed probabilistic call-by-need functional language2023-09-25Paper
https://portal.mardi4nfdi.de/entity/Q50209472022-01-07Paper
Nominal unification with atom and context variables2021-06-15Paper
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)2019-10-24Paper
Structural Rewriting in the pi-Calculus.2019-10-24Paper
Observing Success in the Pi-Calculus2019-10-24Paper
Nominal unification with atom-variables2018-06-14Paper
Transforming cycle rewriting into string rewriting2017-07-12Paper
Conservative concurrency in Haskell2017-05-16Paper
Termination of cycle rewriting by transformation and matrix interpretation2017-05-08Paper
Algorithms for extended alpha-equivalence and complexity2017-02-01Paper
Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings2017-02-01Paper
Observational semantics for a concurrent lambda calculus with reference cells and futures2015-07-10Paper
Observational program calculi and the correctness of translations2015-04-01Paper
Correctness of an STM Haskell implementation2015-03-30Paper
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq2015-03-17Paper
Applicative may- and should-simulation in the call-by-value lambda calculus with AMB2014-07-24Paper
A two-valued logic for properties of strict functional programs allowing partial functions2013-07-05Paper
Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec2013-04-04Paper
Correctness of program transformations as a termination problem2012-09-05Paper
Simulation in the call-by-need lambda-calculus with letrec2012-04-25Paper
Congruence closure of compressed terms in polynomial time2011-10-07Paper
Closures of may-, should- and must-convergences for contextual equivalence2010-09-07Paper
On generic context lemmas for higher-order calculi with sharing2010-03-29Paper
Safety of Nöcker's strictness analysis2008-08-15Paper
A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations2008-08-15Paper
Deciding inclusion of set constants over infinite non-strict data structures2008-02-15Paper

Research outcomes over time

This page was built for person: David Sabel