HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Proof-search in implicative linear logic as a matching problem

Philippe de Groote 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We reduce the provability of fragments of multiplicative linear logic to matching problems consisting in finding a one-one-correspondence between two sets of first-order terms together with a unifier that equates the corresponding terms. According to the kind of structure to which these first-order terms belong our matching problem corresponds to provability in the implicative fragment of multiplicative linear logic, in the Lambek calculus, or in the non-associative Lambek calculus.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:51:57 AM
Last modification on : Friday, February 4, 2022 - 3:34:40 AM


  • HAL Id : inria-00099221, version 1



Philippe de Groote. Proof-search in implicative linear logic as a matching problem. International Conference on Logic for Programming & Automated Reasoning - LPAR'2000, 2000, Reunion Island, France, pp.257-274. ⟨inria-00099221⟩



Record views