Lax modal lambda calculi
From MaRDI portal
Cites work
- A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions
- A judgmental reconstruction of modal logic
- A modal analysis of staged computation
- A natural intuitionistic modal logic: axiomatization and bi-nested calculus
- Categorical and Kripke semantics for constructive S4 modal logic
- Computational types from a logical perspective
- Constructive modal logics. I
- Contextual modal type theory
- Dual-context calculi for modal logic
- Fitch-style modal lambda calculi
- From semantics to rules: a machine assisted analysis
- Guarded dependent type theory with coinductive types
- scientific article; zbMATH DE number 699435 (Why is no real title available?)
- scientific article; zbMATH DE number 7297837 (Why is no real title available?)
- Intuitionistic propositional logic with Galois connections
- Kripke-style models for typed lambda calculus
- Lambda definability with sums via Grothendieck logical relations
- Models for normal intuitionistic modal logics
- Notions of computation and monads
- On intuitionistic diamonds (and lack thereof)
- On modal logic with an intuitionistic base
- Propositional lax logic
- The Alf proof editor and its proof engine
- Two-dimensional Kripke semantics i: presheaves
- When programs have to watch paint dry
This page was built for publication: Lax modal lambda calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445708)