Proof nets and the instantiation overflow property

03/25/2018
by   Paolo Pistone, et al.
0

Instantiation overflow is the property of those second order types for which all instances of full comprehension can be deduced from instances of atomic comprehension. In other words, a type has instantiation overflow when one can type, by atomic polymorphism, "expansion terms" which realize instances of the full extraction rule applied to that type. This property was investigated in the case of the types arising from the well-known Russell-Prawitz translation of logical connectives into System F, but is not restricted to such types. Moreover, it can be related to functorial polymorphism, a well-known categorial approach to parametricity in System F. In this paper we investigate the instantiation overflow property by exploiting the representation of derivations by means of linear logic proof nets. We develop a geometric approach to instantiation overflow yielding a deeper understanding of the structure of expansion terms and Russell-Prawitz types. Our main result is a characterization of the class of types of the form ∀ XA, where A is a simple type, which enjoy the instantiation overflow property, by means of a generalization of Russell-Prawitz types.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2019

The naturality of natural deduction (II). Some remarks on atomic polymorphism

In this paper (which is a prosecution of "The naturality of natural dedu...
research
04/28/2021

Typability and Type Inference in Atomic Polymorphism

It is well-known that typability, type inhabitation and type inference a...
research
05/03/2021

What's Decidable about (Atomic) Polymorphism

Due to the undecidability of most type-related properties of System F li...
research
02/20/2002

The logical meaning of Expansion

The Expansion property considered by researchers in Social Choice is sho...
research
06/24/2019

Transitivity of Subtyping for Intersection Types

The subtyping relation for intersection type systems traditionally emplo...
research
06/20/2018

Schematic Polymorphism in the Abella Proof Assistant

The Abella interactive theorem prover has proven to be an effective vehi...
research
03/12/2013

Towards Automated Proof Strategy Generalisation

The ability to automatically generalise (interactive) proofs and use suc...

Please sign up or login with your details

Forgot password? Click here to reset