Abstract
This paper defines a family of terms of System F which is a decompiler-normalizer for an image of System F by some injective interpretation in System F. We clarify the relationship among these terms, normalization by evaluation, and beta-eta-complete models of F.
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
Abel, A.: Weak beta-Normalization and Normalization by Evaluation for System F. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 497–511. Springer, Heidelberg (2008)
Berardi, S., Tatsuta, M.: Internal Normalization, Compilation and Decompilation for System \({\mathcal F}_{\beta\eta}\) (full paper). Draft, http://www.di.unito.it/~stefano/CompletenessF.pdf
Berger, U., Eberl, M., Schwichtenberg, H.: Normalisation by Evaluation. In: Prospects for Hardware Foundations, pp. 117–137 (1998)
Barbanera, F., Berardi, S.: A full continuous model of polymorphism. Theor. Comput. Sci. 290(1), 407–428 (2003)
Berardi, S., Berline, C.: βη-Complete Models for System F. Mathematical Structures in Computer Science 12(6), 823–874 (2002)
Berardi, S., Berline, C.: Building continuous webbed models for system F. Theor. Comput. Sci. 315(1), 3–34 (2004)
Friedman, H.: Classically and Intuitionistically Provably Recursive Functions. In: Scott, D.S., Muller, G.H. (eds.) Higher Set Theory. LNM, vol. 699, pp. 21–28. Springer, Heidelberg (1978)
Joly, T.: Codage, Separabilite et Representation, These de doctorat, Universite de Paris VII (2000), http://www.cs.ru.nl/~joly/these.ps.gz
Garillot, F., Werner, B.: Simple Types in Type Theory: Deep and Shallow Encodings. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 368–382. Springer, Heidelberg (2007)
Longo, G., Moggi, E.: Constructive Natural Deduction and its ‘Omega-Set’ Interpretation. MSCS 1(2), 215–254 (1991)
Mitchell, J.C.: Semantic Models For Second-Order Lambda Calculus. In: 25th Annual Symposium on Foundations of Computer Science, pp. 289–299 (1984)
Moggi, E., Statman, R.: The Maximum Consistent Theory of Second Order Lambda Calculus. e-mail message to the “Types” net (July 24, 1986), http://www.di.unito.it/~stefano/MoggiStatman1986.zip
Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Wexelblat, R.L. (ed.) Proceedings of the ACM SIGPLAN 1988 PLDI. SIGPLAN Notices, vol. 23(7), pp. 199–208. ACM Press, New York (1988)
Pfenning, F., Lee, P.: LEAP: A language with eval and polymorphism. In: Díaz, J., Orejas, F. (eds.) TAPSOFT 1989 and CCIPL 1989. LNCS, vol. 352, pp. 345–359. Springer, Heidelberg (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berardi, S., Tatsuta, M. (2010). Internal Normalization, Compilation and Decompilation for System \({\mathcal F}_{\beta\eta}\) . In: Blume, M., Kobayashi, N., Vidal, G. (eds) Functional and Logic Programming. FLOPS 2010. Lecture Notes in Computer Science, vol 6009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12251-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-12251-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12250-7
Online ISBN: 978-3-642-12251-4
eBook Packages: Computer ScienceComputer Science (R0)