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 parametric on the termination technique employed for the functional core
Strong Normalisation in λ-Calculi with References / Romain Demangeon;Daniel Hirschkoff;Davide Sangiorgi. - STAMPA. - 7141:(2012), pp. 128-142. (Intervento presentato al convegno 4th IPM International Conference, FSEN 2011 tenutosi a Tehran, Iran nel April 20-22, 2011) [10.1007/978-3-642-29320-7_9].
Strong Normalisation in λ-Calculi with References
SANGIORGI, DAVIDE
2012
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 parametric on the termination technique employed for the functional coreI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
