Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Forest, Julien
2002.
Rewriting Techniques and Applications.
Vol. 2378,
Issue. ,
p.
174.
Nadathur, Gopalan
2002.
The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations.
Electronic Notes in Theoretical Computer Science,
Vol. 67,
Issue. ,
p.
35.
Hendriks, Dimitri
and
van Oostrom, Vincent
2003.
Automated Deduction – CADE-19.
Vol. 2741,
Issue. ,
p.
136.
Bonelli, Eduardo
2003.
Foundations of Software Science and Computation Structures.
Vol. 2620,
Issue. ,
p.
153.
David, René
and
Guillaume, Bruno
2003.
Computer Science Logic.
Vol. 2803,
Issue. ,
p.
155.
Fernández, Maribel
Gabbay, Murdoch J.
and
Mackie, Ian
2004.
Nominal rewriting systems.
p.
108.
Liang, Chuck
Nadathur, Gopalan
and
Qi, Xiaochu
2004.
Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts.
Journal of Automated Reasoning,
Vol. 33,
Issue. 2,
p.
89.
Râştei, Amelia
2005.
Abstract Conditions for the Confluence of Explicit Substitution Calculi.
Electronic Notes in Theoretical Computer Science,
Vol. 123,
Issue. ,
p.
213.
Fern�ndez, Maribel
Mackie, Ian
and
Sinot, Fran�ois-R�gis
2005.
Lambda-Calculus with Director Strings.
Applicable Algebra in Engineering, Communication and Computing,
Vol. 15,
Issue. 6,
p.
393.
Bonelli, Eduardo
2005.
Normalisation for higher-order calculi with explicit substitutions.
Theoretical Computer Science,
Vol. 333,
Issue. 1-2,
p.
91.
Kesner, Delia
and
Lengrand, Stéphane
2007.
Resource operators for λ-calculus.
Information and Computation,
Vol. 205,
Issue. 4,
p.
419.
Cirstea, Horatiu
Faure, Germain
and
Kirchner, Claude
2007.
A ρ-calculus of explicit constraint application.
Higher-Order and Symbolic Computation,
Vol. 20,
Issue. 1-2,
p.
37.
Kesner, Delia
2008.
Automata, Languages and Programming.
Vol. 5126,
Issue. ,
p.
311.
Kesner, Delia
2009.
A Theory of Explicit Substitutions with Safe and Full Composition.
Logical Methods in Computer Science,
Vol. Volume 5, Issue 3,
Issue. ,
Kesner, Delia
and
Renaud, Fabien
2011.
A prismoid framework for languages with resources.
Theoretical Computer Science,
Vol. 412,
Issue. 37,
p.
4867.
de Moura, F.L.C.
Barbosa, A.V.
Ayala-Rincón, M.
and
Kamareddine, F.
2011.
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi.
Electronic Notes in Theoretical Computer Science,
Vol. 269,
Issue. ,
p.
41.
Accattoli, Beniamino
and
Kesner, Delia
2012.
Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus.
Logical Methods in Computer Science,
Vol. Volume 8, Issue 1,
Issue. ,
Rose, Kristoffer H.
Bloo, Roel
and
Lang, Frédéric
2012.
On Explicit Substitution with Names.
Journal of Automated Reasoning,
Vol. 49,
Issue. 2,
p.
275.
Lima, Maria J. D.
and
de Moura, Flávio L. C.
2023.
A Formalized Extension of the Substitution Lemma in Coq.
Electronic Proceedings in Theoretical Computer Science,
Vol. 389,
Issue. ,
p.
80.