Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Winskel, Glynn
1994.
Mathematical Foundations of Computer Science 1994.
Vol. 841,
Issue. ,
p.
177.
Colson, L.
and
Ehrhard, T.
1994.
On strong stability and higher-order sequentiality.
p.
103.
Lamarche, François
1995.
Generalizing Coherence Spaces and Hypercoherences.
Electronic Notes in Theoretical Computer Science,
Vol. 1,
Issue. ,
p.
355.
Ehrhard, Thomas
1996.
Projecting sequential algorithms on strongly stable functions.
Annals of Pure and Applied Logic,
Vol. 77,
Issue. 3,
p.
201.
Hu, Hongde
and
Joyal, André
1997.
Coherence Completions of Categories and Their Enriched Softness.
Electronic Notes in Theoretical Computer Science,
Vol. 6,
Issue. ,
p.
174.
Birkedal, L.
Carboni, A.
Rosolini, G.
and
Scott, D.S.
1998.
Type theory via exact categories.
p.
188.
de Paiva, Valeria
and
Schalk, Andrea
1998.
Algebraic Methodology and Software Technology.
Vol. 1548,
Issue. ,
p.
164.
Ehrhard, Thomas
1999.
A Relative PCF-Definability Result for Strongly Stable Functions and some Corollaries.
Information and Computation,
Vol. 152,
Issue. 1,
p.
111.
Ehrhard, Thomas
2000.
A relative PCF-definability result for strongly stable functions and some corollaries (Extended abstract)
.
Electronic Notes in Theoretical Computer Science,
Vol. 35,
Issue. ,
p.
64.
Ehrhard, Thomas
2000.
Parallel and serial hypercoherences.
Theoretical Computer Science,
Vol. 247,
Issue. 1-2,
p.
39.
Bucciarelli, Antonio
and
Ehrhard, Thomas
2000.
On phase semantics and denotational semantics in multiplicative–additive linear logic.
Annals of Pure and Applied Logic,
Vol. 102,
Issue. 3,
p.
247.
Salibra, A.
2001.
A continuum of theories of lambda calculus without semantics.
p.
334.
Salibra, Antonino
2001.
Towards Lambda Calculus Order-Incompleteness.
Electronic Notes in Theoretical Computer Science,
Vol. 50,
Issue. 2,
p.
145.
Longley, John
2002.
The sequentially realizable functionals.
Annals of Pure and Applied Logic,
Vol. 117,
Issue. 1-3,
p.
1.
Hyland, M.
and
Schalk, A.
2002.
Games on graphs and sequentially realizable functionals. Extended abstract.
p.
257.
Salibra, Antonino
2003.
Topological incompleteness and order incompleteness of the lambda calculus.
ACM Transactions on Computational Logic,
Vol. 4,
Issue. 3,
p.
379.
Boudes, Pierre
2003.
Non-Uniform Hypercoherences.
Electronic Notes in Theoretical Computer Science,
Vol. 69,
Issue. ,
p.
62.
Hughes, Dominic
2003.
Intensional Double Glueing, Biextensional Collapse, and the Chu Construction.
Electronic Notes in Theoretical Computer Science,
Vol. 83,
Issue. ,
p.
131.
Melliès, Paul-André
2004.
Comparing hierarchies of types in models of linear logic.
Information and Computation,
Vol. 189,
Issue. 2,
p.
202.
Hamano, Masahiro
2004.
Softness of MALL proof-structures and a correctness criterion with Mix.
Archive for Mathematical Logic,
Vol. 43,
Issue. 6,
p.
751.