Logic of Computable Functions: Difference between revisions

Revision as of 22:08, 15 August 2009

Latest revision as of 04:57, 30 August 2022

(16 intermediate revisions by 11 users not shown)

Line 1:

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

#REDIRECT [[LCF theorem prover]]

{{comp-sci-stub}}

'''Logic of Computable Functions''' ('''LCF''') is a [[deductive system]] for [[computable function]]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>

* [[Programming Computable Functions]] (PCF), small theoretical programming language by [[Gordon Plotkin]].<ref>{{ cite journal

| first = Gordon D.

| last = Plotkin

| authorlink = Gordon Plotkin

| title = LCF considered as a programming language

| journal = Theoretical Computer Science

| year = 1977

| 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

| doi-access = free

}}</ref>

== References ==

<references/>

[[Category:Programming language theory]]