Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456 Paul-André Melliès: Research Papers
Four typed lambda-calculi with explicit substitutions may not terminate:
the first examples
Manuscript, Paris, April 1994.
PostScript (5 pages)
On a duality between Kruskal and Dershowitz theorems
Proceedings of the 25th International Colloquium
on Automata Languages and Programming, Aalborg, 1998.
ICALP'98
PostScript (12 pages)
Coherence in braided monoidal categories
Braids as a conflict-free rewriting system
Manuscript, Amsterdam, 1995.
PostScript (12 pages)
MacLane's coherence theorem viewed as a word problem.
Prépublication de l'équipe PPS (October 2003, number 25).
Manuscript, Paris, 2000.
PostScript (10 pages)
Axiomatic Rewriting Theory I
A diagrammatic standardization theorem
Processes, Terms and Cycles: Steps on the Road to Infinity.
Essays dedicated to Jan Willem Klop on the occasion
of his 60th birthday.
Edited by Aart Middeldorp, Vincent van Oostrom,
Femke van Raamsdonk and Roel de Vrijer.
Springer Verlag, Lecture Notes in Computer Science 3838.
Note: a preliminary version appeared as
Prépublication de l'équipe PPS (December 2002, number 13).
Pdf (81 pages)
Axiomatic Rewriting Theory II
The lambda-sigma calculus enjoys finite normalisation cones
Journal of Logic and Computation,
vol 10 No. 3, pp. 461-487, 2000.
Preliminary version:
PostScript (30 pages)
Axiomatic Rewriting Theory III
A factorisation theorem in Rewriting Theory
Proceedings of the 7th Conference on Category Theory
and Computer Science, Santa Margherita Ligure,
Lecture Notes in Computer Science 1290, pp. 49-68, Springer, 1997.
CTCS'97
PostScript (20 pages)
Axiomatic Rewriting Theory IV
A stability theorem in Rewriting Theory
Proceedings of the 14th Annual Symposium on
Logic in Computer Science, Indianapolis,
pp. 287-298, 1998.
LICS'98
PostScript (12 pages)
Axiomatic Rewriting Theory V
Computations as events
In preparation.
Axiomatic Rewriting Theory VI
Residual theory revisited
Proceedings of Conference on Rewriting Techniques
and Applications, Copenhague, 2002.
RTA'02
(Best paper award of the conference.)
PostScript (17 pages)
Axiomatic Rewriting Theory VII
Explicit substitutions without critical pairs
In preparation.
Double categories: a modular model of multiplicative linear logic
Mathematical Structures in Computer Science,
vol. 12, pp 449-479, 2002.
Preliminary version:
PostScript (31 pages)
A topological correctness criterion for non-commutative logic
Prépublication de l'équipe PPS (December 2002, number 15).
Linear Logic in Computer Science,
T. Ehrhard, J-Y. Girard, P. Ruet and P. Scott eds.
London Mathematical Society Lecture Notes Series,
Volume 316, 2004.
Preliminary version:
PostScript (40 pages)
Categorical models of linear logic revisited
Prépublication de l'équipe PPS (September 2003, number 22).
To appear in
Theoretical Computer Science.
Preliminary version:
PostScript (37 pages)
Comparing hierarchies of types in models of linear logic
Prépublication de l'équipe PPS (December 2002, number 14).
Information and Computation,
Volume 189, Issue 2, Pages 202-234, March 2004.
Preliminary version:
PostScript (36 pages)
Pdf (36 pages)
Sequential algorithms and strongly stable functions
Full version of
Sequentiality and extensionality
(circulated as lecture notes during the
LINEAR summer school,
the Azores, September 2000.)
Prépublication de l'équipe PPS (September 2003, number 23).
To appear in the special issue of
Theoretical Computer Science
“Game Theory Meets Theoretical Computer Science.”
Preliminary version:
PostScript (52 pages)
Pdf (52 pages)
Asynchronous games 1
A group-theoretic formulation of uniformity
Unpublished. Preliminary version. March 2003.
Pdf (31 pages)
Asynchronous games 2
The true concurrency of innocence
Extended abstract published in the
Proceedings of the 15th International Conference
on Concurrency Theory, London, 2004.
Lecture Notes in Computer Science 3170, pp. 448-465, Springer Verlag.
Extended Abstract:
Pdf (17 pages)
CONCUR 2004
Journal version to appear in the special issue of
Theoretical Computer Science
“Selected papers of CONCUR 2004.”
Preliminary Journal Version:
Pdf (44 pages)
Asynchronous games 3
An innocent model of linear logic
Proceedings of the 10th Conference on Category Theory and Computer Science,
Copenhagen, 2004.
CTCS 2004
Pdf (21 pages)
Asynchronous games 4
A fully complete model of propositional linear logic
Proceedings of the 21th Conference on Logic in Computer Science,
Chicago, 2005.
LiCS 2005
Joint work with
Benjamin Werner,
Proceedings of the international workshop TYPES'96,
Lecture Notes in Computer Science 1512, Springer, 1998.
TYPES'96
PostScript (28 pages)
On the subject reduction property for algebraic type systems
Joint work with
Gilles Barthe,
Proceedings of the 10th Annual Conference
of the European Association for Computer Science Logic,
Utrecht
Lecture Notes in Computer Science 1258, pp. 34-57, Springer, 1996.
CSL'96
PostScript (18 pages)
Recursive types
Semantic Types: A fresh look at the ideal models for types
Joint work with
Jérôme Vouillon,
Proceedings of the 31st Annual Symposium
on Principles of Programming Languages, Venezia, 2004.
POPL'04
PostScript (12 pages)
Recursive polymorphic types and parametricity
in an operational framework
Joint work with
Jérôme Vouillon,
Proceedings of the 21th Conference on Logic in Computer Science, Chicago, 2005.
LiCS 2005
Preliminary version:
Pdf (12 pages)
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders, usually the publishers. All
persons and robots copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit
permission of the copyright holder.
The electronic versions of the papers available here may differ from the published versions. The authoritative versions are the published ones.