Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Robin Cockett"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 4 (2021)
Categorical quantum mechanics exploits the dagger compact closed structure of finite dimensional Hilbert spaces, and uses the graphical calculus of string diagrams to facilitate reasoning about finite dimensional processes. A significant portion of q
Externí odkaz:
https://doaj.org/article/34de9e4345f4447f98ad60df4d4ea699
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 266, Iss Proc. QPL 2017, Pp 258-293 (2018)
We exhibit a complete set of identities for CNOT, the symmetric monoidal category generated by the controlled-not gate, the swap gate, and the computational ancillæ. We prove that CNOT is a discrete inverse category. Moreover, we prove that CNOT is
Externí odkaz:
https://doaj.org/article/9ae3f4e1666d4e3a9aa76d8241a9b04b
Publikováno v:
QPL
Electronic Proceedings in Theoretical Computer Science, Vol 266, Iss Proc. QPL 2017, Pp 258-293 (2018)
Electronic Proceedings in Theoretical Computer Science, Vol 266, Iss Proc. QPL 2017, Pp 258-293 (2018)
We exhibit a complete set of identities for CNOT, the symmetric monoidal category generated by the controlled-not gate, the swap gate, and the computational ancillae. We prove that CNOT is a discrete inverse category. Moreover, we prove that CNOT is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44e2c16089258a7e40007f1b8e447416
https://doi.org/10.4204/eptcs.266.18
https://doi.org/10.4204/eptcs.266.18
Publikováno v:
MFPS
We consider Ribenboim's construction of rings of generalized power series. Ribenboim's construction makes use of a special class of partially ordered monoids and a special class of their subsets. While the restrictions he imposes might seem conceptua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08c27032967d50882d3408ecf55eb933
Publikováno v:
Theoretical Computer Science. 515:19-45
The objective of this paper is to prove that the initial Pola setting, with both inductive and coinductive data, is sound for polynomial size (PSIZE). Explicitly this means all programs written in Pola have their output size bounded by a polynomial i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9732e2ec20457bb22ea119e1c350307e
https://doi.org/10.1016/j.tcs.2013.09.034
https://doi.org/10.1016/j.tcs.2013.09.034
Publikováno v:
MFPS
The construction of various categories of “timed sets” is described in which the timing of maps is considered modulo a “complexity order”. The properties of these categories are developed: under appropriate conditions they form discrete, dist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a58932f5a6dac052b1a41ce247ef6993
Autor:
Robin Cockett, Pieter Hofstra
Publikováno v:
MFPS
This paper explores the fine structure of classifying categories of partial equational theories. The central concept is that of unitary category, and results about those are applied to the problem of completing partial algebras to total ones. We also
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b4427ec1bb91bb289bb91598877630b
Autor:
Robin Cockett, Brian F. Redmond
Publikováno v:
MFPS
A polarized strong category consists of a cartesian category, X, and a category Y, together with a module M:X×Y→Y equipped with a strong composition and identities. These categories can be used to provide an abstract setting for investigating comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::580cf060f3eee626f4deb13b69b59b75
Autor:
Robin Cockett, Ernie Manes
Publikováno v:
Mathematical Structures in Computer Science. 19:357-416
A restriction category is an abstract category of partial maps. A Boolean restriction category is a restriction category that supports classical (Boolean) reasoning. Such categories are models of loop-free dynamic logic that is deterministic in the s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea2411ec5a770b75cffb8dcfd95846e5
https://doi.org/10.1017/s0960129509007543
https://doi.org/10.1017/s0960129509007543
Autor:
Stephen Lack, Robin Cockett
Publikováno v:
Mathematical Structures in Computer Science. 17:775-817
A restriction category is an abstract formulation for a category of partial maps, defined in terms of certain specified idempotents called the restriction idempotents. All categories of partial maps are restriction categories; conversely, a restricti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce9d0cfd118e3f0499abeb32ffa22cf4
https://doi.org/10.1017/s0960129507006056
https://doi.org/10.1017/s0960129507006056