#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2013

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ichiro Hasuo, Kenta Cho, Toshiki Kataoka, Bart Jacobs
- Electr. Notes Theor. Comput. Sci.
- 2013

<lb>Coinductive predicates express persisting “safety” specifications of transition systems. Previous<lb>observations by Hermida and Jacobs identify coinductive predicates as suitable final coalgebras<lb>in a fibration—a categorical abstraction of predicate logic. In this paper we follow the spirit of<lb>a seminal work by Worrell and study final sequences… (More)

- Kenta Cho, Bart Jacobs, Bas Westerbaan, Abraham Westerbaan
- ArXiv
- 2015

Effectus theory is a new branch of categorical logic that aims to capture the essentials of quantum logic, with probabilistic and Boolean logic as special cases. Predicates in effectus theory are not subobjects having a Heyting algebra structure, like in topos theory, but ‘characteristic’ functions, forming effect algebras. Such effect algebras are… (More)

- Kenta Cho, Bart Jacobs, Bas Westerbaan, Bram Westerbaan
- ArXiv
- 2015

Quotients and comprehension are fundamental mathematical constructions that can be described via adjunctions in categorical logic. This paper reveals that quotients and comprehension are related to measurement, not only in quantum logic, but also in probabilistic and classical logic. This relation is presented by a long series of examples, some of them… (More)

- Kenta Cho, Bart Jacobs
- ArXiv
- 2017

The notions of disintegration and Bayesian inversion are fundamental in conditional probability theory. They produce channels, as conditional probabilities, from a joint state, or from an already given channel (in opposite direction). These notions exist in the literature, in concrete situations, but are presented here in abstract graphical formulations.… (More)

- Kenta Cho, Abraham Westerbaan
- ArXiv
- 2016

We present a model of Selinger and Valiron’s quantum lambda calculus based on von Neumann algebras, and show that the model is adequate with respect to the operational semantics. 1998 ACM Subject Classification F.3.2 Semantics of Programming Language

- ‹
- 1
- ›