Search

• < Previous
• 1
• Next >

Non-idempotent types for classical calculi in natural deduction style

In the first part of this paper, we define two resource aware typing systems for the {\lambda}{\mu}-calculus based on non-idempotent intersection and union types. The non-idempotent approach provides very simple combinatorial arguments-based on decreasing measures of type derivations-to characterize&nbsp;[&hellip;]