Logic of Computable Functions (LCF) is a deductive system for computable functions proposed by Dana Scott in 1969 in a memorandum unpublished until 1993. It inspired:
- Logic for Computable Functions (LCF), theorem proving logic by Robin Milner.
- Programming Computable Functions (PCF), small theoretical programming language by Gordon Plotkin.
We don't have any images related to Logic of Computable Functions yet.
You can add one yourself here.
We don't have any YouTube videos related to Logic of Computable Functions yet.
You can add one yourself here.
We don't have any PDF documents related to Logic of Computable Functions yet.
You can add one yourself here.
We don't have any Books related to Logic of Computable Functions yet.
You can add one yourself here.
We don't have any archived web articles related to Logic of Computable Functions yet.
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. https://www.cs.cmu.edu/~kw/scans/scott93tcs.pdf ↩
Robin Milner (1973). "Models of LCF" http://i.stanford.edu/TR/CS-TR-73-332.html ↩
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. /wiki/Gordon_Plotkin ↩