Skip to main content
SpringerLink
Log in

Functional programming systems revisited

  • Session 1 Specification And Programming
  • Conference paper
  • First Online:
Book cover Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1984)

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

  • 123 Accesses

Abstract

Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Programming (NFP) systems in which nondeterministic programs can be specified and both deterministic and nondeterministic programs can be verified essentially within the system. It is shown that the algebra of NFP programs has simpler laws in comparison with the algebra of FP programs. "Regular" forms are introduced to put forward a disciplined way of reasoning about programs. Finally, an alternative definition of "linear" forms is proposed for reasoning about recursively defined programs. This definition, when used to test the linearity of forms, results in simpler verification conditions than those generated by the original definition of linear forms.

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. Backus, J.: Can Programming be liberated from the von Neumann style? A Functional style and its Algebra of Programs. CACM 21(8) 613–641 (1978).

    Google Scholar 

  2. Backus, J.: The Algebra of Functional Programs: Functional level reasoning, Linear equations, and Extended Definitions. In: Lecture Notes in Computer Science, Vol. 107, pp. 1–43, Berlin-Heidelberg-New York: Springer-Verlag 1981.

    Google Scholar 

  3. Dijkstra, E.W.: A Discipline of Programming. Englewood Cliffs, N.J.: Prentice Hall, 1976.

    Google Scholar 

  4. Gries, D.: The Science of Programming, New York: Springer-Verlag, 1981.

    Google Scholar 

  5. Kieburtz, R., Shultis, J.: Transformation of FP Program Schemes. Proc. Conf. on Functional Programming Languages and Computer Architecture, 1981, Portsmouth, pp.41–48.

    Google Scholar 

  6. Williams, J.H.: On the Development of the Algebra of Functional Programs. ACM TOPLAS 4(4) 733–757 (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Automation, Indian Institute of Science, 560 012, Bangalore, India

    Asis K. Goswami & L. M. Patnaik

Authors
  1. Asis K. Goswami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. M. Patnaik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mathai Joseph Rudrapatna Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goswami, A.K., Patnaik, L.M. (1984). Functional programming systems revisited. In: Joseph, M., Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1984. Lecture Notes in Computer Science, vol 181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13883-8_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-13883-8_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13883-9

  • Online ISBN: 978-3-540-39087-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation