Skip to main content
SpringerLink
Log in

Semantik rekursiver Funktionsdefinitionen mit Striktheitsinformation

  • Chapter
Angewandte Mathematik, insbesondere Informatik

  • 191 Accesses

Zusammenfassung

Die Eindeutigkeit rekursiver Funktionsdefinitionen erfordert eine Festlegung des Verhaltens bei nichtdefinierten Funktionsargumenten. Unter Berücksichtigung dieser Zusatzinformation entwickeln wir eine algebraische Darstellung von Fixpunkt- und Reduktionssemantik und beweisen ihre Äquivalenz. Wir stellen ferner eine deterministische Auswertungsstrategie vor, welche die bekannten call-by-name und call-by-value Strategien verallgemeinert.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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.

Literatur

  1. J.M. Cadiou. Recursive Definitions of Partial Functions and Their Computation. PhD thesis, Stanford University, 1972.

    Google Scholar 

  2. O. Chitil. The ς-semantics: A comprehensive semantics for functional programs. Fundamenta Informaticae, 31:253–294, 1997.

    MathSciNet  MATH  Google Scholar 

  3. J.W. deBakker. Least fixed points revisited. Theor. Computer Science, 2:155–181, 1976.

    Article  MathSciNet  Google Scholar 

  4. J.A. Goguen, J.W. Thatcher, E.G. Wagner, and J.B. Wright. Initial algebra semantics and continuous algebras. Journal ACM, 24:68–95, 1977.

    Article  MathSciNet  MATH  Google Scholar 

  5. S.C. Kleene. Introduction to Metamathematics. North-Holland, Amsterdam, 1952.

    MATH  Google Scholar 

  6. Z. Manna. Mathematical Theory of Computation. McGraw-Hill, New York, 1974.

    MATH  Google Scholar 

  7. Z. Manna and J. Vuillemin. Fixpoint approach to the theory of computation. Comm. ACM, 15:528–536, 1972.

    Article  MathSciNet  MATH  Google Scholar 

  8. J. McCarthy. Recursive functions of symbolic expressions and their computation by machine, part i. Comm. ACM, 3:184–195, 1960.

    Article  MATH  Google Scholar 

  9. D. Scott. Outline of a mathematical theory of computation. In Proc. of the 4th Annual Princeton Conference on Information Sciences and Systems, pages 169-176, Princeton, 1970.

    Google Scholar 

  10. D. Scott and C. Strachey. Towards a mathematical semantics for computer languages. In J. Fox, editor, Proc. Symp. Computers and Automata, pages 19-46, 1971.

    Google Scholar 

  11. G. Winskel. The Formal Semantics of Programming Languages. The MIT Press, Cambridge, Mass., 1993.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik II, RWTH Aachen, Deutschland

    Klaus Indermark

Authors
  1. Klaus Indermark
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrick Horster

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden

About this chapter

Cite this chapter

Indermark, K. (1999). Semantik rekursiver Funktionsdefinitionen mit Striktheitsinformation. In: Horster, P. (eds) Angewandte Mathematik, insbesondere Informatik. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-83092-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-83092-0_7

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-528-05720-6

  • Online ISBN: 978-3-322-83092-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation