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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
This paper proposes two new coding schemes for the discrete memoryless two-way relay channel. The main target is to show the… 
2012
2012
In this paper, the multiaxial formulation of a mechanism-based model for fatigue life prediction is presented which can be… 
2008
2008
In this paper we explore a shallow embedding of Cryptol in HOL-4 by providing a way to import Cryptol programs into HOL-4 so as… 
2007
2007
We describe a constructive theory of computable functionals, based on the partial continuous functionals as their intendend… 
2007
2007
INTRODUCTION Nowadays engine components are subjected to higher loads at elevated temperatures than before, due to the increasing… 
Review
2006
Review
2006
Past research has shown there is a nonlinear interaction effect between LCF (high damage) and HCF (low damage) cycles in many… 
1991
1991
  • Sara Kalvala
  • 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… 
1991
1991
Rigorous control of the annealing practice and certain alloying elements can directly influence key characteristics which aid in… 
Highly Cited
1990
Highly Cited
1990
In this chapter we develop an interpreter of a higher-order constraint logic programming language in Standard ML (SML). The logic…