Skip to main content
SpringerLink
Log in
Book cover

Grundlagen der funktionalen Programmierung pp 241–258Cite as

Abstrakte Interpretation

  • Chapter

  • 61 Accesses

Part of the book series: Leitfäden der Informatik ((XLINF))

Zusammenfassung

Für die Erzeugung von effizientem Code durch einen Übersetzer ist es wichtig, verschiedene Eigenschaften eines vorliegenden Programms analysieren zu können. In diesem Zusammenhang ist zum Beispiel der Wertebereich einer Variablen an einer bestimmten Stelle des Programms oder die Striktheit einer Funktion in einem Argument interessant.

This is a preview of subscription content, 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   49.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   44.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturhinweise

  1. Burn, G. L., C. L. Harkin and S. Abramsky: The Theory of Strictness Analysis for Higher Order Functions. In: Ganzinger, H. and N. D. Jones (Eds.): Programs as Data Objects, S. 42–62, Copenhagen, Denmark, Oktober 1985. Springer Verlag. LNCS 217.

    Google Scholar 

  2. Wadler, P. L.: Abstract Interpretation of Declarative Languages, Kapitel 12. Ellis Horwood, 1987.

    Google Scholar 

  3. Jones, S. B. and D. Le Métayer: A New Method for Strictness Analysis on Non-Flat Domains. In: Davis, K. and J. Hughes (Eds.): Functional Programming, Glasgow 1989, S. 1–11. Springer-Verlag, 1990.

    Google Scholar 

  4. Benton, P. N.: Strictness Properties of Lazy Algebraic Datatypes. In: Filé, G. [Fi193], S. 206–217. LNCS 724.

    Google Scholar 

  5. Davis, K. and P. Wadler: Strictness Analysis in 4D. In: Peyton Jones, S. L., G. Hutton and C. K. Holst (Eds.): Functional Programming, Glasgow 1989,S. 23–43, London,1990. Springer-Verlag.

    Google Scholar 

  6. Hunt, S. and C. Hankin: Fixed points and frontiers: a new perspective. Journal of Functional Programming, 1(1):91–120. 1991

    Article  MathSciNet  MATH  Google Scholar 

  7. Davis, K.: Higher-order Binding-time Analysis. In: Schmidt, D. [Sch93], S. 78–87.

    Google Scholar 

  8. Seward, J.: Polymorphic Stricness Analysis Using Frontiers. In: Schmidt, D. [Sch93], S. 186–193.

    Google Scholar 

  9. van Eekelen, M., E. Goubault, C. Hankin and E. Nöcker: Abstract Reduction: Towards a Theory via Abstract Interpretation, Kapitel 13. In: Sleep, M. R. et al. [SPv92], 1992.

    Google Scholar 

  10. Nöcker, E.: Strictness Analysis using Abstract Reduction. In: Arvind [Arv93], S. 255–265.

    Google Scholar 

  11. Goubault, E. and C. L. Hankin: A Lattice for the Abstract Interpretation of Term Graph Rewriting Systems, Kapitel 9. In: Sleep, M. R. et al. [SPv92], 1992.

    Google Scholar 

  12. Hankin, C. and D. Le Metayér: Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis. In: POPLI994 [POP94], S. 202–212.

    Google Scholar 

  13. Hankin, C. and D. Le Métayer: Lazy Type Inference for the Strictness Analysis of Lists. In: Sannella, D. [San94], S. 257–271. LNCS 788.

    Google Scholar 

  14. Jensen, T. P.: Strictness Analysis in Logical Form. In: Hughes, J. [Hug91], S. 352–366. LNCS 523.

    Google Scholar 

  15. Ferguson, A. and J. Hughes: Fast Abstract Interpretation Using Sequential Algorithms. In: Filé

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Tübingen, Deutschland

    Dr. rer. nat. Peter Thiemann

Authors
  1. Dr. rer. nat. Peter Thiemann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1994 B. G. Teubner Stuttgart

About this chapter

Cite this chapter

Thiemann, P. (1994). Abstrakte Interpretation. In: Grundlagen der funktionalen Programmierung. Leitfäden der Informatik. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-89207-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-89207-2_14

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-519-02137-7

  • Online ISBN: 978-3-322-89207-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation