Content deleted Content added
Jerryobject (talk | contribs) →References: WP:REFerence WP:CITation parameters: respaces, cut whitespace characters to standardize, aid work via small screens, reorders, adds, fills, update-standardizes. WP:NAVBOX add. |
No edit summary |
||
(4 intermediate revisions by 4 users not shown) | |||
Line 1:
{{Short description|1970s automated theorem prover}}
{{see also|Logic of Computable Functions}}
'''Logic for Computable Functions''' ('''LCF''') is an interactive [[automated theorem prover]] developed at [[Stanford University|Stanford]] and [[University of Edinburgh|Edinburgh]] by [[Robin Milner]] and collaborators in early 1970s, based on the theoretical foundation of [[Logic of Computable Functions|logic
== Basic idea ==
Line 15:
=== Trusted computing base ===
The implementation of the underlying ML compiler adds to the [[trusted computing base]]. Work on CakeML<ref name="cakeml">{{cite web |title=CakeML |url=https://cakeml.org/ |access-date=2 November 2019}}</ref> resulted in a formally verified ML compiler, alleviating some of these concerns.
=== Efficiency and complexity of proof procedures ===
Line 23:
== Influences ==
Among subsequent implementations is Cambridge LCF. Later systems simplified the logic to use total instead of partial functions, leading to [[HOL (proof assistant)|HOL]], [[HOL Light]], and the [[Isabelle proof assistant]] that supports various logics. As of 2019, the Isabelle [[proof assistant]] still contains an implementation of an LCF logic, Isabelle/LCF.
== Notes ==
Line 74:
|publisher=Stanford University
|date=May 1972
|url=
* {{cite book
|last=Milner
Line 91:
{{ML programming}}
{{Mathlogic-stub}}▼
[[Category:Logic in computer science]]
[[Category:Proof assistants]]
▲{{Mathlogic-stub}}
|