DeepAI AI Chat
Log In Sign Up

Normalization for Fitch-Style Modal Calculi

by   Nachiappan Valliappan, et al.

Fitch-style modal lambda calculi enable programming with necessity modalities in a typed lambda calculus by extending the typing context with a delimiting operator that is denoted by a lock. The addition of locks simplifies the formulation of typing rules for calculi that incorporate different modal axioms, but each variant demands different, tedious and seemingly ad hoc syntactic lemmas to prove normalization. In this work, we take a semantic approach to normalization, called normalization by evaluation (NbE), by leveraging the possible-world semantics of Fitch-style calculi to yield a more modular approach to normalization. We show that NbE models can be constructed for calculi that incorporate the K, T and 4 axioms of modal logic, as suitable instantiations of the possible-world semantics. In addition to existing results that handle beta-equivalence, our normalization result also considers eta-equivalence for these calculi. Our key results have been mechanized in the proof assistant Agda. Finally, we showcase several consequences of normalization for proving meta-theoretic properties of Fitch-style calculi as well as programming-language applications based on different interpretations of the necessity modality.


page 1

page 2

page 3

page 4


Fitch-Style Modal Lambda Calculi

Fitch-style modal deduction, in which modalities are eliminated by openi...

A Categorical Normalization Proof for the Modal Lambda-Calculus

We investigate a simply typed modal λ-calculus, λ^→□, due to Pfenning, W...

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version)

In each variant of the lambda-calculus, factorization and normalization ...

An Investigation of Kripke-style Modal Type Theories

This technical report investigates Kripke-style modal type theories, bot...

A Henkin-style completeness proof for the modal logic S5

This paper presents a recent formalization of a Henkin-style completenes...

Modality via Iterated Enrichment

This paper investigates modal type theories by using a new categorical s...

Universal Proof Theory: Feasible Admissibility in Intuitionistic Modal Logics

In this paper, we introduce a general family of sequent-style calculi ov...