A resource aware semantics for a focused intuitionistic calculus
We investigate a new computational interpretation for an intuitionistic focused sequent calculus which is compatible with a resource aware semantics. For that, we associate to Herbelin's syntax a type system based on non idempotent intersection types, together with a set of reduction rules inspired from the substitution at a distance paradigm that preserves (and decreases the size of) typing derivations. The non idempotent approach allows us to use very simple combinatorial arguments, only based on this measure decreasingness, to characterize linear head and strongly normalizing terms by means of typability. For the sake of completeness, we also study typability (and the corresponding strong normalization characterization) in the calculus obtained from the former one by projecting the explicit cuts.
Mathematical Structures in Computer Science