Search

• < Previous
• 1
• Next >

---

Observationally-induced algebras in Domain Theory

Ingo Battenfeld ; Klaus Keimel ; Thomas Streicher.

In this paper we revise and simplify the notion of observationally induced algebra introduced by Simpson and Schroeder for the purpose of modelling computational effects in the particular case where the ambient category is given by classical domain theory. As examples of the general framework we&nbsp;[&hellip;]

---

A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus

Thomas Streicher.

We study a classical realizability model (in the sense of J.-L. Krivine) arising from a model of untyped lambda calculus in coherence spaces. We show that this model validates countable choice using bar recursion and bar induction.

---

Computability in Basic Quantum Mechanics

Eike Neumann ; Martin Pape ; Thomas Streicher.

The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and observable can be formulated as kinds of measures as in&nbsp;[&hellip;]

---