Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Anderson, S.O.
and
Power, A.J.
1997.
A representable approach to finite nondeterminism.
Theoretical Computer Science,
Vol. 177,
Issue. 1,
p.
3.
Gardner, Philippa
and
Hasegawa, Masahito
1997.
Theoretical Aspects of Computer Software.
Vol. 1281,
Issue. ,
p.
583.
Power, John
and
Thielecke, Hayo
1997.
Theoretical Aspects of Computer Software.
Vol. 1281,
Issue. ,
p.
391.
Hasegawa, Masahito
1997.
Typed Lambda Calculi and Applications.
Vol. 1210,
Issue. ,
p.
196.
Fiore, M.
and
Honda, K.
1998.
Recursive types in games: axiomatics and process representation.
p.
345.
Naumann, David A.
1998.
Mathematics of Program Construction.
Vol. 1422,
Issue. ,
p.
286.
Power, John
1998.
Computer Science Logic.
Vol. 1414,
Issue. ,
p.
389.
Barber, Andrew
Gardner, Philippa
Hasegawa, Masahito
and
Plotkin, Gordon
1998.
Computer Science Logic.
Vol. 1414,
Issue. ,
p.
78.
Power, John
and
Robinson, Edmund
1999.
Modularity and Dyads.
Electronic Notes in Theoretical Computer Science,
Vol. 20,
Issue. ,
p.
467.
Führmann, Carsten
1999.
Direct Models of the Computational Lambda-calculus.
Electronic Notes in Theoretical Computer Science,
Vol. 20,
Issue. ,
p.
245.
Bruni, Roberto
Gadducci, Fabio
and
Montanari, Ugo
1999.
Recent Trends in Algebraic Development Techniques.
Vol. 1589,
Issue. ,
p.
31.
Selinger, Peter
1999.
Categorical Structure of Asynchrony.
Electronic Notes in Theoretical Computer Science,
Vol. 20,
Issue. ,
p.
158.
Levy, Paul Blain
1999.
Typed Lambda Calculi and Applications.
Vol. 1581,
Issue. ,
p.
228.
Kinoshita, Yoshiki
and
Power, John
1999.
Computer Science Logic.
Vol. 1683,
Issue. ,
p.
562.
Fiore, Marcelo P.
2000.
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics.
Vol. 1872,
Issue. ,
p.
457.
Scott, P.J.
2000.
Vol. 2,
Issue. ,
p.
3.
Power, A.John
Cattani, Gian Luca
and
Winskel, Glynn
2000.
A representation result for free cocompletions.
Journal of Pure and Applied Algebra,
Vol. 151,
Issue. 3,
p.
273.
Wakeman, I.
Jeffrey, A.
and
Owen, T.
2000.
A language-based approach to programmable networks.
p.
128.
Power, John
and
Robinson, Edmund
2000.
Logical relations, data abstraction, and structured fibrations.
p.
15.
Power, John
2001.
Models for the computational λ-calculus.
Electronic Notes in Theoretical Computer Science,
Vol. 40,
Issue. ,
p.
288.