2014-05-14: Guillaume Allais (MSP)

Tue, 14 Oct 2025 16:51:42 +0000

Guillaume Allais (MSP)

Resource aware contexts and proof search for IMLL

Abstract

In Intuitionistic Multiplicative Linear Logic, the right introduction rule for tensors implies picking a 2-partition of the set of assumptions and use each component to inhabit the corresponding tensor's subformulas. This makes a naive proof search algorithm intractable. Building a notion of resource availability in the context and massaging the calculus into a more general one handling both resource consumption and a notion of "leftovers" of a subproof allows for a well-structured well-typed by construction proof search mechanism.

Here is an Agda file implementing the proof search algorithm.

2014-05-14 11:00:00 UTC
LT1310