Wiki Agenda Contact English version

Publications 1999


Livres / Revues / Conférences / Thèses / Divers / Rapports

Livres et chapitres de livres


[3] Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, and Claude Kirchner. A methodological view of constraint solving. Constraints, 4(4):337--361, December 1999. [ bib | .ps.Z | Abstract ]
[2] Maria C.F. Ferreira, Delia Kesner, and Laurence Puel. Lambda-calculi with Explicit Substitutions Preserving Strong Normalization. Applicable Algebra in Engineering Communication and Computing, 9(4):333--371, 1999. [ bib ]
[1] Delia Kesner and Pablo E. Martínez López. Explicit substitutions for objects and functions. Journal of Functional and Logic Programming, 1999(Special Issue 2), 1999. [ bib ]


[8] Sylvain Conchon and Fabrice Le Fessant. Jocaml: Mobile agents for Objective-Caml. In First International Symposium on Agent Systems and Applications and Third International Symposium on Mobile Agents (ASA/MA'99), pages 22--29, Palm Springs, California, October 1999. [ bib | .ps.gz ]
[7] J.-P. Jouannaud. Towards engineering proofs. In In Logic, Methodology, and Phylosophy of Science, August 1999. [ bib ]
[6] F. Blanqui, J.-P. Jouannaud, and M. Okada. The Calculus of Algebraic Constructions. In Paliath Narendran and Michael Rusinowitch, editors, 10th International Conference on Rewriting Techniques and Applications, volume 1631 of Lecture Notes in Computer Science, Trento, Italy, July 1999. Springer. [ bib ]
[5] E. Bonelli. Using fields and explicit substitutions to implement objects and functions in a de bruijn setting. In Proc. of the Annual Conference of the European Association for Computer Science Logic (CSL), LNCS, 1999. [ bib ]
[4] E. Bonelli. The polymorphic lambda calculus with explicit substitutions. In Proc. of the Second International Workshop on Explicit Substitutions: Theory and Applications to Programs and Proofs, 1999. [ bib ]
[3] Jean-Pierre Jouannaud and Albert Rubio. The higher-order recursive path ordering. In Giuseppe Longo, editor, Fourteenth Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 1999. IEEE Comp. Soc. Press. [ bib | .ps.gz | Abstract ]
[2] Serenella Cerrito and Delia Kesner. Pattern matching as cut elimination. In Giuseppe Longo, editor, Fourteenth Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 1999. IEEE Comp. Soc. Press. [ bib | .ps.gz ]
[1] Jean-Christophe Filliâtre and Nicolas Magaud. Certification of Sorting Algorithms in the System Coq. In Theorem Proving in Higher Order Logics: Emerging Trends, Nice, France, 1999. [ bib | .ps.gz ]


[1] Jean-Christophe Filliâtre. Preuve de programmes impératifs en théorie des types. PhD thesis, Université Paris-Sud, July 1999. [ bib | .ps.gz ]


[2] Jean-Pierre Jouannaud and Ralf Treinen. Constraints and constraint solving: An introduction. Course Notes at the International Summer School on Constraints in Computational Logics, Gif-sur-Yvette, France, September 1999. Revised version published as [?]. [ bib | .ps.gz | Abstract ]
[1] Y. Bertot, G. Dowek, C. Paulin-Mohring, and L. Théry, editors. International Conference on Theorem Proving in Higher Order Logics (TPHOLs'99), Lecture Notes in Computer Science, Nice, September 1999. Springer. [ bib ]


[4] Jean-Christophe Filliâtre. A theory of monads parameterized by effects. Research Report 1367, LRI, Université Paris Sud, November 1999. [ bib | .ps.gz ]
[3] B. Barras, S. Boutin, C. Cornes, J. Courant, Y. Coscoy, D. Delahaye, D. de Rauglaudre, J.C. Filliâtre, E. Giménez, H. Herbelin, G. Huet, H. Laulhère, P. Loiseleur, C. Muñoz, C. Murthy, C. Parent, C. Paulin, A. Saïbi, and B. Werner. The Coq Proof Assistant Reference Manual -- Version V6.3, July 1999. [ bib | Abstract ]
[2] G. Huet, G. Kahn, and Ch. Paulin-Mohring. The Coq Proof Assistant - A tutorial - Version 6.3, July 1999. [ bib | Abstract ]
[1] Judicaël Courant. MC: A module calculus for Pure Type Systems. Research Report 1217, LRI, June 1999. [ bib | .ps ]


Livres / Revues / Conférences / Thèses / Divers / Rapports

This page was generated by bibtex2html.