Skip to main content
SpringerLink
Log in
Book cover

Computer Science Today pp 366–373Cite as

Avoiding the undefined by underspecification

  • Chapter
  • First Online:

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

Abstract

We use the appeal of simplicity and an aversion to complexity in selecting a method for handling partial functions in logic. We conclude that avoiding the undefined by using underspecification is the preferred choice.

Supported by NSF grant CDA-9214957 and ARPA/ONR grant N00014-91-J-4123.

This material is based on work supported in part by ARPA/NSF Grant No. CCR-9014363, NASA/ARPA grant NAG-2-893, and AFOSR grant F49620-94-1-0198.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bijlsma, A. Semantics of quasi-boolean expressions. In Feijen, W.H.J., et al (eds.) Beauty is Our Business, Springer-Verlag, New York, 1990, 27–35.

    Google Scholar 

  2. Cheng, J.H., and C.B. Jones. On the usability of logics which handle partial functions. In: C. Morgan and J.C.P. Woodcock (eds.). Third Refinement Workshop, pp. 51–69. Workshops in Computing Series, Heidelberg, 1991.

    Google Scholar 

  3. Constable, R.L., and M.J. O'Donnell. A Programming Logic. Winthrop, Cambridge, Massachusetts, 1978.

    Google Scholar 

  4. Dijkstra, E.W., and C.S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, New York 1990.

    Google Scholar 

  5. Gries, D., and F.B. Schneider. A Logical Approach to Discrete Math. Springer-Verlag, New York, 1993.

    Google Scholar 

  6. Gries, D., and F.B. Schneider. Equational propositional logic. IPL 53 (1995), 145–152.

    Article  Google Scholar 

  7. Jones, C.B. Partial functions and logics: a warning. IPL 54 (1995), 65–68.

    Article  Google Scholar 

  8. Jones, C.B., and C.A. Middelburg. A typed logic of partial functions reconstructed classically. Acta Informatica 31 (1994), 399–430.

    Article  Google Scholar 

  9. Scott, D.S. Existence and description in formal logic. In R. Schoenman (ed.) Bertrand Russell, Philosopher of the Century. St. Leonards: Allen and Unwin, 1967, 181–200.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Cornell University, 14853, Ithaca, New York, USA

    David Gries & Fred B. Schneider

Authors
  1. David Gries
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fred B. Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gries, D., Schneider, F.B. (1995). Avoiding the undefined by underspecification. In: van Leeuwen, J. (eds) Computer Science Today. Lecture Notes in Computer Science, vol 1000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015254

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60105-0

  • Online ISBN: 978-3-540-49435-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation