论文信息 - Typed lambda-calculi with explicit substitutions may not terminate - 字舞流文

Typed lambda-calculi with explicit substitutions may not terminate

We present a simply typed λ-term whose computation in the λσ-calculus does not always terminate.

Paul-André Melliès

[1] Martín Abadi,et al. Explicit substitutions , 1989, POPL '90.

[2] Thérèse Hardin,et al. Proof of termination of the rewriting system subst on CCL , 1986, Theor. Comput. Sci..

[3] Hans Zantema,et al. Termination of Term Rewriting by Interpretation , 1992, CTRS.

[4] Alejandro Ríos,et al. Strong Normalization of Substitutions , 1992, MFCS.

[5] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .