SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Didier Galmiche: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Didier Galmiche, Dominique Larchey-Wendling
Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
ASIAN, 1999, pp:101-112 [Conf]
Didier Galmiche
Workshop: Type-Theoretic Languages: Proof-Search and Semantics. [Citation Graph (0, 0)][DBLP]
CADE, 2000, pp:515- [Conf]
Didier Galmiche, Daniel Méry
Connection-Based Proof Search in Propositional BI Logic. [Citation Graph (0, 0)][DBLP]
CADE, 2002, pp:111-128 [Conf]
Dominique Larchey-Wendling, Dominique Méry, Didier Galmiche
STRIP: Structural Sharing for Efficient Proof-Search. [Citation Graph (0, 0)][DBLP]
IJCAR, 2001, pp:696-700 [Conf]
Didier Galmiche, Daniel Méry, David J. Pym
Resource Tableaux. [Citation Graph (0, 0)][DBLP]
CSL, 2002, pp:183-199 [Conf]
Nicolas Biri, Didier Galmiche
A Separation Logic for Resource Distribution: Extended Abstract. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2003, pp:23-37 [Conf]
Didier Galmiche, Dominique Larchey-Wendling
Expressivity Properties of Boolean. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2006, pp:357-368 [Conf]
Didier Galmiche, Guy Perrier
Automated Deduction in Additive and Multiplicative Linear Logic. [Citation Graph (0, 0)][DBLP]
LFCS, 1992, pp:151-162 [Conf]
Didier Galmiche, Guy Perrier
Foundations of Proof Search Strategies Design in Linear Logic. [Citation Graph (0, 0)][DBLP]
LFCS, 1994, pp:101-113 [Conf]
Didier Galmiche, O. Hermann
SKIL: A System for Programming with Proofs. [Citation Graph (0, 0)][DBLP]
LPAR, 1993, pp:348-350 [Conf]
Didier Galmiche, Daniel Méry
Characterizing Provability in . [Citation Graph (0, 0)][DBLP]
LPAR, 2005, pp:459-473 [Conf]
Didier Galmiche, J.-M. Notin
Connection-Based Proof Construction in Non-commutative Logic. [Citation Graph (0, 0)][DBLP]
LPAR, 2003, pp:422-436 [Conf]
Didier Galmiche, Guy Perrier
A Procedure for Automatic Proof Nets Construction. [Citation Graph (0, 0)][DBLP]
LPAR, 1992, pp:42-53 [Conf]
Didier Galmiche, Eric Boudinet
Proofs, Concurrent Objects, and Computations in a FILL Framework. [Citation Graph (0, 0)][DBLP]
OBPDC, 1995, pp:148-167 [Conf]
L. Habert, J.-M. Notin, Didier Galmiche
LINK: A Proof Environment Based on Proof Nets. [Citation Graph (0, 0)][DBLP]
TABLEAUX, 2002, pp:330-334 [Conf]
Didier Galmiche, Daniel Méry
Proof-Search and Countermodel Generation in Propositional BI Logic. [Citation Graph (0, 0)][DBLP]
TACS, 2001, pp:263-282 [Conf]
Didier Galmiche
Preface. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2000, v:37, n:, pp:- [Journal]
Didier Galmiche
Preface. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1998, v:17, n:, pp:- [Journal]
Didier Galmiche, Bruno Martin
Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1998, v:17, n:, pp:- [Journal]
Didier Galmiche, J.-M. Notin
Proof-search and proof nets in Mixed Linear Logic. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2000, v:37, n:, pp:- [Journal]
Dominique Larchey-Wendling, Didier Galmiche
Quantales as completions of ordered monoids - Revised semantics for Intuitionistic Linear Logic. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
Dominique Larchey-Wendling, Didier Galmiche
Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 1998, v:17, n:, pp:- [Journal]
Didier Galmiche, Daniel Méry
Semantic Labelled Tableaux for Propositional BI. [Citation Graph (0, 0)][DBLP]
J. Log. Comput., 2003, v:13, n:5, pp:707-753 [Journal]
Jean Paul Bahsoun, José Luiz Fiadeiro, Didier Galmiche
Foreword. [Citation Graph (0, 0)][DBLP]
Mathematical Structures in Computer Science, 1999, v:9, n:3, pp:225-226 [Journal]
Giorgio Delzanno, Didier Galmiche, Maurizio Martelli
A specification logic for concurrent object-oriented programming. [Citation Graph (0, 0)][DBLP]
Mathematical Structures in Computer Science, 1999, v:9, n:3, pp:253-286 [Journal]
Didier Galmiche
Connection methods in linear logic and proof nets construction. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:232, n:1-2, pp:231-272 [Journal]
Didier Galmiche
Constructive System for Automatic Program Synthesis. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1990, v:71, n:2, pp:227-239 [Journal]
Didier Galmiche
Program Development in Constructive Type Theory. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1992, v:94, n:2, pp:237-259 [Journal]
Didier Galmiche, David J. Pym
Proof-search in type-theoretic languages: an introduction. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:232, n:1-2, pp:5-53 [Journal]
Didier Galmiche, Guy Perrier
On Proof Normalization in Linear Logic. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1994, v:135, n:1, pp:67-110 [Journal]
The Undecidability of Boolean BI through Phase Semantics. [Citation Graph (, )][DBLP]
Labelled Calculi for Lukasiewicz Logics. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.304secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP