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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amadio, R.M.: On Stratified Regions. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol. 5904, pp. 210–225. Springer, Heidelberg (2009)
Amadio, R.M., Baillot, P., Madet, A.: An affine-intuitionistic system of types and effects: confluence and termination. CoRR, abs/1005.0835 (2010)
Boudol, G.: Fair Cooperative Multithreading. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 272–286. Springer, Heidelberg (2007)
Cristescu, I., Hirschkoff, D.: Termination in a π-calculus with Subptying (in preparation, 2011)
Demangeon, R.: Termination for Concurrent Systems. PhD thesis, Ecole Normale Superieure de Lyon (2010), http://perso.ens-lyon.fr/romain.demangeon/phd.pdf
Demangeon, R., Hirschkoff, D., Sangiorgi, D.: Mobile Processes and Termination. In: Palsberg, J. (ed.) Semantics and Algebraic Specification. LNCS, vol. 5700, pp. 250–273. Springer, Heidelberg (2009)
Demangeon, R., Hirschkoff, D., Sangiorgi, D.: Termination in Impure Concurrent Languages. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 328–342. Springer, Heidelberg (2010)
Deng, Y., Sangiorgi, D.: Ensuring Termination by Typability. Information and Computation 204(7), 1045–1082 (2006)
Tranquilli, P.: Translating types and effects with state monads and linear logic (submitted, 2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demangeon, R., Hirschkoff, D., Sangiorgi, D. (2012). Strong Normalisation in λ-Calculi with References. In: Arbab, F., Sirjani, M. (eds) Fundamentals of Software Engineering. FSEN 2011. Lecture Notes in Computer Science, vol 7141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29320-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-29320-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29319-1
Online ISBN: 978-3-642-29320-7
eBook Packages: Computer ScienceComputer Science (R0)