Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Logic for Computable Functions
open-in-new
<p>Logic for Computable Functions (LCF) is an interactive <a href="/facts/Automated_theorem_prover/vKGvuKFI">automated theorem prover</a> developed at <a href="/facts/Stanford_University/JEQeF9z2">Stanford</a> and <a href="/facts/University_of_Edinburgh/L69HscH9">Edinburgh</a> by <a href="/facts/Robin_Milner/oMfdsRwK">Robin Milner</a> and collaborators in early 1970s, based on the theoretical foundation of <a href="/facts/Logic_of_Computable_Functions/oPQXrE6S">logic of computable functions</a> previously proposed by <a href="/facts/Dana_Scott/XEVddlVg">Dana Scott</a>. Work on the LCF system introduced the general-purpose <a href="/facts/Programming_language/cWTYbgWa">programming language</a> <a href="/facts/ML_(programming_language)/RfwxASRF">ML</a> to allow users to write theorem-proving tactics, supporting <a href="/facts/Algebraic_data_type/Fn9KhnAb">algebraic data types</a>, <a href="/facts/Parametric_polymorphism/ETb0G1zd">parametric polymorphism</a>, <a href="/facts/Abstract_data_types/BaVGSHNP">abstract data types</a>, and <a href="/facts/Exception_handling/VrJxgb9r">exceptions</a>. </p>