Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Barthe, Gilles
1998.
Automata, Languages and Programming.
Vol. 1443,
Issue. ,
p.
755.
Blanqui, Frédéric
Jouannaud, Jean-Pierre
and
Okada, Mitsuhiro
1999.
Rewriting Techniques and Applications.
Vol. 1631,
Issue. ,
p.
301.
Barthe, Gilles
1999.
Foundations of Software Science and Computation Structures.
Vol. 1578,
Issue. ,
p.
90.
Blanqui, Frédéric
2000.
Rewriting Techniques and Applications.
Vol. 1833,
Issue. ,
p.
47.
van Raamsdonk, Femke
2001.
Rewriting Techniques and Applications.
Vol. 2051,
Issue. ,
p.
261.
Blanqui, F.
2001.
Definitions by rewriting in the calculus of constructions.
p.
9.
Barthe, Gilles
Cirstea, Horatiu
Kirchner, Claude
and
Liquori, Luigi
2003.
Pure patterns type systems.
ACM SIGPLAN Notices,
Vol. 38,
Issue. 1,
p.
250.
Bertolissi, Clara
Cirstea, Horatiu
and
Kirchner, Claude
2003.
Translating Combinatory Reduction Systems into the Rewriting Calculus.
Electronic Notes in Theoretical Computer Science,
Vol. 86,
Issue. 2,
p.
28.
Barthe, Gilles
Cirstea, Horatiu
Kirchner, Claude
and
Liquori, Luigi
2003.
Pure patterns type systems.
p.
250.
Fernández, Maribel
Gabbay, Murdoch J.
and
Mackie, Ian
2004.
Nominal rewriting systems.
p.
108.
Bruni, Roberto
and
Meseguer, José
2006.
Semantic foundations for generalized rewrite theories.
Theoretical Computer Science,
Vol. 360,
Issue. 1-3,
p.
386.
Blanqui, Frédéric
Kirchner, Claude
and
Riba, Colin
2006.
Foundations of Software Science and Computation Structures.
Vol. 3921,
Issue. ,
p.
382.
Walukiewicz-Chrząszcz, Daria
and
Chrząszcz, Jacek
2006.
Automated Reasoning.
Vol. 4130,
Issue. ,
p.
619.
Bertolissi, Clara
Cirstea, Horatiu
and
Kirchner, Claude
2006.
Expressing combinatory reduction systems derivations in the rewriting calculus.
Higher-Order and Symbolic Computation,
Vol. 19,
Issue. 4,
p.
345.
Chrząszcz, Jacek
and
Walukiewicz-Chrząszcz, Daria
2007.
Rewriting, Computation and Proof.
Vol. 4600,
Issue. ,
p.
113.
Blanqui, Frédéric
Kirchner, Claude
and
Riba, Colin
2010.
On the confluence of lambda-calculus with conditional rewriting.
Theoretical Computer Science,
Vol. 411,
Issue. 37,
p.
3301.
Walukiewicz-Chrząszcz, Daria
and
Chrząszcz, Jacek
2010.
Interactive Theorem Proving.
Vol. 6172,
Issue. ,
p.
450.
BLANQUI, FRÉDÉRIC
and
KOPROWSKI, ADAM
2011.
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates.
Mathematical Structures in Computer Science,
Vol. 21,
Issue. 4,
p.
827.
Blanqui, Frédéric
2016.
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility.
Theoretical Computer Science,
Vol. 611,
Issue. ,
p.
50.
BLANQUI, FRÉDÉRIC
2018.
Size-based termination of higher-order rewriting.
Journal of Functional Programming,
Vol. 28,
Issue. ,
Discussions
No Discussions have been published for this article.