A Sequent Calculus for Modelling Interferences

Simple item page
dc.creatorFouqueré, Christophe
dc.date2007-06-22
dc.date.accessioned2026-07-07T08:11:55Z
dc.date.available2026-07-07T08:11:55Z
dc.descriptionA logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal with multisequent structures and has the cut-elimination property. Extensions are proposed that give first results concerning our objectives.
dc.identifierhttps://arxiv.org/abs/0706.3341
dc.identifierhttp://arxiv.org/abs/0706.3341
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132276
dc.subjectLogic in Computer Science
dc.titleA Sequent Calculus for Modelling Interferences
dc.typetext

Files

Collections

arXiv