On Proving Limited Completeness

Forfattere

  • Peter D. Mosses
  • Gordon D. Plotkin

DOI:

https://doi.org/10.7146/dpb.v14i188.7461

Resumé

We give proofs of Wadsworth's classic Approximation Theorem for the pure lambda-calculus. One of these illustrates a new method utilising a certain kind of intermediate semantics for proving correspondences between denotational and operational semantics. The other illustrates a direct technique of Milne, employing recursively-specified inclusive relations.

Forfatterbiografier

Peter D. Mosses

Gordon D. Plotkin

Downloads

Publiceret

1985-01-01

Citation/Eksport

Mosses, P. D., & Plotkin, G. D. (1985). On Proving Limited Completeness. DAIMI Report Series, 14(188). https://doi.org/10.7146/dpb.v14i188.7461

Nummer

Nr. 188 (1985): PB-188 On Proving Limited Completeness

Sektion

Articles

Licens

Creative Commons License

Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.