Strong normalisation in λ-calculi with references

Authors:
Romain Demangeon;Daniel Hirschkoff;Davide Sangiorgi
Affiliations:
ENS Lyon, Université de Lyon, CNRS, INRIA, France;ENS Lyon, Université de Lyon, CNRS, INRIA, France;INRIA/Università di Bologna, Italy
Venue:
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Year:
2011

Citing 5
Cited 0

Ensuring termination by typability

Information and Computation
On Stratified Regions

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Mobile processes and termination

Semantics and algebraic specification
Termination in impure concurrent languages

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Fair cooperative multithreading: typing termination in a higher-order concurrent imperative language

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

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 core.