Skip to main content
SpringerLink
Log in

Reduction relations in strict applicative languages

  • Conference paper
  • First Online:
Book cover Theory of Computing and Systems (ISTCS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 601))

Included in the following conference series:

  • 116 Accesses

Abstract

We investigate the reduction relations for a strongly typed higher-order applicative language employing function application, conditional, function abstraction and recursion. In particular, we propose a new approach how to correctly implement a strict (“call-by-value”) semantics in the setting of term rewriting. We study the confluence and termination properties of the reduction system obtained.

This article was processed using the LATEX macro package with LLNCS style

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asperti, A.: Integrating strict and lazy evaluation: the λsl-calculus. In: Deransart, P., Małuszynski, J. (eds.): Programming Language Implementation and Logic Programming (PLIP +90). Lecture Notes in Computer Science 456. Berlin: Springer 1990, 238–254

    Google Scholar 

  2. Backus, J.: Can Programming Be Liberated from the von Neuman Style? A Functional Style and its Algebra of Programs. Communications ACM 21, 613–641 (1978)

    Google Scholar 

  3. Barendregt, H.P.: The Lambda Calculus — Its Syntax and Semantics. Revised edition, second printing. Studies in Logic and the Foundations of Mathematics 103. Amsterdam: North-Holland 1985

    Google Scholar 

  4. Bauer, F.L., Berghammer, R., Broy, M., Dosch, W., Geiselbrechtinger, F., Gnatz, R., Hangel, E., Hesse, W., Krieg-Brückner, B., Laut, A., Matzner, T., Möller, B., Nickl, F., Partsch, H., Pepper, P., Samelson K. (†), Wirsing, M., Wössner, H.: The Munich Project CIP. Volume I: The Wide Spectrum Language CIP-L. Lecture Notes in Computer Science 183. Berlin: Springer 1985

    Google Scholar 

  5. Church, A.: The Calculi of Lambda Conversion. Annals of Mathematical Studies 6. Princeton: Princeton University Press 1941

    Google Scholar 

  6. Church, A., Rosser, J.B.: Some Properties of Conversion. Transactions American Mathematical Society 39, 472–482 (1936)

    Google Scholar 

  7. Curry, H.B., Feys, R., Craig, W.: Combinatoric Logic, Volume I. Amsterdam: North-Holland 1958

    Google Scholar 

  8. Dershowitz, N.: Termination. In: Jouannaud, J.-P. (ed.): Rewriting Techniques and Applications. Lecture Notes in Computer Science 202. Berlin: Springer 1985, 180–224

    Google Scholar 

  9. Dosch, W.: On a Typed Higher Order Functional Calculus. Ph. D. thesis, Fakultät für Mathematik und Informatik, Technische Universität München, July 1987

    Google Scholar 

  10. Huet, G.: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Journal ACM 27:4, 797–821 (1980)

    Google Scholar 

  11. Loeckx, J., Sieber, K.: The Foundations of Program Verification. Stuttgart: Teubner, Chichester: John Wiley et Sons 1984

    Google Scholar 

  12. Newman, M.H.A.: On Theories with a Combinatorial Definition of “Equivalence”. Annals of Mathematics 43:2, 223–243 (1942)

    Google Scholar 

  13. Peyton Jones, S.L.: The Implementation of Functional Programming Languages. New York: Prentice Hall 1987

    Google Scholar 

  14. Plotkin, G.D.: Call-By-Name, Call-By-Value and the λ-Calculus. Theoretical Computer Science 1, 125–159 (1975)

    Google Scholar 

  15. Schwichtenberg, H.: Definierbare Funktionen im λ-Kalkül mit Typen. Arch. math. Logik u. Grundlagenforschung 17:3–4, 113–114 (1975/76)

    Google Scholar 

  16. Scott, D.: Continuous Lattices. In: Lawere, J.D.: Toposes, Algebraic Geometry and Logic. Lecture Notes in Mathematics 274. Berlin: Springer 1972, 97–136

    Google Scholar 

  17. Staples, J.: Church-Rosser Theorems for Replacement Systems. In: Crossley, J. (ed): Algebra and Logic. Lecture Notes in Mathematics 450. Berlin: Springer 1975, 281–303

    Google Scholar 

  18. Wirsing, M., Pepper, P., Partsch, H., Dosch, W., Broy, M.: On Hierarchies of Abstract Data Types. Acta Informatica 20, 1–33 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Universität Augsburg, D-8900, Augsburg, Germany

    Walter Dosch

Authors
  1. Walter Dosch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. Dolev Z. Galil M. Rodeh

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dosch, W. (1992). Reduction relations in strict applicative languages. In: Dolev, D., Galil, Z., Rodeh, M. (eds) Theory of Computing and Systems. ISTCS 1992. Lecture Notes in Computer Science, vol 601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035166

Download citation

  • DOI: https://doi.org/10.1007/BFb0035166

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55553-7

  • Online ISBN: 978-3-540-47214-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation