3 papers
cs.LO2021
What's Decidable about (Atomic) Polymorphism
Paolo Pistone, Luca Tranchini
Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the mos…
math.LO2019
The naturality of natural deduction (II). Some remarks on atomic polymorphism
Paolo Pistone, Luca Tranchini, Mattia Petrolo
In a previous paper (of which this is a prosecution) we investigated the extraction of proof-theoretic properties of natural deduction derivations from their impredicative translat…
cs.LO2019
The Yoneda Reduction of Polymorphic Types (Extended Version)
Paolo Pistone, Luca Tranchini
In this paper we explore a family of type isomorphisms in System F whose validity corresponds, semantically, to some form of the Yoneda isomorphism from category theory. These isom…