Union of Reducibility Candidates for Orthogonal Constructor Rewriting
نویسنده
چکیده
We revisit Girard’s reducibility candidates by proposing a general of the notion of neutral terms. They are the terms which do not interact with some contexts called elimination contexts. We apply this framework to constructor rewriting, and show that for orthogonal constructor rewriting, Girard’s reducibility candidates are stable by union.
منابع مشابه
Toward a General Rewriting-Based Framework for Reducibility
Reducibility is a powerful proof method which applies to various properties of typed terms in different type systems. For strong normalization, different variants are known, such as Girard’s reducibility candidates, Tait’s saturated sets and biorthogonals. They differ by the closure conditions imposed to types interpretations, called here reducibility families. This paper is about the computati...
متن کاملOn the Values of Reducibility Candidates
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly, the straightforward elimination of implicit existential types breaks subject reduction. We propose elimination rules for union types and implicit existential quantification which use a form call-by-value issued from...
متن کاملComputing Constructor Forms with Non Terminating Rewrite Programs - Extended version -
In the context of the study of rule-based programming, we focus in this paper on the property of C-reducibility, expressing that every term reduces to a constructor term on at least one of its rewriting derivations. This property implies completeness of function definitions, and enables to stop evaluations of a program on a constructor form, even if the program is not terminating. We propose an...
متن کاملOn weakly orthogonal constructor-based graph rewriting
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not connuent in general whereas it is connuent in the case of weakly orthogonal term rewriting systems. We show, however , that the considered relation is always connuent, as well as connuent modulo bisimilarity, for a large class of grap...
متن کاملClassical Fomega, orthogonality and symmetric candidates
We present a version of system Fω, called F C ω , in which the layer of type constructors is essentially the traditional one of Fω, whereas provability of types is classical. The proof-term calculus accounting for the classical reasoning is a variant of Barbanera and Berardi’s symmetric λ-calculus. We prove that the whole calculus is strongly normalising. For the layer of type constructors, we ...
متن کامل