| 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
Journal of Logical and Algebraic Methods in Programming | 2023-09-25 | Paper |
scientific article; zbMATH DE number 7453965 (Why is no real title available?)
| 2022-01-07 | Paper |
Nominal unification with atom and context variables
| 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
Journal of Symbolic Computation | 2018-06-14 | Paper |
Transforming cycle rewriting into string rewriting
| 2017-07-12 | Paper |
Conservative concurrency in Haskell
2012 27th Annual IEEE Symposium on Logic in Computer Science | 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
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
Observational program calculi and the correctness of translations
Theoretical Computer Science | 2015-04-01 | Paper |
Correctness of an STM Haskell implementation
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming | 2015-03-30 | Paper |
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Logical Methods in Computer Science | 2015-03-17 | Paper |
Applicative may- and should-simulation in the call-by-value lambda calculus with AMB
Lecture Notes in Computer Science | 2014-07-24 | Paper |
A two-valued logic for properties of strict functional programs allowing partial functions
Journal of Automated Reasoning | 2013-07-05 | Paper |
Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
Information Processing Letters | 2013-04-04 | Paper |
Correctness of program transformations as a termination problem
Automated Reasoning | 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
Frontiers of Combining Systems | 2011-10-07 | Paper |
Closures of may-, should- and must-convergences for contextual equivalence
Information Processing Letters | 2010-09-07 | Paper |
On generic context lemmas for higher-order calculi with sharing
Theoretical Computer Science | 2010-03-29 | Paper |
Safety of Nöcker's strictness analysis
Journal of Functional Programming | 2008-08-15 | Paper |
A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
Mathematical Structures in Computer Science | 2008-08-15 | Paper |
Deciding inclusion of set constants over infinite non-strict data structures
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
