The following pages link to Monad as modality (Q1392142):
Displaying 14 items.
- Abstract categorical semantics for resourceful functional reactive programming (Q338619) (← links)
- Cut-free Gentzen calculus for multimodal CK (Q764259) (← links)
- Constructive linear-time temporal logic: proof systems and Kripke semantics (Q764262) (← links)
- Reduction rules for intuitionistic \(\lambda\rho\)-calculus (Q897480) (← links)
- Lewis meets Brouwer: constructive strict implication (Q1688950) (← links)
- Fibrational modal type theory (Q1744413) (← links)
- Dual and axiomatic systems for constructive S4, a formally verified equivalence (Q2219076) (← links)
- Connectionist computations of intuitionistic reasoning (Q2503271) (← links)
- A general method for proving decidability of intuitionistic modal logics (Q2506825) (← links)
- Domain-Free<i>λµ</i>-Calculus (Q2729625) (← links)
- Game Semantics for Access Control (Q2805155) (← links)
- Towards a Common Categorical Semantics for Linear-Time Temporal Logic and Functional Reactive Programming (Q3178285) (← links)
- Axiomatic and dual systems for constructive necessity, a formally verified equivalence (Q5231279) (← links)
- A dual-context sequent calculus for the constructive modal logic S4 (Q5889308) (← links)
