The following pages link to Dominique Larchey-Wendling (Q877885):
Displaying 30 items.
- Graph-based decision for Gödel-Dummett logics (Q877886) (← links)
- Typing total recursive functions in Coq (Q1687755) (← links)
- Proof pearl: constructive extraction of cycle finding algorithms (Q1791179) (← links)
- Certification of breadth-first algorithms by extraction (Q2176671) (← links)
- Separation logic with one quantified variable (Q2411038) (← links)
- (Q2848063) (← links)
- Nondeterministic Phase Semantics and the Undecidability of Boolean BI (Q2946690) (← links)
- (Q3007292) (← links)
- An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics (Q3178265) (← links)
- Looking at Separation Algebras with Boolean BI-eyes (Q3190171) (← links)
- Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding (Q3636908) (← links)
- (Q4223030) (← links)
- (Q4501574) (← links)
- (Q4513584) (← links)
- (Q4540540) (← links)
- (Q4809045) (← links)
- Separation Logic with One Quantified Variable (Q4981154) (← links)
- Trakhtenbrot’s Theorem in Coq (Q5048993) (← links)
- The Braga Method: Extracting Certified Algorithms from Complex Recursive Schemes in Coq (Q5081874) (← links)
- Hilbert's Tenth Problem in Coq (Q5089029) (← links)
- (Q5094119) (← links)
- (Q5094147) (← links)
- Automated Reasoning (Q5307065) (← links)
- Expressivity Properties of Boolean BI Through Relational Models (Q5385999) (← links)
- Bounding Resource Consumption with Gödel-Dummett Logics (Q5387874) (← links)
- The formal strong completeness of partial monoidal Boolean BI (Q5739976) (← links)
- Constructive decision via redundancy-free proof-search (Q5916291) (← links)
- Constructive decision via redundancy-free proof-search (Q5919012) (← links)
- Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq (Q6159935) (← links)
- Proof Pearl: faithful computation and extraction of \(\mu\)-recursive algorithms in Coq (Q6643002) (← links)
