Canonicity in Modal Lambda Calculus

04/11/2023
by   Matteo Acclavio, et al.
0

In this paper we investigate the Curry-Howard-Lambek correspondence for constructive modal logic in light of the gap between the proof equivalences enforced by the lambda calculi from the literature and by the recently defined winning strategies for this logic. We define a new lambda-calculus for a minimal constructive modal logic by enriching the calculus from the literature with additional reduction rules. After proving normalization results for our calculus, we provide a typing system in the style of focused proof systems for the terms in normal forms. We conclude by showing the one-to-one correspondence between those terms and winning innocent strategies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2022

Universal Proof Theory: Feasible Admissibility in Intuitionistic Modal Logics

In this paper, we introduce a general family of sequent-style calculi ov...
research
09/12/2018

A Curry-Howard Correspondence for the Minimal Fragment of Łukasiewicz Logic

In this paper we introduce a term calculus B which adds to the affine λ...
research
02/09/2023

Strategies as Resource Terms, and their Categorical Semantics

As shown by Tsukada and Ong, normal (extensional) simply-typed resource ...
research
07/26/2022

Extensible Proof Systems for Infinite-State Systems

This paper revisits soundness and completeness of proof systems for prov...
research
07/26/2022

Normalization for Fitch-Style Modal Calculi

Fitch-style modal lambda calculi enable programming with necessity modal...
research
03/18/2019

A constructive proof of dependent choice in classical arithmetic via memoization

In a recent paper, Herbelin developed dPA^ω, a calculus in which constru...
research
10/31/2017

Proving Soundness of Extensional Normal-Form Bisimilarities

Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence...

Please sign up or login with your details

Forgot password? Click here to reset