Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kameyama, Yukiyoshi
and
Sato, Masahiko
2002.
Strong normalizability of the non-deterministic catch/throw calculi.
Theoretical Computer Science,
Vol. 272,
Issue. 1-2,
p.
223.
Ariola, Zena M.
and
Herbelin, Hugo
2003.
Automata, Languages and Programming.
Vol. 2719,
Issue. ,
p.
871.
Herbelin, Hugo
2005.
Typed Lambda Calculi and Applications.
Vol. 3461,
Issue. ,
p.
209.
Sørensen, Morten Heine
and
Urzyczyin, Pawel
2006.
Lectures on the Curry-Howard Isomorphism.
Vol. 149,
Issue. ,
p.
127.
Sørensen, M.H.
and
Urzyczyn, P.
2006.
Lectures on the Curry-Howard Isomorphism.
Vol. 149,
Issue. ,
p.
403.
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.
Reed, Jason
and
Pfenning, Frank
2009.
Intuitionistic Letcc via Labelled Deduction.
Electronic Notes in Theoretical Computer Science,
Vol. 231,
Issue. ,
p.
91.
Herbelin, Hugo
2010.
An Intuitionistic Logic that Proves Markov's Principle.
p.
50.
Herbelin, Hugo
2012.
A Constructive Proof of Dependent Choice, Compatible with Classical Logic.
p.
365.
Geuvers, Herman
Krebbers, Robbert
and
McKinna, James
2013.
TheλμT-calculus.
Annals of Pure and Applied Logic,
Vol. 164,
Issue. 6,
p.
676.
Liang, Chuck
and
Miller, Dale
2013.
Unifying Classical and Intuitionistic Logics for Computational Control.
p.
283.
Stump, Aaron
2014.
The recursive polarized dual calculus.
p.
3.
Crolard, Tristan
2016.
A verified abstract machine for functional coroutines.
Electronic Proceedings in Theoretical Computer Science,
Vol. 212,
Issue. ,
p.
1.
Miquey, Étienne
and
Herbelin, Hugo
2018.
Foundations of Software Science and Computation Structures.
Vol. 10803,
Issue. ,
p.
276.
van Bakel, Steffen
2019.
Exception Handling and Classical Logic.
p.
1.
Discussions
No Discussions have been published for this article.