Lax Modal Lambda Calculi

2025-12-11

AI Summary

Diamond-containing intuitionistic modal logics (◇-IML) have long been regarded as unstable, hindering the development of their type-theoretic foundations relative to box-based (□) systems. Method: We focus on Lax logic—a well-behaved ◇-IML subsystem—and construct, for the first time, a family of sound and complete typed λ-calculi for it, integrating possible-worlds semantics, categorical semantics, and constructive proof theory. Contribution/Results: We establish three key metatheoretic results: normalization, equational completeness, and proof-theoretic independence; all are fully formalized in Agda. This work refutes the traditional view of ◇-IML as “pathological,” achieving for the first time a symmetric type-theoretic foundation for both □ and ◇ modalities. It advances modal type theory toward structural balance and practical applicability—particularly by providing a constructive logical basis for strong functors in functional programming.

Technology Category

Constraint Satisfaction and Optimization: Satisfiability Modulo TheoriesKnowledge Representation and Reasoning: Logic ProgrammingReasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

Semantics and Knowledge: Data modeling to support human-machine intelligence, including LLMs agents, intelligent system behavior, explanations, and user-friendly interactionsGraph Algorithms and Modeling for the Web: Foundation models and LLMs for Web-related graphsSystems and Infrastructure for Web, Mobile and WoT: Applied ML and AI for Web-based mobile applications

Abstract

Intuitionistic modal logics (IMLs) extend intuitionistic propositional logic with modalities such as the box and diamond connectives. Advances in the study of IMLs have inspired several applications in programming languages via the development of corresponding type theories with modalities. Until recently, IMLs with diamonds have been misunderstood as somewhat peculiar and unstable, causing the development of type theories with diamonds to lag behind type theories with boxes. In this article, we develop a family of typed-lambda calculi corresponding to sublogics of a peculiar IML with diamonds known as Lax logic. These calculi provide a modal logical foundation for various strong functors in typed-functional programming. We present possible-world and categorical semantics for these calculi and constructively prove normalization, equational completeness and proof-theoretic inadmissibility results. Our main results have been formalized using the proof assistant Agda.

Problem

• Develop lambda calculi for Lax logic with diamond modalities
• Provide modal foundations for strong functors in functional programming
• Establish semantics and prove normalization for these calculi

Innovation

• Develops typed lambda calculi for Lax logic
• Provides semantics and proves normalization constructively
• Formalizes results using Agda proof assistant