Retractions of Types with Many Atoms
Logic in Computer Science
2007-05-23 v1
Abstract
We define a sound and complete proof system for affine beta-eta-retractions in simple types built over many atoms, and we state simple necessary conditions for arbitrary beta-eta-retractions in simple and polymorphic types.
Cite
@article{arxiv.cs/0212005,
title = {Retractions of Types with Many Atoms},
author = {Laurent Regnier and Pawel Urzyczyn},
journal= {arXiv preprint arXiv:cs/0212005},
year = {2007}
}
Comments
First International Workshop on Isomorphisms of Types Toulouse, France, 8-9 november 2002