Skip to Main content Skip to Navigation
Reports

A Proof of Weak Termination of the Simply-Typed {$\lambda\sigma$}-Calculus

Abstract : We show that reducing any simply-typed $\lambda\sigma$-term by applying the rules in $\sigma$ eagerly always terminates, by a translation to the simply-typed $\lambda$-calculus, and similarly for $\lambda\sigma_\lift$-terms with $\sigma_\lift$-eager rewrites. This holds even with term and substitution meta-variables. In fact, every reduction terminates provided that $(\beta)$-redexes are only contracted under so-called safe contexts. The previous results follow because in $\sigma$, resp. $\sigma_{\lift}$-normal forms, all contexts around terms of sort $T$ are safe.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073601
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:17:40 PM
Last modification on : Friday, June 1, 2018 - 12:02:02 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:51:41 PM

Identifiers

  • HAL Id : inria-00073601, version 1

Collections

Citation

Jean Goubault-Larrecq. A Proof of Weak Termination of the Simply-Typed {$\lambda\sigma$}-Calculus. [Research Report] RR-3090, INRIA. 1997. ⟨inria-00073601⟩

Share

Metrics

Record views

157

Files downloads

148