Abstract
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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Riba, C. (2008). Union of reducibility candidates for orthogonal constructor rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5028 LNCS, pp. 498–510). https://doi.org/10.1007/978-3-540-69407-6_54
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
