Revision as of 14:31, 30 September 2016 edit WillNess (talk \| contribs) Extended confirmed users 2,940 edits replace dead link by a working one ← Previous edit		Revision as of 14:57, 4 November 2016 edit undo Klbrain (talk \| contribs) Autopatrolled, Extended confirmed users, New page reviewers 97,828 edits Removing stale merge proposal from July 2013; no case made, no support over more than 3 years, case for merge is not obvious Next edit →
Line 1: ~~{{merge to\|Programming Computable Functions\|date=July 2013}}~~ '''Logic of Computable Functions''' ('''LCF''') is a deductive system for computable functions proposed by [[Dana Scott]] in 1969 in a memorandum unpublished until 1993.<ref>Dana S. Scott. "[http://www.cs.cmu.edu/~kw/scans/scott93tcs.pdf A type-theoretical alternative to ISWIM, CUCH, OWHY]". ''Theoretical Computer Science'', '''121''':411–440, 1993. Annotated version of the 1969 manuscript.</ref> It inspired:

Logic of Computable Functions: Difference between revisions