Skip to main content
SpringerLink
Log in

Internal Normalization, Compilation and Decompilation for System \({\mathcal F}_{\beta\eta}\)

  • Conference paper
Functional and Logic Programming (FLOPS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6009))

Included in the following conference series:

  • 542 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Chapter  Google Scholar 

  2. 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

  3. Berger, U., Eberl, M., Schwichtenberg, H.: Normalisation by Evaluation. In: Prospects for Hardware Foundations, pp. 117–137 (1998)

    Google Scholar 

  4. Barbanera, F., Berardi, S.: A full continuous model of polymorphism. Theor. Comput. Sci. 290(1), 407–428 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Berardi, S., Berline, C.: βη-Complete Models for System F. Mathematical Structures in Computer Science 12(6), 823–874 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Berardi, S., Berline, C.: Building continuous webbed models for system F. Theor. Comput. Sci. 315(1), 3–34 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. Joly, T.: Codage, Separabilite et Representation, These de doctorat, Universite de Paris VII (2000), http://www.cs.ru.nl/~joly/these.ps.gz

  9. 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)

    Chapter  Google Scholar 

  10. Longo, G., Moggi, E.: Constructive Natural Deduction and its ‘Omega-Set’ Interpretation. MSCS 1(2), 215–254 (1991)

    MATH  MathSciNet  Google Scholar 

  11. Mitchell, J.C.: Semantic Models For Second-Order Lambda Calculus. In: 25th Annual Symposium on Foundations of Computer Science, pp. 289–299 (1984)

    Google Scholar 

  12. 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

  13. 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)

    Google Scholar 

  14. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. C.S. Dept., University of Turin, Italy

    Stefano Berardi

  2. National Institute of Informatics, Japan

    Makoto Tatsuta

Authors
  1. Stefano Berardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Makoto Tatsuta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Google, 20 West Kinzie Street, 60610, Chicago, IL, USA

    Matthias Blume

  2. Department of Computer and Mathematical Sciences, Tohoku University, 6-3-9 Aoba, Aramaki, Aoba-ku, Sendai-shi, 980-8579, Miyagi, Japan

    Naoki Kobayashi

  3. DSIC, MiST, Technical University of Valencia, Camino de Vera, S/N, 46022, Valencia, Spain

    Germán Vidal

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation