The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus

@article{Wadsworth1976TheRB,
  title={The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus},
  author={C. P. Wadsworth},
  journal={SIAM J. Comput.},
  year={1976},
  volume={5},
  pages={488-521}
}
A prominent feature of the lattice-theoretic approach to the theory of computation due to D. Scott is the construction of solutions for isomorphic domain equations. One of the simplest of these is ... 
269 Citations

Figures and Topics from this paper

On Proving Limiting Completeness
  • 10
  • PDF
What is a Model of the Lambda Calculus?
  • A. Meyer
  • Computer Science, Mathematics
  • Inf. Control.
  • 1982
  • 187
  • Highly Influenced
  • PDF
Lambda Congruences and Extensionality
  • 1
  • PDF
Böhm's theorem for Berarducci trees
  • 3
Typing and Computational Properties of Lambda Expressions
  • D. Leivant
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1986
  • 61
The untyped stack calculus and Bohm's theorem
  • 2
  • PDF
Infinitary lambda calculus and discrimination of Berarducci trees
  • 17
  • Highly Influenced
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
Lambda-calculus models of programming languages.
  • 389
LCF Considered as a Programming Language
  • 1,163
  • PDF
Tree-Manipulating Systems and Church-Rosser Theorems
  • 386
Correctness results for lambda calculus interpreters
  • 16
Introduction to Metamathematics
  • 3,857