## User login## Navigation |
## PCF and LCF
The theory LCF, for
Logic of Computable Functions, was proposed by Dana Scott as a theory in the spirit of Church's simple theory of types which allows the computable functions to be characterised, and which comes with a rich enough logical theory to be analytically useful.
PCF, the The two formalisms have been enormously fruitful in theoretical computer science, and I've noticed that two of the early seminal papers are available as scanned PDFs: - Robin Milner's 1973 Models of LCF; and
- Gordon Plotkin's 1977 LCF Considered as a Programming Language .
Dana Scott's original 1969 manuscript, |
## Browse archives## Active forum topics |

## Recent comments

12 hours 20 min ago

17 hours 6 min ago

1 day 17 hours ago

1 day 19 hours ago

2 days 1 hour ago

2 days 17 hours ago

3 days 2 hours ago

3 days 13 hours ago

3 days 14 hours ago

3 days 15 hours ago