The Yoneda reduction of polymorphic types
From MaRDI portal
Cites work
- A short survey of isomorphisms of types
- Categorical data types in parametric polymorphism
- Deciding equivalence with sums and the empty type
- Functorial polymorphism
- Game semantics and uniqueness of type inhabitance in the simply-typed -calculus
- scientific article; zbMATH DE number 65746 (Why is no real title available?)
- scientific article; zbMATH DE number 512792 (Why is no real title available?)
- scientific article; zbMATH DE number 1373518 (Why is no real title available?)
- scientific article; zbMATH DE number 1385477 (Why is no real title available?)
- scientific article; zbMATH DE number 7204448 (Why is no real title available?)
- Infinitary proof theory: the multiplicative additive case
- On completeness and parametricity in the realizability semantics of System \textsf{F}
- On Compositionality of Dinatural Transformations
- On Long Normal Inhabitants of a Type
- On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi
- Polynomial functors and polynomial monads
- Proof nets, coends and the Yoneda isomorphism
- Remarks on isomorphisms in typed lambda calculi with empty and sum types
- Testing polymorphic properties
- The naturality of natural deduction
- The Recursion Scheme from the Cofree Recursive Comonad
- Uniqueness of normal proofs in implicational intuitionistic logic
- Which simple types have a unique inhabitant?
This page was built for publication: The Yoneda reduction of polymorphic types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839799)
