Logic_of_Computable_Functions

Logic of Computable Functions

Logic of Computable Functions

Deductive system for computable functions by Dana Scott

Logic of Computable Functions (LCF) is a deductive system for computable functions proposed by Dana Scott in 1969 in a memorandum unpublished until 1993.[1] It inspired:

Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

References

  1. [1]
    Dana S. Scott. "A type-theoretical alternative to ISWIM, CUCH, OWHY". Theoretical Computer Science, 121:411–440, 1993. Annotated version of the 1969 manuscript.
  2. [2]
    Robin Milner (1973). "Models of LCF"
  3. [3]
    Plotkin, Gordon D. (1977). "LCF considered as a programming language" (PDF). Theoretical Computer Science. 5 (3): 223–255. doi:10.1016/0304-3975(77)90044-5.
Share this article:

This article uses material from the Wikipedia article Logic_of_Computable_Functions, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.