7 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.PL2023
Enriched Presheaf Model of Quantum FPC
Takeshi Tsukada, Kazuyuki Asada
Selinger gave a superoperator model of a first-order quantum programming language and proved that it is fully definable and hence fully abstract. This paper proposes an extension o…
cs.PL2014★ 7 cited
Innocent Strategies are Sheaves over Plays---Deterministic, Non-deterministic and Probabilistic Innocence
Takeshi Tsukada, C. -H. Luke Ong
Although the HO/N games are fully abstract for PCF, the traditional notion of innocence (which underpins these games) is not satisfactory for such language features as non-determin…