Abstract
When enriching the lambda-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (orE) of union types may also allow to type non normalizing terms (in which case we say that (orE) is unsafe). This occurs in particular with non-determinism, but also with some confluent systems. It appears that studying the safety of (orE) amounts to the characterization, in a term, of safe interactions between some of its subterms. In this paper, we study the safety of (orE) for an extension of the lambda-calculus with simple rewrite rules. We prove that the union and intersection type discipline without (orE) is complete w.r.t. strong normalization. This allows to show that (orE) is safe if and only if an interpretation of types based on biorthogonals is sound for it. We also discuss two sufficient conditions for the safety of (orE), and study an alternative biorthogonality relation, based on the observation of the least reducibility candidate.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
