Dominique Larchey-Wendling

According to our database, Dominique Larchey-Wendling authored at least 30 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Internal and External Calculi: Ordering the Jungle without Being Lost in Translations.

Tim S. Lyon, Agata Ciabattoni, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry, Nicola Olivetti, Revantha Ramanayake

CoRR, 2023

Proof Pearl: Faithful Computation and Extraction of μ-Recursive Algorithms in Coq.

Dominique Larchey-Wendling, Jean-François Monin

Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

2022

Hilbert's Tenth Problem in Coq (Extended Version).

Dominique Larchey-Wendling, Yannick Forster

Log. Methods Comput. Sci., 2022

Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens.

Dominik Kirst, Dominique Larchey-Wendling

Log. Methods Comput. Sci., 2022

2021

Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq.

Dominique Larchey-Wendling

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2020

Constructive Decision via Redundancy-Free Proof-Search.

Dominique Larchey-Wendling

J. Autom. Reason., 2020

Trakhtenbrot's Theorem in Coq - A Constructive Approach to Finite Model Theory.

Dominik Kirst, Dominique Larchey-Wendling

Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019

Hilbert's Tenth Problem in Coq.

Dominique Larchey-Wendling, Yannick Forster

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

Certification of Breadth-First Algorithms by Extraction.

Dominique Larchey-Wendling, Ralph Matthes

Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

Certified undecidability of intuitionistic linear logic via binary stack machines and minsky machines.

Yannick Forster, Dominique Larchey-Wendling

Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2019

2018

Proof Pearl: Constructive Extraction of Cycle Finding Algorithms.

Dominique Larchey-Wendling

Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

2017

Separation Logic with One Quantified Variable.

Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry

Theory Comput. Syst., 2017

Typing Total Recursive Functions in Coq.

Dominique Larchey-Wendling

Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

2016

The formal strong completeness of partial monoidal Boolean BI.

Dominique Larchey-Wendling

J. Log. Comput., 2016

2014

Looking at Separation Algebras with Boolean BI-eyes.

Dominique Larchey-Wendling, Didier Galmiche

Proceedings of the Theoretical Computer Science, 2014

2013

Nondeterministic Phase Semantics and the Undecidability of Boolean BI.

Dominique Larchey-Wendling, Didier Galmiche

ACM Trans. Comput. Log., 2013

2010

An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics.

Dominique Larchey-Wendling

Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

The Undecidability of Boolean BI through Phase Semantics.

Dominique Larchey-Wendling, Didier Galmiche

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding.

Dominique Larchey-Wendling, Didier Galmiche

Math. Struct. Comput. Sci., 2009

2007

Graph-based Decision for Gödel-Dummett Logics.

Dominique Larchey-Wendling

J. Autom. Reason., 2007

2006

Expressivity Properties of Boolean.

Didier Galmiche, Dominique Larchey-Wendling

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005

Bounding Resource Consumption with Gödel-Dummett Logics.

Dominique Larchey-Wendling

Proceedings of the Logic for Programming, 2005

2004

Gödel-Dummett Counter-models through Matrix Computation.

Dominique Larchey-Wendling

Proceedings of the Selected Papers from the Workshops on Disproving, 2004

Counter-Model Search in Gödel-Dummett Logics.

Dominique Larchey-Wendling

Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2002

Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic.

Dominique Larchey-Wendling

Proceedings of the Automated Deduction, 2002

2001

STRIP: Structural Sharing for Efficient Proof-Search.

Dominique Larchey-Wendling, Daniel Méry, Didier Galmiche

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000

Preuves, réfutations et contre-modèles dans des logiques intuitionnistes.

Dominique Larchey-Wendling

PhD thesis, 2000

1999

Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic.

Didier Galmiche, Dominique Larchey-Wendling

Proceedings of the Advances in Computing Science, 1999

1998

Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets.

Dominique Larchey-Wendling, Didier Galmiche

Proceedings of the Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), 1998

Quantales as completions of ordered monoids - Revised semantics for Intuitionistic Linear Logic.

Dominique Larchey-Wendling, Didier Galmiche

Proceedings of the Workshop on Domains IV 1998, 1998