|
[20]
|
M. Dauchet.
Symbolic constraints and tree automata.
In Jean-Pierre Jouannaud, editor, First International Conference
on Constraints in Computational Logics, volume 845 of Lecture Notes in
Computer Science, pages 217--218, München, Germany, September 1994.
Springer.
[ bib ]
|
|
[19]
|
D. Lugiez.
Higher order disunification: some decidabl cases.
In Jean-Pierre Jouannaud, editor, First International Conference
on Constraints in Computational Logics, volume 845 of Lecture Notes in
Computer Science, München, Germany, September 1994. Springer.
[ bib ]
|
|
[18]
|
Zhenyu Qian and Kang Wang.
Modular AC-Unification of Higher-Order Patterns.
In Jean-Pierre Jouannaud, editor, First International Conference
on Constraints in Computational Logics, volume 845 of Lecture Notes in
Computer Science, pages 105--120, München, Germany, September 1994.
Springer.
[ bib ]
|
|
[17]
|
W. Snyder.
Automated deduction with constraints.
In Jean-Pierre Jouannaud, editor, First International Conference
on Constraints in Computational Logics, volume 845 of Lecture Notes in
Computer Science, München, Germany, September 1994. Springer.
[ bib ]
|
|
[16]
|
Judicaël Courant.
Explicitation de preuves par récurrence implicite.
In Actes de la journée du Pôle Preuves et
Spécifications Algébriques du GDR de programmation du CNRS, Lille,
France, September 1994.
[ bib ]
|
|
[15]
|
Jean-Pierre Jouannaud and Walid Sadfi.
Strong sequentiality of left-linear overlapping rewrite systems.
In N. Dershowitz, editor, Workshop on Conditional Term Rewriting
systems, Lecture Notes in Computer Science, vol. 968, pages 235--246,
Jerusalem, July 1994. Springer.
[ bib |
.ps.gz |
Abstract ]
|
|
[14]
|
Roberto Di Cosmo and Delia Kesner.
Combining first order algebraic rewriting systems, recursion and
extensional lambda calculi.
In Serge Abiteboul and Eli Shamir, editors, 21th International
Colloquium on Automata, Languages and Programming, volume 820 of
Lecture Notes in Computer Science, pages 462--472, Jerusalem, Israel, July
1994. Springer.
[ bib |
.ps.gz ]
|
|
[13]
|
Delia Kesner.
Reasoning about Layered, Wildcard and Product Patterns.
In Giorgio Levi and Mario Rodríguez-Artalejo, editors, 4th
International Conference on Algebraic and Logic Programming, volume 850 of
Lecture Notes in Computer Science, pages 253--268, Madrid, Spain,
September 1994. Springer-Verlag.
[ bib |
.ps.gz ]
|
|
[12]
|
Leo Bachmair and Harald Ganzinger.
Buchberger's algorithm: A constraint-based completion procedure.
In Jean-Pierre Jouannaud, editor, First International Conference
on Constraints in Computational Logics, volume 845 of Lecture Notes in
Computer Science, pages 285--301, München, Germany, September 1994.
Springer.
[ bib ]
|
|
[11]
|
F. Barbanera, M. Fernández, and H. Geuvers.
Modularity of strong normalization and confluence in the
λ-algebraic-cube.
In Proceedings of the Ninth Annual IEEE Symposium on Logic in
Computer Science, pages 406--415, Paris, France, July 1994. IEEE Comp.
Soc. Press.
[ bib ]
|
|
[10]
|
Alexandre Boudet and Évelyne Contejean.
“Syntactic” AC-unification.
In Jean-Pierre Jouannaud, editor, First International Conference
on Constraints in Computational Logics, volume 845 of Lecture Notes in
Computer Science, pages 136--151, München, Germany, September 1994.
Springer.
[ bib |
http |
Abstract ]
|
|
[9]
|
Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, and
Florent Jacquemard.
Pumping, cleaning and symbolic constraints solving.
In Proc. Int. Conference on Algorithms, Languages and
Programming, pages 436--449, 1994.
[ bib ]
|
|
[8]
|
Hubert Comon and Ralf Treinen.
Ordering constraints on trees.
In Sophie Tison, editor, Colloquium on Trees in Algebra and
Programming, volume 787 of Lecture Notes in Computer Science, pages
1--14, Edinburgh, Scotland, 1994. Springer.
(Invited Lecture).
[ bib |
.ps.Z ]
|
|
[7]
|
Hubert Comon.
Inductionless induction.
In René David, editor, 2nd International Conference in Logic
For Computer Science: Automated Deduction. Lecture notes., Chambéry,
July 1994. Univ. de Savoie.
[ bib ]
|
|
[6]
|
Hubert Comon and Florent Jacquemard.
Ground Reducibility and Automata with Disequality Constraints.
In P. Enjalbert, editor, Proc. 11th Symp. on Theoretical Aspects
of Computer Science, volume 775 of Lecture Notes in Computer Science,
pages 151--162, Caen, 1994. Springer.
[ bib ]
|
|
[5]
|
Max Dauchet.
Rewriting and tree automata.
In Hubert Comon and Jean-Pierre Jouannaud, editors, Term
Rewriting, volume 909 of Lecture Notes in Computer Science. French
Spring School of Theoretical Computer Science, Springer, 1994.
[ bib ]
|
|
[4]
|
Jean-Pierre Jouannaud and Maribel Fernández.
Modular properties of term rewriting systems : New proofs and
results.
In J. Tiuryn, editor, Proc. Computer Science Logic. University
of Kasimiercz, 1994.
(invited lecture).
[ bib ]
|
|
[3]
|
Marianne Haberstrau.
Ecolog: an environment for constraint logics.
In Jean-Pierre Jouannaud, editor, First International Conference
on Constraints in Computational Logics, volume 845 of Lecture Notes in
Computer Science, pages 237--252, München, Germany, September 1994.
Springer.
[ bib ]
|
|
[2]
|
Claude Marché.
Normalised rewriting and normalised completion.
In Proceedings of the Ninth Annual IEEE Symposium on Logic in
Computer Science, pages 394--403, Paris, France, July 1994. IEEE Comp.
Soc. Press.
[ bib |
PDF |
Abstract ]
|
|
[1]
|
Frédéric Leclerc and Christine Paulin-Mohring.
Programming with streams in Coq. a case study : The sieve of
eratosthenes.
In H. Barendregt and T. Nipkow, editors, Types for Proofs and
Programs, Types' 93, volume 806 of Lecture Notes in Computer Science.
Springer, 1994.
[ bib ]
|