Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kurz, Alexander
and
Petrişan, Daniela
2010.
Presenting functors on many-sorted varieties and applications.
Information and Computation,
Vol. 208,
Issue. 12,
p.
1421.
Gabbay, Murdoch J.
Litak, Tadeusz
and
Petrişan, Daniela
2011.
Algebra and Coalgebra in Computer Science.
Vol. 6859,
Issue. ,
p.
192.
Gabbay, Murdoch J.
and
Mulligan, Dominic P.
2011.
Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets.
Electronic Proceedings in Theoretical Computer Science,
Vol. 71,
Issue. ,
p.
58.
VELEBIL, JIŘÍ
and
KURZ, ALEXANDER
2011.
Equational presentations of functors and monads.
Mathematical Structures in Computer Science,
Vol. 21,
Issue. 2,
p.
363.
Gabbay, Murdoch J.
2012.
Unity in nominal equational reasoning: The algebra of equality on nominal sets.
Journal of Applied Logic,
Vol. 10,
Issue. 2,
p.
199.
Gabbay, Murdoch J.
2014.
Handbook of Philosophical Logic.
p.
79.
Clouston, Ranald
2014.
Nominal Lawvere Theories: A category theoretic account of equational theories with names.
Journal of Computer and System Sciences,
Vol. 80,
Issue. 6,
p.
1067.
Ciancia, Vincenzo
2016.
History and Philosophy of Computing.
Vol. 487,
Issue. ,
p.
141.
Gabbay, Murdoch J.
and
Gabbay, Michael
2017.
Representation and duality of the untyped λ-calculus in nominal lattice and topological semantics, with a proof of topological completeness.
Annals of Pure and Applied Logic,
Vol. 168,
Issue. 3,
p.
501.
Milius, Stefan
and
Urbat, Henning
2019.
Foundations of Software Science and Computation Structures.
Vol. 11425,
Issue. ,
p.
400.
Razmara, N. S.
Haddadi, M.
and
Keshvardoost, Kh.
2024.
Fuzzy nominal sets.
Soft Computing,
Vol. 28,
Issue. 17-18,
p.
9191.