Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Fujita, Ken-etsu
1999.
Typed Lambda Calculi and Applications.
Vol. 1581,
Issue. ,
p.
162.
Fujita, Ken-Etsu
2000.
Domain-Freeλµ-Calculus.
RAIRO - Theoretical Informatics and Applications,
Vol. 34,
Issue. 6,
p.
433.
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.
de Groote, Philippe
2001.
Typed Lambda Calculi and Applications.
Vol. 2044,
Issue. ,
p.
182.
Wood, Carol
2001.
2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000.
Bulletin of Symbolic Logic,
Vol. 7,
Issue. 1,
p.
82.
Matthes, Ralph
2001.
Typed Lambda Calculi and Applications.
Vol. 2044,
Issue. ,
p.
329.
Yamagata, Yoriyuki
2001.
Theoretical Aspects of Computer Software.
Vol. 2215,
Issue. ,
p.
459.
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.
Fujita, Ken-etsu
2002.
An interpretation of -calculus in -calculus.
Information Processing Letters,
Vol. 84,
Issue. 5,
p.
261.
Fujita, Ken-etsu
2003.
Typed Lambda Calculi and Applications.
Vol. 2701,
Issue. ,
p.
120.
Danos, Vincent
Joinet, Jean-Baptiste
and
Schellinx, Harold
2003.
Computational isomorphisms in classical logic.
Theoretical Computer Science,
Vol. 294,
Issue. 3,
p.
353.
Andou, Y.
2003.
Church–Rosser property of a simple reduction for full first-order classical natural deduction.
Annals of Pure and Applied Logic,
Vol. 119,
Issue. 1-3,
p.
225.
Nakazawa, Koji
2003.
Confluency and strong normalizability of call-by-value λμ-calculus.
Theoretical Computer Science,
Vol. 290,
Issue. 1,
p.
429.
Ghilezan, Silvia
and
Lescanne, Pierre
2004.
Types for Proofs and Programs.
Vol. 3085,
Issue. ,
p.
226.
Yamagata, Yoriyuki
2004.
Strong normalization of the second-order symmetric λμ-calculus.
Information and Computation,
Vol. 193,
Issue. 1,
p.
1.
Dougherty, Dan
Ghilezan, Silvia
and
Lescanne, Pierre
2004.
Characterizing strong normalization in a language with control operators.
p.
155.
Matthes, Ralph
2005.
Non-strictly positive fixed points for classical natural deduction.
Annals of Pure and Applied Logic,
Vol. 133,
Issue. 1-3,
p.
205.
Hasegawa, M.
2005.
Relational Parametricity and Control.
p.
72.
Nour, Karim
and
Saber, Khelifa
2005.
A Semantics of Realisability for the Classical Propositional Natural Deduction.
Electronic Notes in Theoretical Computer Science,
Vol. 140,
Issue. ,
p.
31.
David, René
and
Nour, Karim
2005.
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric λμ-calculus.
Electronic Notes in Theoretical Computer Science,
Vol. 140,
Issue. ,
p.
101.