User loginNavigation 
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 Programming with Computable Functions toy language, was proposed by Robin Milner in an exposition of Scott's work on LCF. 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:
Dana Scott's original 1969 manuscript, A theory of computable functions of higher type was, I believe, only ever circulated informally, and I've never got hold of the manuscript in any form. 
Browse archivesActive forum topics

Recent comments
6 days 19 hours ago
1 week 4 days ago
1 week 5 days ago
1 week 5 days ago
2 weeks 3 days ago
2 weeks 6 days ago
2 weeks 6 days ago
3 weeks 1 min ago
4 weeks 2 days ago
4 weeks 3 days ago