Logic of Computable Functions: Difference between revisions

Revision as of 03:45, 5 July 2021

Latest revision as of 04:57, 30 August 2022

(One intermediate revision by one other user not shown)

Line 1:

{{Short description|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.<ref>Dana S. Scott. "[https://www.cs.cmu.edu/~kw/scans/scott93tcs.pdf A type-theoretical alternative to ISWIM, CUCH, OWHY]". ''Theoretical

{{comp-sci-stub}}

Computer Science'', '''121''':411–440, 1993. Annotated version of the 1969 manuscript.</ref> It inspired:

'''Logic of Computable Functions''' ('''LCF''') is a [[deductive system]] for [[computable functionsfunction]]s proposed by [[Dana Scott]] in 1969 in a memorandum unpublished until 1993.<ref>Dana S. Scott. "[https://www.cs.cmu.edu/~kw/scans/scott93tcs.pdf A type-theoretical alternative to ISWIM, CUCH, OWHY]". ''[[Theoretical Computer Science (journal)|Theoretical Computer Science]]'', '''121''':411–440, 1993. Annotated version of the 1969 manuscript.</ref> It inspired:

* [[Logic for Computable Functions]] (LCF), theorem proving logic by [[Robin Milner]].<ref>Robin Milner (1973). "[http://i.stanford.edu/TR/CS-TR-73-332.html Models of LCF]"</ref>