Skip to search formSkip to main contentSkip to account menu

Logic for Computable Functions

Known as: LCF, LCF (theorem prover), LCF theorem prover 
Logic for Computable Functions (LCF) is an interactive automated theorem prover developed at the universities of Edinburgh and Stanford by Robin… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Abstract data typeHOL (proof assistant)IsabelleLogic of Computable Functions

Broader (1)

Logic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Design Synthesis of Switched Flux Hybrid-Permanent Magnet Memory Machines
This paper develops a design methodology for switched flux (SF) hybrid permanent magnet memory machines (HPMMMs). The memorable… 
2016
2016
A novel stator-consequent-pole memory machine
This paper proposes a novel stator-consequent-pole memory machine (SCPMM), in which the AlNiCo permanent magnets (PMs) with low… 
2007
2007
Tinycals: Step by Step Tacticals
Highly Cited
2004
Highly Cited
2004
On computing mobile agent routes for data fusion in distributed sensor networks
The problem of computing a route for a mobile agent that incrementally fuses the data as it visits the nodes in a distributed… 
Highly Cited
2003
Highly Cited
2003
Fatigue life of fine-grain Al–Mg–Sc alloys produced by equal-channel angular pressing
1996
1996
LCF: A Lexicographic Binary Representation of the Rationals
A binary representation of the rationals derived from their continued fraction expansions is described and analysed. The concepts… 
1991
1991
Developing An Interface For HOL
  • Sara Kalvala
  • ., International Workshop on the HOL Theorem…
  • 1991
  • Corpus ID: 10783341
The HOL system is being increasingly used for a variety of theorem-proving and verification tasks, and by specialists an a… 
Highly Cited
1990
Highly Cited
1990
A Semi-Functional Implementation of a Higher-Order Logic Programming Language
In this chapter we develop an interpreter of a higher-order constraint logic programming language in Standard ML (SML). The logic… 
1982
1982
On using Edinburgh LCF to prove the correctness of a parsing algorithm
1980
1980
An Experiment with "Edinburgh LCF"
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)