Abstract
In 1970 Friedman proved completeness of beta eta conversion in the simply-typed lambda calculus for the set-theoretical model. Recently Krishnaswami and Benton have captured the essence of Hudak’s reactive programs in an extension of simply typed lambda calculus with causal streams and a temporal modality and provided this typed lambda calculus for reactive programs with a sound ultrametric semantics.
We show that beta eta conversion in the typed lambda calculus of reactive programs is complete for the ultrametric model.
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
Krishnaswami, N.R., Benton, N.: Ultrametric semantics of reactive programs. In: LICS, pp. 257–266 (2011)
Krishnaswami, N.R., Benton, N.: A semantic model for graphical user interfaces. In: ICFP, pp. 45–57 (2011)
Birkedal, L., Schwinghammer, J., Støvring, K.: A metric model of lambda calculus with guarded recursion. Presented at FICS 2010 (2010)
Escardó, M.: A metric model of PCF. Presented at the Workshop on Realizability Semantics and Applications, June 30-July 1 (1999)
Friedman, H.: Equality between functionals. In: Logic Colloquium. Springer Lecture Notes, vol. 453, pp. 22–37 (1975)
Plotkin, G.: Notes on completeness of the full continuous hierarchy (1982) (unpublished manuscript)
Mitchell, J.C.: Foundations for programming languages. Foundation of Computing Series. MIT Press (1996)
Nederpelt, R.P.: Strong normalization in a typed lambda calculus. Ph.D. dissertation, Technische Universiteit Eindhoven (1973)
Klop, J.W.: Combinatory reduction systems. Ph.D. dissertation, Rijksuniversiteit Utrecht (1980)
Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics, 2nd edn. North-Holland, Amsterdam (1984)
Terese (ed.): Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press (2003)
Severi, P., de Vries, F.-J.: Pure type systems with corecursion on streams: from finite to infinitary normalisation. In: ICFP, pp. 141–152 (2012)
Statman, R.: Completeness, invariance and λ-definability. Journal of Symbolic Logic (1982)
Statman, R.: Equality between functionals, revisted. In: Harvey Friedman’s Research on the Foundations of Mathematics, pp. 331–338 (1985)
Mitchell, J.C., Moggi, E.: Kripke-style models for typed lambda calculus. Ann. Pure Appl. Logic 51(1-2), 99–124 (1991)
Riecke, J.G.: Statman’s 1-section theorem. Inf. Comput. 116(2), 294–303 (1995)
Ahmed, A.: Step-indexed syntactic logical relations for recursive and quantified types. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol. 3924, pp. 69–83. Springer, Heidelberg (2006)
Birkedal, L., Reus, B., Schwinghammer, J., Støvring, K., Thamsborg, J., Yang, H.: Step-indexed Kripke models over recursive worlds. In: POPL, pp. 119–132 (2011)
Dreyer, D., Ahmed, A., Birkedal, L.: Logical step-indexed logical relations. Logical Methods in Computer Science 7(2) (2011)
Birkedal, L., Møgelberg, R.E., Schwinghammer, J., Støvring, K.: First steps in synthetic guarded domain theory: Step-indexing in the topos of trees. In: LICS, pp. 55–64 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Severi, P., de Vries, FJ. (2013). Completeness of Conversion between Reactive Programs for Ultrametric Models. In: Hasegawa, M. (eds) Typed Lambda Calculi and Applications. TLCA 2013. Lecture Notes in Computer Science, vol 7941. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38946-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-38946-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38945-0
Online ISBN: 978-3-642-38946-7
eBook Packages: Computer ScienceComputer Science (R0)