## 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

33 min 6 sec ago

55 min 51 sec ago

1 hour 14 min ago

3 hours 43 min ago

14 hours 5 min ago

16 hours 2 min ago

23 hours 42 min ago

23 hours 45 min ago

1 day 26 min ago

1 day 45 min ago