Search

• < Previous
• 1
• Next >

---

Constructive Domains with Classical Witnesses

Dirk Pattinson ; Mina Mohammadian.

We develop a constructive theory of continuous domains from the perspective of program extraction. Our goal that programs represent (provably correct) computation without witnesses of correctness is achieved by formulating correctness assertions classically. Technically, we start from a predomain&nbsp;[&hellip;]

---

Modal meet-implication logic

Jim de Groot ; Dirk Pattinson.

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we obtain completeness and identify a common (modal) fragment of a&nbsp;[&hellip;]

---