Abstract
We define a class of hyperbalancedλ-terms by imposing syntactic constraints on the construction of λ-terms, and show that such terms are strongly normalizable. Furthermore, we show that for any hyperbalanced term, the total number of superdevelopments needed to compute its normal form can be statically determined at the beginning of reduction. To obtain the latter result, we develop an algorithm that, in a hyperbalanced term M, statically detects all inessential (or unneeded) subterms which can be replaced by fresh variables without effecting the normal form of M; that is, full garbage collection can be performed before starting the reduction. Finally, we show that, modulo a restricted η-expansion, all simply typable λ-terms are hyperbalanced, implying importance of the class of hyperbalanced terms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asperti, A., Danos, V., Laneve, C., Regnier, L.: Paths in the lambda-calculus. In: Proceedings of the Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos (1994)
Asperti, A., Mairson, H.G.: Parallel beta reduction is not elementary recursive. In: Proc. of ACM Symposium on Principles of Programming Languages, POPL (1998)
van Bakel, S.: Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems. PhD thesis, Matematisch Centrum Amsterdam (1993)
Barendregt, H.: The Lambda Calculus. In: Its syntax and Semantics (revised edition). North Holland, Amsterdam (1984)
Barendregt, H.: Lambda Calculi with Types. In: Handbook of Logic in Computer Science, vol. 2. Oxford University Press, Oxford (1992)
Barendregt, H.P., Kennaway, J.R., Klop, J.W., Sleep, M.R.: Needed Reduction and spine strategies for the lambda calculus. Information and Computation 75(3), 191–231 (1987)
Coppo, M., Dezani-Ciancaglini, M.: An Extension of the Basic Functionality Theory for the λ-Calculus. Notre Dame J. of Formal Logic 21(4), 685–693 (1980)
Girard, J.-Y.: Une extension de l’interprétation de Gödel à l’analyse, et son application à l’elimination des coupures dans l’analyse et la théorie des types. In: Procs of 2nd Scandinavian Logic Symposium, North-Holland, Amsterdam (1971)
Glauert, J.R.W., Khasidashvili, Z.: Relative Normalization in Orthogonal Expression Reduction Systems. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol. 968, pp. 144–165. Springer, Heidelberg (1995)
Huet, G., Lévy, J.-J.: Computations in Orthogonal Rewriting Systems. In: Robinson, A., Lassez, J.-L., Plotkin, G. (eds.) Computational Logic. MIT Press, Cambridge (1991)
Khasidashvili, Z.: β-reductions and β-developments of λ-terms with the least number of steps. In: Martin-Löf, P., Mints, G. (eds.) COLOG 1988. LNCS, vol. 417, pp. 105–111. Springer, Heidelberg (1990)
Khasidashvili, Z.: On higher order recursive program schemes. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 172–186. Springer, Heidelberg (1994)
Khasidashvili, Z.: On Longest Perpetual Reductions in Orthogonal Expression Reduction Systems (Submitted)
Klop, J.W., van Oostrom, V., van Raamsdonk, F.: Combinatory reduction systems: introduction and survey. Theoretical Computer Science 121, 279–308 (1993)
Klop, J.W.: Combinatory Reduction Systems. PhD thesis, Matematisch Centrum Amsterdam (1980)
Lévy, J.-J.: An algebraic interpretation of the λβ κ-calculus and a labelled λ- calculus. Theoretical Computer Science 2, 97–114 (1976)
Lévy, J.-J.: Réductions correctes et optimales dans le λ-calcul. PhD thesis, Univerité Paris 7 (1978)
Piperno, A., Ronchi della Rocca, S.: Type inference and extensionality. In: Proceedings of the Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos (1994)
Piperno, A.: Normalization and extensionality. In: Proceedings of the Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos (1995)
van Raamsdonk, F.: Confluence and superdevelopments. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol. 690, pp. 168–182. Springer, Heidelberg (1993)
Tait, W.W.: Intensional interpretation of functionals of finite type I. J. Symbolic Logic 32, 198–212 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khasidashvili, Z., Piperno, A. (1999). Normalization of Typable Terms by Superdevelopments. In: Gottlob, G., Grandjean, E., Seyr, K. (eds) Computer Science Logic. CSL 1998. Lecture Notes in Computer Science, vol 1584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703163_18
Download citation
DOI: https://doi.org/10.1007/10703163_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65922-8
Online ISBN: 978-3-540-48855-2
eBook Packages: Springer Book Archive