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

5 weeks 2 days ago

5 weeks 2 days ago

5 weeks 2 days ago

27 weeks 3 days ago

31 weeks 5 days ago

33 weeks 2 days ago

33 weeks 2 days ago

36 weeks 16 hours ago

40 weeks 5 days ago

40 weeks 5 days ago