Précédent : Jurys de thèses Remonter : Projet
CALLIGRAMME Suivant : Abstract
- Livres
- 1
- C. RETORé
(réd.), Logical Aspects of Computational Linguistics,
CRIN-C.N.R.S. & INRIA-Lorraine, 1996.
- Articles
- 2
- D. BECHET,
``Interface in Linear Logic : A Finite System of
Generators'', Journal of the Int. Group in Pure and Applied
Logics 4, 3, 1996, Report of the 3rd Workshop on Logic,
Language, Information and Computation, Salvador, Brazil, May
1996.
- 3
- F. LAMARCHE,
``From Proof Nets to Games (extended abstract)'',
Electronic Notes in Theoretical Computer Science, 3,
1996.
- 4
- G. PERRIER,
``CPL : un modèle logique du calcul parallèle'', Technique
et science informatiques 15, 5, 1996,
p. 619-642.
- 5
- C. RETORé,
``Perfect matchings and series-parallel graphs: multiplicative
proof nets as R&B-graphs (extended abstract)'',
Electronic Notes in Theoretical Computer Science 3,
1996.
- 6
- C. RETORé, ``Des
réseaux de démonstration pour la linguistique: une introduction
à la logique linéaire'', Traitement Automatique des
Langues, 1997, à paraître.
- 7
- C. RETORé, ``A
semantical characterisation of the correctness of a proof
net'', Mathematical Structures in Computer Science,
1997, à paraître dans le numéro spécial consacré à
LDPL'95.
- Communications à
congrès
- 8
- D. BECHET,
P. DE GROOTE, ``Constructing Different
Phonological Bracketings from a Proof Net'', in:
Proceedings of the 1996 conference on Logical Aspect of
Computational Linguistics, Nancy, France, September 1996,
INRIA-Lorraine and CRIN-CNRS, 1996.
- 9
- D. BECHET,
``Removing Value Encoding using Alternative Values in Partial
Evaluation of Strongly-Typed Languages'', in: Proceedings
of the 3rd European Symposium on Programming, Linköping,
Sweden, April 1996 (Lecture Notes in Computer Science, vol.
1058), H. R. Nielson (réd.), Berlin: Springer-Verlag,
p. 77-91, 1996.
- 10
- P. DE GROOTE, C. RETORé, ``Semantic readings of proof
nets'', in: Formal Grammar, G.-J. Kruijff,
G. Morrill, D. Oehrle (réd.), FoLLI, p. 57-70,
Prague, août 1996.
- 11
- P. DE GROOTE, ``Classical Logic and
Exception Handling'', in: Specification and Semantics,
J. M. H. Ehrig, F. von Henke,
M. Wirsing (réd.), Dagstuhl-Seminar-Report 151,
1996.
- 12
- P. DE GROOTE, ``Partially commutative
linear logic: sequent calculus and phase semantics'', in:
Third Roma Workshop: Proofs and Linguistic Categories,
M. Abrusci, C. Casadio, G. Sandri (réd.),
Rapporto di Ricerca del Dipartimento de Filosofia,
Università di Bologna, 1996.
- 13
- F. LAMARCHE,
C. RETORé, ``Proof
nets for the Lambek calculus'', in: Third Roma Workshop:
Proofs and Linguistic Categories, M. Abrusci,
C. Casadio, G. Sandri (réd.), Rapporto di Ricerca
del Dipartimento de Filosofia, Università di Bologna,
1996.
- 14
- A. LECOMTE,
C. RETORé, ``Words
as Modules: a lexicalised grammar in the framework of linear
logic proof nets'', in: International Conference on
Mathematical Linguistics II, C. Martin-Vide (réd.),
Tarragona, mai 1996.
- 15
- A. LECOMTE,
C. RETORé, ``Words
as Modules and Modules as partial Proof nets in a Lexicalised
Grammar'', in: Third Roma Workshop: Proofs and Linguistic
Categories, M. Abrusci, C. Casadio,
G. Sandri (réd.), Rapporto di Ricerca del Dipartimento
de Filosofia, Università di Bologna, 1996.
- 16
- S. MALECKI,
``Proofs in system
can be done in
system 
'', présenté à
CSL'96, soumis aux proceedings de la conference, 1996.
- 17
- C. RETORé,
``Pomset logic: a non-commutative extension of classical linear
logic'', in: TLCA'97, LNCS, 1997. à
paraître.
- Rapports de
recherche
- 18
- J.-Y. MARION, ``Case
Study: Additive Linear Logic and Lattices'', rapport de
recherche n°96-R-179, CRIN-CNRS, 1996.
- 19
- G. PERRIER,
``Concurrent Programming as Proof Net Construction'',
Research Report n°96-R-132, CRIN-CNRS, Nancy, sep
1996, soumis à Mathemathical Structures in Computer
Science.
- Divers
- 20
- D. BECHET,
P. DE GROOTE, F. LAMARCHE, A. LECOMTE, S. MALECKI, G. PERRIER, C. RETORé, ``Proposition de projet
commun INRIA - CRIN - CNRS Calligramme'', document interne,
1996.
- 21
- S. MALECKI, ``A
Relativisation of the Typability Relation in Polymorphic Type
Systems'', Soumis à Theoretical Computer Science, 1996.