|
[5]
|
Jean-Pierre Jouannaud and Albert Rubio.
Rewrite orderings for higher-order terms in η-long
β-normal form and the recursive path ordering.
Theoretical Computer Science, 208(1--2):3--31, November 1998.
[ bib ]
|
|
[4]
|
Ralf Treinen.
The first-order theory of linear one-step rewriting is undecidable.
Theoretical Computer Science, 208(1--2):149--177, November
1998.
[ bib ]
|
|
[3]
|
Rolf Backofen and Ralf Treinen.
How to win a game with features.
Information and Computation, 142(1):76--101, April 1998.
Special issue on the 1st International Conference on Constraints in
Computational Logics, München, Germany, edited by Jean-Pierre Jouannaud.
[ bib |
.ps.gz |
Abstract ]
|
|
[2]
|
Claude Marché.
Normalized Rewriting: an unified view of Knuth-Bendix completion and
Gröbner bases computation.
Progress in Computer Science and Applied Logic, 15:193--208,
1998.
[ bib |
PDF |
Abstract ]
|
|
[1]
|
Gabriel Ciobanu and Mihai Rotaru.
Faithful pi-nets. a faithful graphical representation for
pi-calculus.
Electronic Notes in Theoretical Computer Science, 18, 1998.
[ bib |
.html ]
|
|
[12]
|
J.-P. Jouannaud.
Membership equational logic, calculus of inductive constructions, and
rewrite logic.
In In Proc. 2nd Workshop on Rewrite Logic and Applications,
September 1998.
[ bib ]
|
|
[11]
|
Jacek Chrząszcz.
Polymorphic subtyping without distributivity.
In Jiri Zlatuska Lubos Brim, Josef Gruska, editor, Mathematical
Foundations of Computer Science, number 1450 in Lecture Notes in Computer
Science, pages 346--355, Brno, Czech Republic, August 1998. Springer Verlag.
[ bib ]
|
|
[10]
|
Alexandre Boudet and Évelyne Contejean.
About the Confluence of Equational Pattern Rewrite Systems.
In C. and H. Kirchner, editors, 15th International Conference on
Automated Deduction, volume 1421 of Lecture Notes in Computer Science,
pages 88--102, Lindau, Germany, July 1998. Springer.
[ bib |
DOI |
Abstract ]
|
|
[9]
|
Daria Walukiewicz.
A total AC-compatible reduction ordering on higher-order terms.
In Kim G. Larsen, editor, Proceedings of the 25th International
Colloquium on Automata, Languages, and Programming (ICALP'98), volume 1443
of Lecture Notes in Computer Science. EATCS, Springer, July 1998.
[ bib ]
|
|
[8]
|
Mina Abdiche.
On the encoding of λ<= in π<=.
In 7th International workshop on functional and logic
programming (FLP'98), Bad-honnef, Germany, April 1998.
Proceedings will appear as a technical report of the University of
Münster.
[ bib ]
|
|
[7]
|
Nicolas Beldiceanu, Éric Bourreau, and Évelyne Contejean.
Solving a hard vehicle routing & loading problem.
In Proceedings of the Spring Meeting of the Institute for
Operations Research and the Management Sciences, Montreal, April 1998.
[ bib |
Abstract ]
|
|
[6]
|
Claude Marché and Xavier Urbain.
Termination of associative-commutative rewriting by dependency pairs.
In Tobias Nipkow, editor, 9th International Conference on
Rewriting Techniques and Applications, volume 1379 of Lecture Notes in
Computer Science, pages 241--255, Tsukuba, Japan, April 1998. Springer.
[ bib |
PDF |
Abstract ]
|
|
[5]
|
Martin Müller, Joachim Niehren, and Ralf Treinen.
The first-order theory of ordering constraints over feature trees.
In Vaughan Pratt, editor, Thirteenth Annual IEEE Symposium on
Logic in Computer Science, pages 432--443, Indianapolis, IN, USA, June 1998.
IEEE Comp. Soc. Press.
[ bib ]
|
|
[4]
|
Nachum Dershowitz and Ralf Treinen.
An on-line problem database.
In Tobias Nipkow, editor, 9th International Conference on
Rewriting Techniques and Applications, volume 1379 of Lecture Notes in
Computer Science, pages 332--342, Tsukuba, Japan, April 1998. Springer.
[ bib |
.ps.gz ]
|
|
[3]
|
Maria C.F. Ferreira, Delia Kesner, and Laurence Puel.
Reducing AC-Termination to Termination.
In Lubos Brim, Jozef Gruska, and Jiri Zlatuska, editors,
Mathematical Foundations of Computer Science, volume 1450 of Lecture
Notes in Computer Science, pages 239--247, Brno, Czech Republic, August
1998. Springer.
[ bib |
.ps.gz ]
|
|
[2]
|
Delia Kesner and Pablo E. Martínez López.
Explicit substitutions for objects and functions.
In MCatuscia Palamidessi, Hugh Glaser, and Karl Meinke, editors,
Principles of Declarative Programming, volume 1490 of Lecture Notes in
Computer Science, pages 195--212, Pisa, Italy, September 1998. Springer.
[ bib ]
|
|
[1]
|
Jean-Christophe Filliâtre.
Proof of Imperative Programs in Type Theory.
In Proceedings of the TYPES'98 workshop, volume 1657 of
Lecture Notes in Computer Science. Springer, 1998.
[ bib |
.ps.gz ]
|
|
[2]
|
B. Barras, S. Boutin, C. Cornes, J. Courant, D. Delahaye, D. de Rauglaudre,
J.-C. Filliâtre, E. Giménez, H. Herbelin, G. Huet, P. Loiseleur,
C. Muñoz, C. Murthy, C. Parent, C. Paulin-Mohring, A. Saïbi, and
B. Werner.
The Coq Proof Assistant Reference Manual Version 6.2.
INRIA-Rocquencourt-CNRS-Université Paris Sud- ENS Lyon,
May 1998.
[ bib |
ftp ]
|
|
[1]
|
F. Blanqui.
The Calculus of Algebraic and Inductive Constructions.
Master's thesis, Université Paris VII, 1998.
[ bib ]
|