文章基本信息

标题：Type Preservation as a Confluence Problem
本地全文：下载
作者：Aaron Stump ; Garrin Kimmell ; Roba El Haj Omar 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2011
卷号：10
页码：345-360
DOI：10.4230/LIPIcs.RTA.2011.345
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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 and abstract operational semantics, viewed as abstract reduction systems (ARSs). In this paper, we build on the work of Kuan et al. by showing show how modern ARS theory, in particular the theory of decreasing diagrams, can be used to establish type preservation via confluence. We illustrate this idea through several examples of solving such problems using decreasing diagrams. We also consider how automated tools for analysis of term-rewriting systems can be applied in testing type
关键词：Term rewriting; Type Safety; Confluence