Corpus ID: 44150322

# The encodability hierarchy for PCF types

@article{Longley2018TheEH,
title={The encodability hierarchy for PCF types},
author={J. Longley},
journal={ArXiv},
year={2018},
volume={abs/1806.00344}
}
• J. Longley
• Published 2018
• Computer Science, Mathematics
• ArXiv
Working with the simple types over a base type of natural numbers (including product types), we consider the question of when a type $\sigma$ is encodable as a definable retract of $\tau$: that is, when there are $\lambda$-terms $e:\sigma\rightarrow\tau$ and $d:\tau\rightarrow\sigma$ with $d \circ e = id$. In general, the answer to this question may vary according to both the choice of $\lambda$-calculus and the notion of equality considered; however, we shall show that the encodability… Expand

#### References

SHOWING 1-10 OF 12 REFERENCES
Remarks on isomorphisms in typed lambda calculi with empty and sum types
• Mathematics, Computer Science
• Proceedings 17th Annual IEEE Symposium on Logic in Computer Science
• 2002
• 59
• PDF
Isomorphisms of Types in the Presence of Higher-Order References
• P. Clairambault
• Mathematics, Computer Science
• 2011 IEEE 26th Annual Symposium on Logic in Computer Science
• 2011
• 5
• PDF
Higher-Order Computability
• Computer Science
• Theory and Applications of Computability
• 2015
• 78
The recursion hierarchy for PCF is strict
• J. Longley
• Computer Science, Mathematics
• Log. Methods Comput. Sci.
• 2018
• 6
• PDF
On the Building of Affine Retractions
• 5
Retracts in Simple Types
• 10
Retractions of Types with Many Atoms
• Computer Science, Mathematics
• ArXiv
• 2002
• 9
• PDF