Polymorphism and the free bicartesian closed category

07/08/2019
by   Paolo Pistone, et al.
0

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 the encoding of finite polynomial functors (generalizing the usual embedding of finite products and coproducts) and describes a class of well-behaved polymorphic terms: unlike those in full System F, the terms typable in this fragment can be interpreted as ordinary natural transformations and are equivalent, up to permutations, to terms typable using a strictly predicative type discipline. The second fragment is introduced to investigate the class of finite types, that is the types of System F which are isomorphic, modulo contextual equivalence, to a closed propositional type. The types of this fragment arise from a schema resembling the Yoneda isomorphism, and are shown to converge onto propositional types by a type rewriting approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2018

Cubical Assemblies and Independence of the Propositional Resizing Axiom

We construct a model of cubical type theory with a univalent and impredi...
research
03/18/2018

Cubical Assemblies and the Independence of the Propositional Resizing Axiom

We construct a model of cubical type theory with a univalent and impredi...
research
01/29/2023

Profinite lambda-terms and parametricity

Combining ideas coming from Stone duality and Reynolds parametricity, we...
research
11/15/2017

Statman's Hierarchy Theorem

In the Simply Typed λ-calculus Statman investigates the reducibility rel...
research
08/16/2018

Limits of bimorphic lenses

Bimorphic lenses are a simplification of polymorphic lenses that (like p...
research
10/04/2018

Commutative linear logic as a multiple context-free grammar

The formalism of multiple context-free grammars (MCFG) is a non-trivial ...
research
09/10/2017

Complete Classification of Generalized Santha-Vazirani Sources

Let F be a finite alphabet and D be a finite set of distributions over F...

Please sign up or login with your details

Forgot password? Click here to reset