Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Fernández, Maribel
and
Mackie, Ian
1999.
Computer Science Logic.
Vol. 1683,
Issue. ,
p.
220.
Lévy, Jean-Jacques
and
Maranget, Luc
1999.
Foundations of Software Technology and Theoretical Computer Science.
Vol. 1738,
Issue. ,
p.
181.
Grégoire, Benjamin
and
Leroy, Xavier
2002.
A compiled implementation of strong reduction.
ACM SIGPLAN Notices,
Vol. 37,
Issue. 9,
p.
235.
Ayala-Rincón, Mauricio
de Moura, Flávio L.C.
and
Kamareddine, Fairouz
2002.
Comparing Calculi of Explicit Substitutions with Eta-reduction
.
Electronic Notes in Theoretical Computer Science,
Vol. 67,
Issue. ,
p.
76.
Grégoire, Benjamin
and
Leroy, Xavier
2002.
A compiled implementation of strong reduction.
p.
235.
Sig Ager, Mads
Danvy, Olivier
and
Goldberg, Mayer
2002.
The Essence of Computation.
Vol. 2566,
Issue. ,
p.
296.
GAVA, FRÉDÉRIC
2003.
FORMAL PROOFS OF FUNCTIONAL BSP PROGRAMS.
Parallel Processing Letters,
Vol. 13,
Issue. 03,
p.
365.
Ager, Mads Sig
Biernacki, Dariusz
Danvy, Olivier
and
Midtgaard, Jan
2003.
A functional correspondence between evaluators and abstract machines.
p.
8.
Kamareddine, Fairouz
and
Qiao, Haiyan
2003.
Formalizing Strong Normalization Proofs of Explicit Substitution Calculi in ALF.
Journal of Automated Reasoning,
Vol. 30,
Issue. 1,
p.
59.
Gava, Frédéric
and
Loulergue, Frédéric
2003.
Computational Science — ICCS 2003.
Vol. 2657,
Issue. ,
p.
155.
Sinot, François-Régis
Fernández, Maribel
and
Mackie, Ian
2003.
Rewriting Techniques and Applications.
Vol. 2706,
Issue. ,
p.
46.
Loulergue, F.
2004.
Parallel Computing - Software Technology, Algorithms, Architectures and Applications.
Vol. 13,
Issue. ,
p.
127.
Ager, Mads Sig
Danvy, Olivier
and
Midtgaard, Jan
2004.
A functional correspondence between call-by-need evaluators and lazy abstract machines.
Information Processing Letters,
Vol. 90,
Issue. 5,
p.
223.
Ayala-Rincón, Mauricio
de Moura, Flávio L.C.
and
Kamareddine, Fairouz
2005.
Comparing and implementing calculi of explicit substitutions with eta-reduction.
Annals of Pure and Applied Logic,
Vol. 134,
Issue. 1,
p.
5.
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.
Biernacka, Malgorzata
Biernacki, Dariusz
and
Danvy, Olivier
2005.
An Operational Foundation for Delimited Continuations in the CPS Hierarchy.
Logical Methods in Computer Science,
Vol. Volume 1, Issue 2,
Issue. ,
Danvy, Olivier
2005.
From Reduction-based to Reduction-free Normalization.
Electronic Notes in Theoretical Computer Science,
Vol. 124,
Issue. 2,
p.
79.
Leroy, Xavier
2006.
Programming Languages and Systems.
Vol. 3924,
Issue. ,
p.
54.
Biernacka, Małgorzata
and
Danvy, Olivier
2007.
A concrete framework for environment machines.
ACM Transactions on Computational Logic,
Vol. 9,
Issue. 1,
p.
6.
Biernacka, Małgorzata
and
Danvy, Olivier
2007.
A syntactic correspondence between context-sensitive calculi and abstract machines.
Theoretical Computer Science,
Vol. 375,
Issue. 1-3,
p.
76.
Discussions
No Discussions have been published for this article.