Approximate Reduction and Lambda Calculus Models

@article{Wadsworth1978ApproximateRA,
  title={Approximate Reduction and Lambda Calculus Models},
  author={Christopher P. Wadsworth},
  journal={SIAM J. Comput.},
  year={1978},
  volume={7},
  pages={337-356}
}
This paper gives the technical details and proofs for the notion of approximate reduction introduced in an earlier paper. The main theorem asserts that every lambda expression determines a set of approximate normal forms of which it is the limit in the lambda calculus models discovered by Scott in 1969. The proof of this theorem rests on the introduction of a notion of type assignments for the lambda calculus corresponding to the projections present in Scott’s models; the proof is then achieved… CONTINUE READING
15 Citations
1 References
Similar Papers

References

Publications referenced by this paper.

BARENDREGT, Some extensional term models for combinatory logics and A-calculi

  • H P.
  • Ph.D. thesis, Utrecht, The Netherlands,
  • 1971

Similar Papers

Loading similar papers…