Logic of Computable Functions (LCF) is a deductive system for computable functions proposed by Dana Scott in 1969 in a memorandum unpublished until 1993.Dana S. Scott. "A type-theoretical alternative to ISWIM, CUCH, OWHY". Theoretical Computer Science, 121:411–440, 1993. Annotated version of the 1969 manuscript. It inspired:
Logic for Computable Functions (LCF), theorem proving logic by Robin Milner.Robin Milner (1973). "Models of LCF" Programming Computable Functions (PCF), small theoretical programming language by Gordon Plotkin.
References