Abstract
This paper studies continuity of the normal form and the context operators as functions in the infinitary lambda calculus. We consider the Scott topology on the cpo of the finite and infinite terms with the prefix relation. We prove that the only continuous parametric trees are Böhm and Lévy–Longo trees. We also prove a general statement: if the normal form function is continuous then so is the model induced by the normal form; as well as the converse for parametric trees. This allows us to deduce that the only continuous models induced by the parametric trees are the ones of Böhm and Lévy–Longo trees. As a first application, we prove that there is an injective embedding from the infinitary lambda calculus of the ∞η-Böhm trees in D ∞ . As a second application, we study the relation between the Scott topology on the prefix relation and the tree topologies. This allows us to prove that the only parametric tree topologies in which all context operators are continuous and the approximation property holds are the ones of Böhm and Lévy–Longo. As a third application, we give an explicit characterisation of the open sets of the Böhm and Lévy–Longo tree topologies.
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
Amadio, R.M., Curien, P.-L.: Domains and Lambda-Calculi. Cambridge University Press, Cambridge (1998)
Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics, revised edn. North-Holland, Amsterdam (1984)
Barr, M.: Terminal coalgebras for endofunctors on sets. Theoretical Computer Science 114(2), 299–315 (1999)
Berarducci, A.: Infinite λ-calculus and non-sensible models. In: Logic and algebra (Pontignano, 1994), pp. 339–377. Dekker, New York (1996)
Bethke, I., Klop, J.W., de Vrijer, R.: Descendants and origins in term rewriting. Information and Computation 159, 59–124 (2000)
Coppo, M., Dezani-Ciancaglini, M., Zacchi, M.: Type theories, normal forms, and \({D}\sb \infty\)-lambda-models. Information and Computation 72(2), 85–116 (1987)
Dershowitz, N., Kaplan, S., Plaisted, D.: Rewrite, rewrite, rewrite, rewrite, rewrite,.... Theoretical Computer Science 83(1), 71–96 (1991)
Dezani-Ciancaglini, M., Severi, P., de Vries, F.J.: Infinitary lambda calculus and discrimination of Berarducci trees. Theoretical Computer Science 298(2), 275–302 (2003)
Kennaway, J.R., Klop, J.W., Sleep, M., de Vries, F.J.: Infinite lambda calculus and Böhm models. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, pp. 257–270. Springer, Heidelberg (1995)
Kennaway, J.R., Klop, J.W., Sleep, M., de Vries, F.J.: Infinitary lambda calculus. Theoretical Computer Science 175(1), 93–125 (1997)
Kennaway, J.R., van Oostrom, V., de Vries, F.J.: Meaningless terms in rewriting. J. Funct. Logic Programming, Article 1, 35 p. (1999)
Kennaway, J.R., de Vries, F.J.: Infinitary rewriting. In: Terese (ed.) Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55, pp. 668–711. Cambridge University Press, Cambridge (2003)
Lévy, J.-J.: An algebraic interpretation of the λβ K-calculus, and an application of a labelled λ-calculus. Theoretical Computer Science 2(1), 97–114 (1976)
Ong, C.-H.L.: The lazy lambda calculus: an investigation into the foundations of functional programming. PhD thesis, University of Cambridge (1992)
Severi, P., de Vries, F.J.: A lambda calculus for \({D}\sb \infty\). Technical report, University of Leicester (2002)
Severi, P., de Vries, F.J.: An extensional Böhm model. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 159–173. Springer, Heidelberg (2002)
Smyth, M.: Topology. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 1, pp. 641–762. Oxford University Press, Oxford (1993)
Wadsworth, C.P.: Semantics and Pragmatics of the Lambda-calculus. PhD thesis, Oxford University (1971)
Wadsworth, C.P.: Approximate reduction and lambda calculus models. SIAM Journal on Computing 7(3), 337–356 (1978)
Welch, P.: Continuous semantics and inside out reductions. In: Böhm, C. (ed.) Lambda Calculus and Computer Science Theory. LNCS, vol. 37, pp. 122–146. Springer, Heidelberg (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Severi, P., de Vries, FJ. (2005). Continuity and Discontinuity in Lambda Calculus. In: Urzyczyn, P. (eds) Typed Lambda Calculi and Applications. TLCA 2005. Lecture Notes in Computer Science, vol 3461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11417170_27
Download citation
DOI: https://doi.org/10.1007/11417170_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25593-2
Online ISBN: 978-3-540-32014-2
eBook Packages: Computer ScienceComputer Science (R0)