Projet Calligramme
Précédent : Diffusion des résultats
Remonter : Projet CALLIGRAMME, Logique Linéaire,
Réseaux
- Livres et
monographies
- 1
- P. DE
GROOTE, R.
HINDLEY (réd.),
Third International Conference on Typed Lambda Calculi and
Applications, TLCA'97, Lecture Notes in Computer Science,
Volume 1210 ,
Springer, 1997.
- 2
- C. RETORÉ (réd.),
Logical Aspects of Computational Linguistics, LACL'96
, LNAI , 1328 ,
Springer, Oct. 1997.
- 3
- C. RETORÉ (réd.),
Logical Aspects of Computational Linguistics ,
Journal of Logic, Language and Information (Special
Issue) ,
Kluwer Academic Publisher, 1998.
- Articles
- 4
- A. LECOMTE,
« Grammaire et théorie de la preuve : une introduction »,
Traitement Automatique des Langues 37 , 2, Décembre
1996, p. 3-37.
- 5
- A. LECOMTE,
« Prosodie et stratégie de calcul »,
Traitement Automatique des Langues 38 , 1, 1997.
- 6
- D. LEIVANT, J.-Y.
MARION,
« Predicative recurrence and computational complexity IV:
Predicative functionals and poly-space. »,
Information and Computation , 1997,
à paraître.
- 7
- C. RETORÉ,
« Calcul de Lambek et logique linéaire »,
Traitement Automatique des Langues 37 , 2, Déc. 1996,
p. 39-71.
- 8
- C. RETORÉ,
« A semantic characterisation of the correctness of a proof net
»,
Mathematical Structures in Computer Science 7 , 5,
1997, p. 445-452.
- Communications à des manifestations
scientifiques
- 9
- D. BECHET, P.
DE
GROOTE, C.
RETORÉ,
« A complete axiomatisation of the inclusion of series-parallel
partial orders »,
in: Rewriting Techniques and Applications, RTA'97 , H.
Comon (réd.), LNCS , 1232 , Springer,
1997.
- 10
- D. BECHET, P.
DE
GROOTE,
« Constructing different phonological bracketings from a proof
net »,
in: Logical Aspects of Computational Linguistics,
LACL'96 , C. Retoré (réd.), LNAI , 1328
, Springer,
1997.
- 11
- P. BLACKBURN, M.
DYMETMAN, A.
LECOMTE, A.
RANTA, C.
RETORÉ, E. V.
DE LA
CLERGERIE,
« Logical Aspects of Computational Linguistics: an introduction
»,
in: Logical Aspects of Computational Linguistics,
LACL`96 , C. Retoré (réd.), LNAI , 1328
, Springer,
Oct. 1997.
- 12
- P. DE
GROOTE,
« An algebraic correctness criterion for intuitionistic
proof-nets »,
in: 4th International Symposium on Logical Foundations of
Computer Science , S. A. A. Nerode (réd.), LNCS ,
1234 , Springer, p. 130-140,
July 1997.
- 13
- P. DE
GROOTE,
« On the expressive power of the Lambek calculus extended with
a structural modality -- Abstract »,
in: R. de Queiroz, 4th Workshop on Logic, Language,
Information and Computation, WoLLIC'97, Logic Journal of the
IGPL, Volume 6 , p. 886-889,
November 1997.
- 14
- A. LECOMTE, C.
RETORÉ,
« Logique de ressources et réseaux syntaxiques »,
in: 4ème conférence sur le Traitement automatique du
langage naturel, TALN'97 , D. Genthial (réd.), Pôle
Langage Naturel, Grenoble, p. 70-83,
1997.
- 15
- A. LECOMTE, C.
RETORÉ,
« Words as modules and modules as partial proof-nets in a
Lexicalized grammar »,
in: ICML'96 , John Benjamin,
1998. à paraître.
- 16
- D. LEIVANT, J.-Y.
MARION,
« Predicative Functional Recurrence and Poly-Space »,
in: TAPSOFT'97 CAAP , M. Bidoit, M. Dauchet (réd.),
LNCS 1214, Springer-Verlag, p. 369-380,
April 1997.
- 17
- J.-Y. MARION,
« Case study : Additive Linear Logic and Lattices »,
in: 4th International Symposium on Logical Foundations of
Computer Science , S. A. A. Nerode (réd.), LNCS ,
1234 , Springer, p. 237-247,
July 1997.
- 18
- G. PERRIER,
« A decidable fragment of Second Order Linear Logic »,
in: 4th International Symposium on Logical Foundations of
Computer Science , S. A. A. Nerode (réd.), LNCS ,
1234 , Springer, p. 312-322,
July 1997.
- 19
- G. PERRIER,
« Labelled Proof Nets for the Syntax and Semantics of Natural
Languages -- Abstract »,
in: R. de Queiroz, 4th Workshop on Logic, Language,
Information and Computation, WoLLIC'97, Logic Journal of the
IGPL, Volume 6 , p. 907-910,
November 1997.
- 20
- C. RETORÉ,
« Pomset logic: a non-commutative extension of classical linear
logic »,
in: TLCA'97 , R. Hindley, P. de Groote (réd.),
LNCS , 1210 , p. 300-318,
1997.
- Bibliographie
générale
- Abr91
- M. Abrusci.
Phase semantics and sequent calculus for pure non-commutative
classical linear logic.
Journal of Symbolic Logic, 56(4):1403-1451, 1991.
- AM97
- V.M. Abrusci and E. Maringelli.
A new correctness criterion for cyclic multiplicative linear
logic.
Technical report, Università di Romma tre, 1997.
- AP91
- J.-M. Andreoli and R. Pareschi.
Linear objects: Logical processes with built-in
inheritance.
New Generation Computing, 9(3-4), 1991.
- Asp91
- A. Asperti.
A linguistic approach to deadlock.
Technical Report LIENS-91-15, ENS, Paris, 1991.
- Bec96
- 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.
- BH50
- Y. Bar-Hillel.
A quasi-arithmetical notation for syntactic description.
Language, 29:47-58, 1950.
- Bru97
- Paola Bruscoli.
Linear Logic for Spatial and Temporal Reasoning - Proof
Search and Partial Order Planning.
PhD thesis, University of Ancona (Italy), 1997.
- Cur77
- H.B. Curry.
Foundations of mathematical logic.
Dover Publications, 1977.
- Dan90
- V. Danos.
Une application de la logique linéaire à l'étude des
processus de normalisation et principalement du lambda
calcul.
Thèse de doctorat, Université de Paris VII, 1990.
- dG95
- Ph. de Groote.
A simple calculus of exception handling.
In M. Dezani and G. Plotkin, editors, Second International
Conference on Typed Lambda Calculi and Applications,
TLCA'95, volume 902 of Lecture Notes in Computer
Science, pages 201-215. Springer Verlag, 1995.
- dG96
- Ph. de Groote.
Partially commutative linear logic: sequent calculus and phase
semantics.
In M. Abrusci, C. Casadio, and G. Sandri, editors, Third
Roma Workshop: Proofs and Linguistic Categories, Rapporto
di Ricerca del Dipartimento de Filosofia. Università di
Bologna, 1996.
- Emm89
- M. Emms.
Parsing with polymorphic quantifiers.
In M.S.L. Torenvliet, editor, Proceedings of the Seventh
Amsterdam Colloquium, Institute for Language, Logic and
Information, Amsterdam, 1989.
- Emm93
- M. Emms.
Parsing with polymorphism.
In Proceedings of the Sixth Annual Conference of the
European Association for Computational Linguistics,
1993.
- Gen55
- G. Gentzen.
Recherches sur la déduction logique (Untersuchungen über
das logische schliessen).
Presses Universitaires de France, 1955.
Traduction et commentaire par R. Feys et J. Ladrière.
- Gir86
- Jean-Yves Girard.
Multiplicatives.
Rendiconti del Seminario dell'Universitá é Politecnico
Torino, October 1986.
Special issue on Logic and Computer Science.
- Gir87
- J.-Y. Girard.
Linear logic.
Theoretical Computer Science, 50:1-102, 1987.
- Gri90
- T. G. Griffin.
A formulae-as-types notion of control.
In Conference record of the seventeenth annual ACM
symposium on Principles of Programming Languages, pages
47-58, 1990.
- Gug94
- A. Guglielmi.
Concurrency and plan generation in a logic programming language
with a sequential operator.
In International Conference on Logic Programming,
pages 240-254. MIT Press, 1994.
- Gug96
- Alessio Guglielmi.
Abstract Logic Programming in Linear Logic--Independence
and Causality in a First Order Calculus.
PhD thesis, Università di Pisa, 1996.
- How80
- W.A. Howard.
The formulae-as-types notion of construction.
In J. P. Seldin and J. R. Hindley, editors, to H. B. Curry:
Essays on Combinatory Logic, Lambda Calculus and
Formalism, pages 479-490. Academic Press, 1980.
- KY92
- N. Kobayashi and A Yonezawa.
Asynchronous communication model based on linear logic.
In proceedings of Joint Intl. Conf. and Symp. on Logic
Programming (JICSLP'92), Workshop on Linear Logic and Logic
Programming, Washington, November 1992.
- Laf90
- Y. Lafont.
Interaction nets.
In Proceedings of the 17th ACM symposium on Principles of
Programming Languages. ACM Press, 1990.
- Lam58
- J. Lambek.
The mathematics of sentence structure.
Amer. Math. Monthly, 65:154-170, 1958.
- Lam61
- J. Lambek.
On the calculus of syntactic types.
In Studies of Language and its Mathematical Aspects,
pages 166-178, Providence, 1961. Proc. of the 12th Symp. Appl.
Math..
- LR95
- A. Lecomte and C. Retoré.
Pomset logic as an alternative categorial grammar.
In Proceedings of the Conference of the European Summer
School in Logic, Language and Information, Barcelona,
1995.
- Mar96
- E. Maringelli.
Grafi e logica lineare.
Tesi di laurea, Università di Bari, 1996.
- Mil93
- D. Miller.
The 
-calculus as a theory in linear logic:
Preliminary results.
In E. Lamma and P. Mello, editors, Proceedings of the 1992
Workshop on Extensions to Logic Programming, volume 660 of
Lecture Notes in Computer Science, pages 242-265.
Springer-Verlag, 1993.
- MM96
- J. Merenciano and G. Morrill.
Generation as deduction on labelled proof nets.
In C. Retoré, editor, Logical Aspects of Computational
Linguistics, LACL'96, Nancy, september 1996, volume 1328
of Lecture Notes in Computer Science, pages 310-328.
Springer Verlag, 1996.
- MNPS91
- D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov.
Uniform proofs as a foundation for logic programming.
Annals of Pure and Applied Logic, 51:125-157,
1991.
- Mon73
- R. Montague.
The proper treatment of quantification in ordinary english.
In J. Hintikka, J. Moravcsik, and P. Suppes, editors,
Approaches to natural language: proceedings of the 1970
Stanford workshop on Grammar and Semantics, Dordrecht,
1973. Reidel.
- Per95
- G. Perrier.
De la construction de preuves à la programmation parallèle
en logique linéaire.
Thèse de doctorat, Université Henri Poincaré, Nancy, January
1995.
- Per96
- Guy Perrier.
Concurrent Programming as Proof Net Construction.
Research Report 96-R-132, CRIN-CNRS, Nancy, sep 1996.
soumis à Mathemathical Structures in Computer Science.
- Ret93
- Ch. Retoré.
Réseaux et Séquents Ordonnés.
Thèse de Doctorat, spécialité Mathématiques, Université Paris
7, 1993.
- Ret96
- Christian Retoré.
Perfect matchings and series-parallel graphs: multiplicative
proof nets as R&B-graphs.
Electronic Notes in Theoretical Computer Science, 3,
1996.
- SNWs96
- V. Sassone, M. Nielsen, and G. Winskel.
Models for concurrency: Towards a classification.
Theoretical Computer Science, 170(1/2), 1996.