Type Preservation as a Confluence Problem

Aaron Stump, Garrin Kimmell & Roba El Haj Omar
This paper begins with recent work by Kuan, MacQueen, and Findler, which shows how standard type systems, such as the simply typed lambda calculus, can be viewed as abstract reduction systems operating on terms. The central idea is to think of the process of typing a term as the computation of an abstract value for that term. The standard metatheoretic property of type preservation can then be seen as a confluence problem involving the concrete...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.