Logic of Computable Functions: Difference between revisions

Revision as of 14:31, 30 September 2016

Latest revision as of 04:57, 30 August 2022

(5 intermediate revisions by 5 users not shown)

Line 1:

{{Short description|Deductive system for computable functions by Dana Scott}}

{{merge to|Programming Computable Functions|date=July 2013}}

{{comp-sci-stub}}

'''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''' ('''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. "[httphttps://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>

Line 13 ⟶ 14:

| pages = 223–255

| volume = 5

| issue = 3

| doi = 10.1016/0304-3975(77)90044-5

| url = http://homepages.inf.ed.ac.uk/gdp/publications/LCF.pdf

| refdoi-access = harv}}</ref>free

}}</ref>

== References ==