The following pages link to David Sabel (Q352944):
Displaying 28 items.
- A two-valued logic for properties of strict functional programs allowing partial functions (Q352946) (← links)
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- Closures of may-, should- and must-convergences for contextual equivalence (Q991760) (← links)
- Nominal unification with atom-variables (Q1640638) (← links)
- Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec (Q1944119) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- Correctness of Program Transformations as a Termination Problem (Q2908517) (← links)
- Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings (Q2958387) (← links)
- Algorithms for Extended Alpha-Equivalence and Complexity (Q2958388) (← links)
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation (Q2980975) (← links)
- Conservative Concurrency in Haskell (Q2986833) (← links)
- Congruence Closure of Compressed Terms in Polynomial Time (Q3172897) (← links)
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations (Q3520145) (← links)
- Safety of Nöcker's strictness analysis (Q3520168) (← links)
- (Q4993360) (← links)
- (Q5020947) (← links)
- Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB (Q5170830) (← links)
- Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq (Q5178823) (← links)
- Structural Rewriting in the pi-Calculus. (Q5240137) (← links)
- Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (Q5240138) (← links)
- Observing Success in the Pi-Calculus (Q5240185) (← links)
- Correctness of an STM Haskell implementation (Q5244798) (← links)
- Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures (Q5262945) (← links)
- Transforming Cycle Rewriting into String Rewriting (Q5277885) (← links)
- Simulation in the call-by-need lambda-calculus with letrec (Q5389151) (← links)
- Deciding inclusion of set constants over infinite non-strict data structures (Q5441550) (← links)
- Program equivalence in a typed probabilistic call-by-need functional language (Q6052951) (← links)
- Minimal translations from synchronous communication to synchronizing locks (Q6643748) (← links)
