Termination in impure lambda-calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Termination in impure lambda-calculus

Abstract

We present a method for ensuring termination of lambda- calculi with references. This method makes it possible to combine measure- based techniques for termination of imperative languages with traditional approaches to termination in purely functional languages, such as logical relations. More precisely, the method lifts any termination proof for the purely functional simply-typed lambda-calculus to a termination proof for the lambda-calculus with references. The method can be made para- metric on the termination technique employed for the functional core.
No file

Dates and versions

hal-00909392 , version 1 (26-11-2013)

Identifiers

  • HAL Id : hal-00909392 , version 1

Cite

Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. Termination in impure lambda-calculus. Fundamentals of Software Engineering, 2012, Unknown, Afghanistan. pp.128--142. ⟨hal-00909392⟩
207 View
0 Download

Share

Gmail Facebook X LinkedIn More