Skip to main content
SpringerLink
Log in

A FASE specification of FP

  • Conference paper
  • First Online:
Logics of Programs (Logic of Programs 1985)

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

Included in the following conference series:

  • 165 Accesses

Abstract

The purpose of this paper is to describe the FASE system of executable specifications of data types via a specification of Backus's FP language. We illustrate the ability to execute specifications as well as our more recent efforts to incorporate formal proofs into the system.

This work was supported in part by NSF under grant MCS-81-10087.

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.

9. References

  1. S. Kamin, S. Jefferson, and M. Archer, “The Role of Executable Specifications: The FASE System,” Proc. IEEE Symp. on Application and Assessment of Automated Tools for Software Development, San Francisco (Nov. 1983).

    Google Scholar 

  2. John Backus, “Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs,” CACM 21(8), pp. 613–641 (August, 1978).

    Google Scholar 

  3. S. Kamin, “Final Data Types and Their Specification,” ACM TOPLAS 5(1), pp. 97–123 (Jan. 1983).

    Google Scholar 

  4. K. Futatsugi, J. A. Goguen, Jean-Pierre Jouannaud, and J. Meseguer, Principles of OBJ2, Centre de Recherche en Informatique, University de Nancy, Nancy, France (1984).

    Google Scholar 

  5. S. L. Gerhart, D. R. Musser, D. H. Thompson, D. A. Baker, R. L. Bates, R. W. Erickson, R. L. London, D. G. Taylor, and D. S. Wile, An Overview of AFFIRM: A Specification and Verification System, USC Information Sciences Institute (Nov. 1979).

    Google Scholar 

  6. John Williams, “On the Development of the Algebra of Functional Programs,” TOPLAS 4(4), pp. 733–757 (October, 1982).

    Google Scholar 

  7. J. W. Backus, “The algebra of functional programs: Function-level reasoning, linear equations, and extended definitions,” LNCS 107: Formalization of Programming Concepts, Springer-Verlag, New York, pp. 1–43 (1981).

    Google Scholar 

  8. R. B. Kieburtz and J. Shultis, “Transformation of FP Program Schemas,” Proc. Conf. on Functioanl Programming Languages and Computer Architecture, Portsmouth, MA, pp. 41–48 (1981).

    Google Scholar 

  9. Scott Baden, “Berkeley FP User's Manual, Rev. 4.1,” in UNIX Programmer's Manual, 4.2bsd, (July, 1983).

    Google Scholar 

  10. S. Kamin and S. Jefferson, On λ-expressions That Define Finite Functions, Univ. of Illinois (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept., Univ. of Illinois at Urbana-Champaign, 61801 1304, Urbana, IL, W. Springfield

    Sam Kamin

Authors
  1. Sam Kamin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rohit Parikh

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamin, S. (1985). A FASE specification of FP. In: Parikh, R. (eds) Logics of Programs. Logic of Programs 1985. Lecture Notes in Computer Science, vol 193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15648-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-15648-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15648-2

  • Online ISBN: 978-3-540-39527-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation