Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Nakazawa, Koji
2003.
Confluency and strong normalizability of call-by-value λμ-calculus.
Theoretical Computer Science,
Vol. 290,
Issue. 1,
p.
429.
Laurent, Olivier
2003.
Polarized proof-nets and λμ-calculus.
Theoretical Computer Science,
Vol. 290,
Issue. 1,
p.
161.
Saurin, A.
2005.
Separation with Streams in the ?µ-calculus.
p.
356.
Lassen, S.B.
2006.
Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus.
p.
297.
Støvring, Kristian
and
Lassen, Soren B.
2007.
A complete, co-inductive syntactic theory of sequential control and state.
ACM SIGPLAN Notices,
Vol. 42,
Issue. 1,
p.
161.
Støvring, Kristian
and
Lassen, Soren B.
2007.
A complete, co-inductive syntactic theory of sequential control and state.
p.
161.
PAGANI, MICHELE
2007.
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic.
Mathematical Structures in Computer Science,
Vol. 17,
Issue. 2,
p.
341.
Vaux, Lionel
2007.
The differential λμ-calculus.
Theoretical Computer Science,
Vol. 379,
Issue. 1-2,
p.
166.
Mazza, Damiano
and
Pagani, Michele
2007.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 4790,
Issue. ,
p.
393.
Herbelin, Hugo
and
Ghilezan, Silvia
2008.
An approach to call-by-name delimited continuations.
p.
383.
Saurin, Alexis
2008.
Computer Science Logic.
Vol. 5213,
Issue. ,
p.
154.
Herbelin, Hugo
and
Ghilezan, Silvia
2008.
An approach to call-by-name delimited continuations.
ACM SIGPLAN Notices,
Vol. 43,
Issue. 1,
p.
383.
Ariola, Zena M.
Herbelin, Hugo
and
Sabry, Amr
2009.
A type-theoretic foundation of delimited continuations.
Higher-Order and Symbolic Computation,
Vol. 22,
Issue. 3,
p.
233.
Herbelin, Hugo
and
Zimmermann, Stéphane
2009.
Typed Lambda Calculi and Applications.
Vol. 5608,
Issue. ,
p.
142.
Støvring, Kristian
and
Lassen, Soren B.
2009.
Semantics and Algebraic Specification.
Vol. 5700,
Issue. ,
p.
329.
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.
Saurin, Alexis
2010.
Functional and Logic Programming.
Vol. 6009,
Issue. ,
p.
134.
Ariola, Zena M.
Herbelin, Hugo
and
Saurin, Alexis
2011.
Typed Lambda Calculi and Applications.
Vol. 6690,
Issue. ,
p.
27.
Biernacki, Dariusz
and
Lenglet, Sergueï
2012.
Foundations of Software Science and Computational Structures.
Vol. 7213,
Issue. ,
p.
119.