• Corpus ID: 201670396

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

@article{Pistone2019TheNO,
  title={The naturality of natural deduction (II). Some remarks on atomic polymorphism},
  author={Paolo Pistone and Luca Tranchini and Mattia Petrolo},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.11353}
}
In this paper (which is a prosecution of "The naturality of natural deduction", Studia Logica 2019) we investigate the exact relationship between the Russell-Prawitz translation of intuitionistic propositional logic into intuitionistc second-order propositional logic (System F), and its variant proposed by Fernando Ferreira and Gilda Ferreira into the atomic fragment of System F (System Fat). In the previous paper we investigated the Russell-Prawitz translation via an extended equational theory… 

Tables from this paper

The Yoneda Reduction of Polymorphic Types (Abstract)
TLDR
It is shown that the Yoneda type isomorphisms in System F yield a rewriting over types that can be used to eliminate quantifiers from a polymorphic type, replacing them with a combination of monomorphic type constructors.
The Yoneda Reduction of Polymorphic Types
TLDR
A family of type isomorphisms in System F whose validity corresponds, semantically, to some form of the Yoneda isomorphism from category theory, which can be used to eliminate quantifiers from a polymorphic type, replacing them with a combination of monomorphic type constructors.
Intensional harmony as isomorphism
In the present paper we discuss a recent suggestion of Schroeder-Heister concerning the possibility of defining an intensional notion of harmony using isomorphism in second-order propositional logic.
The Russell-Prawitz embedding and the atomization of universal instantiation
TLDR
These new atomization conversions help achieving strict simulation of proof reduction by means of the Russell–Prawitz embedding of $\textbf{IPC}$ into system $\mathbf{F}$, but are not stronger than a certain ‘dinaturality’ conversion known to generate a consistent equality of proofs.
Proving properties of polymorphic programs using type isomorphisms with the Yoneda lemma.
We study a class of type isomorphisms arising from a well-known correspondence between the Yoneda lemma of category theory and the polymorphic lambda-calculus. We demonstrate that such isomorphisms
L O ] 3 M ay 2 02 1 What ’ s Decidable about ( Atomic ) Polymorphism ? ( Extended Version )
  • 2021
Typability and Type Inference in Atomic Polymorphism
TLDR
This paper analyze typability and type inference in Curry style variants of system F and shows that typability is decidable and that there is an algorithm for type inference which is capable of dealing with non-redundancy constraints.
What's Decidable about (Atomic) Polymorphism
TLDR
This paper investigates System Fat, a very weak predicative fragment of System F whose typable terms coincide with the simply typable ones, and shows that the type-checking problem for Fat is decidable and an algorithm is proposed which sheds some new light on the source of undecidability in full System F.

References

SHOWING 1-10 OF 38 REFERENCES
The Naturality of Natural Deduction
TLDR
It is shown that the Russell–Prawitz translation does preserve identity of proof with respect to the enriched system by highlighting the fact that naturality corresponds to a generalized permutation principle.
A Refined Interpretation of Intuitionistic Logic by Means of Atomic Polymorphism
We study an alternative embedding of IPC into atomic system F whose translation of proofs is based, not on instantiation overflow, but instead on the admissibility of the elimination rules for
A Natural Extension of Natural Deduction
TLDR
One of the main ideas of calculi of natural deduction, as introduced by Jaśkowski and Gentzen, is that assumptions may be discharged in the course of a derivation as well as not only formulas but also rules may serve as assumptions which can be discharged.
Identity of Proofs Based on Normalization and Generality
Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to
Proof-theoretic harmony: towards an intensional account
In this paper we argue that an account of proof-theoretic harmony based on reductions and expansions delivers an inferentialist picture of meaning which should be regarded as intensional, as opposed
Atomic polymorphism
TLDR
A novel and perspicuous proof of the strong normalization property for the full intuitionistic propositional calculus is obtained and it is noticed that this novel proof bestows a crucial role to η-conversions.
Stabilizing Quantum Disjunction
TLDR
A case is discussed showing that this requirement of existence of expansions can indeed detect instabilities of this kind, and it is shown how the expansions for disjunction-like connectives have to be reformulated to rule out quantum disJunction.
The intuitionistic propositional calculus with quantifiers
Let L be the language of the intuitionistic propositional calculus J completed by the quantifiers ∀ and ∃, and let calculus 2J in language L contain, besides the axioms of J, the axioms ∀xB (x) ⊃
Polymorphism and the free bicartesian closed category
We study two decidable fragments of System F, the polynomial and the Yoneda fragment, inducing two representations of the free bicartesian closed category. The first fragment is freely generated by
...
1
2
3
4
...