Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Baba, Kensuke
Hirokawa, Sachio
and
Fujita, Ken-Etsu
2001.
Parallel Reduction in Type Free λμ-Calculus.
Electronic Notes in Theoretical Computer Science,
Vol. 42,
Issue. ,
p.
52.
Abel, Andreas
2001.
A Third-Order Representation of the λμ-Calculus.
Electronic Notes in Theoretical Computer Science,
Vol. 58,
Issue. 1,
p.
97.
Vaux, Lionel
2007.
The differential λμ-calculus.
Theoretical Computer Science,
Vol. 379,
Issue. 1-2,
p.
166.
Ariola, Zena M.
Herbelin, Hugo
and
Sabry, Amr
2007.
A proof-theoretic foundation of abortive continuations.
Higher-Order and Symbolic Computation,
Vol. 20,
Issue. 4,
p.
403.
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.
Douence, Rémi
and
Fradet, Pascal
2007.
The next 700 Krivine machines.
Higher-Order and Symbolic Computation,
Vol. 20,
Issue. 3,
p.
237.
Saurin, Alexis
2008.
Computer Science Logic.
Vol. 5213,
Issue. ,
p.
154.
Kimura, Daisuke
and
Kakutani, Yoshihiko
2009.
Programming Languages and Systems.
Vol. 5904,
Issue. ,
p.
243.
Guerrini, Stefano
and
Masini, Andrea
2009.
Proofs, tests and continuation passing style.
ACM Transactions on Computational Logic,
Vol. 10,
Issue. 2,
p.
1.
Saurin, Alexis
2010.
Foundations of Software Science and Computational Structures.
Vol. 6014,
Issue. ,
p.
374.
Saurin, Alexis
2010.
Typing streams in the Λμ-calculus.
ACM Transactions on Computational Logic,
Vol. 11,
Issue. 4,
p.
1.
Kimura, Daisuke
and
Kakutani, Yoshihiko
2011.
Classical Natural Deduction for S4 Modal Logic.
New Generation Computing,
Vol. 29,
Issue. 1,
p.
61.
Liang, Chuck
and
Miller, Dale
2013.
Unifying Classical and Intuitionistic Logics for Computational Control.
p.
283.
Carraro, Alberto
Ehrhard, Thomas
and
Salibra, Antonino
2013.
The stack calculus.
Electronic Proceedings in Theoretical Computer Science,
Vol. 113,
Issue. ,
p.
93.
Dal Lago, Ugo
and
Pellitta, Giulio
2013.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 8312,
Issue. ,
p.
258.
Crolard, Tristan
2016.
A verified abstract machine for functional coroutines.
Electronic Proceedings in Theoretical Computer Science,
Vol. 212,
Issue. ,
p.
1.
Matache, Cristina
Gomes, Victor B. F.
and
Mulligan, Dominic P.
2017.
Programming Languages and Systems.
Vol. 10695,
Issue. ,
p.
215.
Battyányi, Péter
and
Nour, Karim
2020.
Normalization proofs for the un-typed <i>μμ</i>'-calculus.
AIMS Mathematics,
Vol. 5,
Issue. 4,
p.
3702.
Barenbaum, Pablo
and
Freund, Teodoro
2021.
A Constructive Logic with Classical Proofs and Refutations.
p.
1.
Battyányi, Péter
and
Nour, Karim
2022.
Normalization in the simply typed -calculus.
Mathematical Structures in Computer Science,
Vol. 32,
Issue. 8,
p.
1066.