Content deleted Content added
LCF |
short description, marked as stub Tags: Mobile edit Mobile app edit iOS app edit |
||
(11 intermediate revisions by 10 users 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 an memorandum unpublished until 1993.<ref>Dana S. Scott. "[www.cs.cmu.edu/~kw/scans/scott93tcs.pdf A type-theoretical alternative to ISWIM, CUCH, OWHY]". ''Theoretical▼
{{comp-sci-stub}}
▲'''Logic of Computable Functions''' ('''LCF''') is a [[deductive system]] for [[computable
* [[Logic for Computable Functions]] (LCF), theorem proving logic by [[Robin Milner]].<ref>Robin Milner (1973). "[ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/73/332/CS-TR-73-332.pdf Models of LCF]"</ref>▼
▲* [[Logic for Computable Functions]] (LCF), theorem proving logic by [[Robin Milner]].<ref>Robin Milner (1973). "[
* [[Programming Computable Functions]] (PCF), small theoretical programming language by [[Gordon Plotkin]].<ref>{{ cite journal
| first = Gordon D.
Line 12 ⟶ 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
|
}}</ref>
== References ==
<references/>
[[Category:Programming language theory]]
|