Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Cīrulis, Jānis
1999.
Mathematical Foundations of Computer Science 1999.
Vol. 1672,
Issue. ,
p.
299.
Lieutier, André
1999.
Discrete Geometry for Computer Imagery.
Vol. 1568,
Issue. ,
p.
349.
Abramsky, S.
and
Mellies, P.-A.
1999.
Concurrent games and full completeness.
p.
431.
Droste, Manfred
and
Kuske, Dietrich
1999.
Fundamentals of Computation Theory.
Vol. 1684,
Issue. ,
p.
246.
Bauer, Andrej
and
Birkedal, Lars
2000.
Computer Science Logic.
Vol. 1862,
Issue. ,
p.
202.
Dezani-Ciancaglini, M.
Honsell, F.
and
Motohama, Y.
2000.
Mathematical Foundations of Computer Science 2000.
Vol. 1893,
Issue. ,
p.
304.
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.
Zhang, Guo-Qiang
and
Rounds, William C.
2001.
Domains and Processes.
p.
151.
Altenkirch, T.
Dybjer, P.
Hofmann, M.
and
Scott, P.
2001.
Normalization by evaluation for typed lambda calculus with coproducts.
p.
303.
Kou, Hui
and
Luo, Maokang
2001.
Fixed points of Scott continuous self-maps.
Science in China Series A: Mathematics,
Vol. 44,
Issue. 11,
p.
1433.
Edalat, Abbas
and
Heckmann, Reinhold
2002.
Applied Semantics.
Vol. 2395,
Issue. ,
p.
193.
van Bakel, Steffen
and
Dezani-Ciancaglini, Mariangiola
2002.
LATIN 2002: Theoretical Informatics.
Vol. 2286,
Issue. ,
p.
356.
Curien, Pierre-Louis
2002.
Sur l'η-expansion infinie.
Comptes Rendus. Mathématique,
Vol. 334,
Issue. 1,
p.
77.
2002.
The Compiler Design Handbook.
p.
853.
Edalat, Abbas
and
Lieutier, André
2002.
Foundation of a computable solid modelling.
Theoretical Computer Science,
Vol. 284,
Issue. 2,
p.
319.
Dezani-Ciancaglini, Mariangiola
and
Ghilezan, Silvia
2003.
Types for Proofs and Programs.
Vol. 2646,
Issue. ,
p.
127.
Spreen, Dieter
and
Greb, Ralf
2003.
Domain Theory, Logic and Computation.
p.
179.
Curien, P.-L.
2003.
Symmetry and Interactivity in Programming.
Bulletin of Symbolic Logic,
Vol. 9,
Issue. 2,
p.
169.
Neergaard, Peter Møller
and
Mairson, Harry G.
2004.
Types, potency, and idempotency.
p.
138.
Ferreira, Ulisses
2004.
Metainformatics.
Vol. 3002,
Issue. ,
p.
46.