Proof-search in mixed linear logic - extended abstract.

Didier Galmiche 1 Jean-Marc Notin 1
1 TYPES - Logic, proof Theory and Programming
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we study proof-search methods in the multiplicative fragment of mixed linear logic that are based on the use of labelled proof nets. We mainly analyze the interaction and relationships in such a logic between the commutative and non-commutative connectives. From previous results on proof search in commutative and non-commutative (or cyclic) linear logic, we propose two different procedures, both based on proof nets search relative to some constraints satisfaction or propagation.
Type de document :
Communication dans un congrès
CADE-17 Workshop on Proof-theoretic Languages: Proof-search & Semantics, 2000, CMU, Pittsburgh/USA, 14 p, 2000
Liste complète des métadonnées

https://hal.inria.fr/inria-00099234
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:52:01
Dernière modification le : mardi 24 avril 2018 - 13:34:45

Identifiants

  • HAL Id : inria-00099234, version 1

Collections

Citation

Didier Galmiche, Jean-Marc Notin. Proof-search in mixed linear logic - extended abstract.. CADE-17 Workshop on Proof-theoretic Languages: Proof-search & Semantics, 2000, CMU, Pittsburgh/USA, 14 p, 2000. 〈inria-00099234〉

Partager

Métriques

Consultations de la notice

172