Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Fiore, Marcelo P.
and
Plotkin, Gordon D.
1997.
Computer Science Logic.
Vol. 1258,
Issue. ,
p.
129.
McCusker, Guy
1997.
Games and Definability For FPC.
Bulletin of Symbolic Logic,
Vol. 3,
Issue. 3,
p.
347.
Cattani, Gian Luca
and
Winskel, Glynn
1997.
Computer Science Logic.
Vol. 1258,
Issue. ,
p.
58.
Fiore, M.
Plotkin, G.
and
Power, J.
1997.
Complete cuboidal sets in axiomatic domain theory.
p.
268.
Bucalo, Anna
and
Rosolini, Giuseppe
1997.
Category Theory and Computer Science.
Vol. 1290,
Issue. ,
p.
281.
Marquis, Jean-Pierre
1998.
Book Review: Colin McLarty. Elementary Categories, Elementary Toposes..
Notre Dame Journal of Formal Logic,
Vol. 39,
Issue. 3,
Abramsky, Samson
and
McCusker, Guy
1998.
Computer Science Logic.
Vol. 1414,
Issue. ,
p.
1.
Simpson, Alex K.
1999.
Computer Science Logic.
Vol. 1584,
Issue. ,
p.
323.
Fiore, M.
Plotkin, G.
and
Turi, D.
1999.
Abstract syntax and variable binding.
p.
193.
Jacobs, Bart
and
Poll, Erik
2000.
Algebraic Methodology and Software Technology.
Vol. 1816,
Issue. ,
p.
150.
Simpson, A.
and
Plotkin, G.
2000.
Complete axioms for categorical fixed-point operators.
p.
30.
Fiore, Marcelo P.
and
Rosolini, Giuseppe
2001.
Domains in H.
Theoretical Computer Science,
Vol. 264,
Issue. 2,
p.
171.
Power, John
and
Watanabe, Hiroshi
2002.
Combining a monad and a comonad.
Theoretical Computer Science,
Vol. 280,
Issue. 1-2,
p.
137.
Hasegawa, Masahito
and
Kakutani, Yoshihiko
2002.
Axioms for Recursion in Call-by-Value.
Higher-Order and Symbolic Computation,
Vol. 15,
Issue. 2-3,
p.
235.
Simpson, A.
2002.
Computational adequacy for recursive types in models of intuitionistic set theory.
p.
287.
Fiore, M.P.
Moggi, E.
and
Sangiorgi, D.
2002.
A Fully Abstract Model for the π-calculus.
Information and Computation,
Vol. 179,
Issue. 1,
p.
76.
Glimming, Johan
and
Ghani, Neil
2005.
Difunctorial Semantics of Object Calculus.
Electronic Notes in Theoretical Computer Science,
Vol. 138,
Issue. 2,
p.
79.
Birkedal, Lars
Møgelberg, Rasmus E.
and
Petersen, Rasmus L.
2006.
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus.
Electronic Notes in Theoretical Computer Science,
Vol. 155,
Issue. ,
p.
191.
Møgelberg, Rasmus Ejlers
2006.
Automata, Languages and Programming.
Vol. 4052,
Issue. ,
p.
372.
Cattani, Gian Luca
and
Fiore, Marcelo P.
2007.
The Bicategory-Theoretic Solution of Recursive Domain Equations.
Electronic Notes in Theoretical Computer Science,
Vol. 172,
Issue. ,
p.
203.