Operational and Semantic Equivalence Between Recursive Programs
Journal of the ACM (JACM)
Final Data Types and Their Specification
ACM Transactions on Programming Languages and Systems (TOPLAS)
The denotational semantics of programming languages
Communications of the ACM
Relative definability of boolean functions via hypergraphs
Theoretical Computer Science
Computability concepts for programming language semantics
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Semantics and axiomatics of a simple recursive language.
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Operational and semantic equivalence between recursive programs.
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Simple models for recursive schemes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Recursive schemes, krivine machines, and collapsible pushdown automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
| Hi-index | 0.02 |
LCF is a deductive system for computable functions proposed by D. Scott in 1969 in an unpublished memorandum. The purpose of the present paper is to demonstrate the soundness of the system with respect to certain models, which are partially ordered domains of continuous functions. This demonstration was supplied by Scott in his memorandum; the present paper is merely intended to make this work more accessible.