Logic of Computable Functions
From Infogalactic: the planetary knowledge core
Lua error in package.lua at line 80: module 'strict' not found. 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:
- Logic for Computable Functions (LCF), theorem proving logic by Robin Milner.[2]
- Programming Computable Functions (PCF), small theoretical programming language by Gordon Plotkin.[3]
References
- ↑ Dana S. Scott. "A type-theoretical alternative to ISWIM, CUCH, OWHY". Theoretical Computer Science, 121:411–440, 1993. Annotated version of the 1969 manuscript.
- ↑ Robin Milner (1973). "Models of LCF"
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
