Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Crole, Roy L.
1994.
Computational adequacy of the FIX-logic.
Theoretical Computer Science,
Vol. 136,
Issue. 1,
p.
217.
Crole, Roy L.
and
Gordon, Andrew D.
1995.
Computer Science Logic.
Vol. 933,
Issue. ,
p.
339.
Gay, S.
and
Nagarajan, R.
1995.
A typed calculus of synchronous processes.
p.
210.
Fiadeiro, J. L.
and
Costa, J. F.
1995.
Recent Trends in Data Type Specification.
Vol. 906,
Issue. ,
p.
273.
Abramsky, Samson
Gay, Simon
and
Nagarajan, Rajagopal
1996.
Deductive Program Design.
p.
35.
Abramsky, Samson
and
McCusker, Guy
1996.
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions.
Electronic Notes in Theoretical Computer Science,
Vol. 3,
Issue. ,
p.
2.
Abramsky, Samson
Gay, Simon
and
Nagarajan, Rajagopal
1996.
Logics for Concurrency.
Vol. 1043,
Issue. ,
p.
5.
Berger, Ulrich
Eberl, Matthias
and
Schwichtenberg, Helmut
1998.
Prospects for Hardware Foundations.
Vol. 1546,
Issue. ,
p.
117.
Lipton, James
and
McGrail, Robert
1998.
Principles of Declarative Programming.
Vol. 1490,
Issue. ,
p.
391.
König, Barbara
1999.
CONCUR’99 Concurrency Theory.
Vol. 1664,
Issue. ,
p.
354.
Reddy, Uday S.
1999.
Wiley Encyclopedia of Electrical and Electronics Engineering.
Abramsky, Samson
and
Lenisa, Marina
2000.
Mathematical Foundations of Computer Science 2000.
Vol. 1893,
Issue. ,
p.
141.
Abramsky, Samson
and
Lenisa, Marina
2000.
Computer Science Logic.
Vol. 1862,
Issue. ,
p.
140.
Schröder, Lutz
2001.
Computer Science Logic.
Vol. 2142,
Issue. ,
p.
429.
Fiore, Marcelo
2002.
Semantic analysis of normalisation by evaluation for typed lambda calculus.
p.
26.
Gibbons, Jeremy
2002.
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction.
Vol. 2297,
Issue. ,
p.
151.
Stell, John G.
2002.
Algebraic Methodology and Software Technology.
Vol. 2422,
Issue. ,
p.
396.
Fiore, M.
Di Cosmo, R.
and
Balat, V.
2002.
Remarks on isomorphisms in typed lambda calculi with empty and sum types.
p.
147.
Abramsky, Samson
and
Lenisa, Marina
2005.
Linear realizability and full completeness for typed lambda-calculi.
Annals of Pure and Applied Logic,
Vol. 134,
Issue. 2-3,
p.
122.
Healy, Michael John
and
Caudell, Thomas Preston
2006.
Ontologies and Worlds in Category Theory: Implications for Neural Systems.
Axiomathes,
Vol. 16,
Issue. 1-2,
p.
165.