Skip to search formSkip to main contentSkip to account menu

Logic of Computable Functions

Known as: LCF 
Logic of Computable Functions (LCF) is a deductive system for computable functions proposed by Dana Scott in 1969 in a memorandum unpublished until… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Logic for Computable FunctionsProgramming Computable Functions

Broader (1)

Programming language theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Satisfiability Modulo Bounded Checking
We describe a new approach to find models for a computational higher-order logic with datatypes. The goal is to find… 
2016
2016
From Mathematical Functions to Programs
  • 2016
  • Corpus ID: 18982440
@article{gdp:lcf-as-pl, author={Plotkin, G. D.}, title={LCF Considered as a Programming Language}, journal={Theoretical Computer… 
2012
2012
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
2010
2010
Robin Milner: 13 January 1934–20 March 2010
Robin Milner, who died of a heart attack at the age of 76, was a foremost computer scientist who became a Fellow of the Royal… 
1996
1996
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are… 
Review
1996
Review
1996
High-Level Text on Higher Order Logic
The only .thing I could suggest to improve the next edition of this book is more working examples to help clarify particularly… 
Review
1996
Review
1996
Informal Survey of Software Fault Tolerance in Distributed Systems
The only .thing I could suggest to improve the next edition of this book is more working examples to help clarify particularly… 
1996
1996
Finding proofs and checking proofs
The classic dichotomy between proof discovery and proof presentation resurfaces in automated deduction. The LCF style of theorem… 
1983
1983
Program verification prize
(currently) the University of Texas. Their main achievement is the development of an elegant logi c implemented in a very… 
1981
1981
Programmverification at Stanford: Past, Present Future
In late 1971 Shigeru Igarashi, Ralph London, David Luckham, and Robin Milner were working at the Stanford Artificial Intelligence… 
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)