Relational Interpretations of Recursive Types in an Operational Setting

@article{Birkedal1999RelationalIO,
  title={Relational Interpretations of Recursive Types in an Operational Setting},
  author={Lars Birkedal and Robert Harper},
  journal={Inf. Comput.},
  year={1999},
  volume={155},
  pages={3-63}
}
Relational interpretations of type systems are useful for establishing properties of programming languages. For languages with recursive types it is usually difficult to establish the existence of a relational interpretation. The usual approach is to give a denotational semantics of the language in a domain-theoretic model given by an inverse limit construction, and to construct relations over the model by a similar inverse limit construction. However, in passing to a denotational semantics we… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Relational Properties of Domains

Inf. Comput. • 1996
View 7 Excerpts
Highly Influenced

On the relation between direct and continuation semantics

John C. Reynolds
Proceedings of the Second Colloquium on Automata, Languages and Programming, Saarbrücken, • 1974
View 4 Excerpts
Highly Influenced

Controlling Effects

Andrzej Filinski
1996
View 1 Excerpt

Foundations for programming languages

Foundation of computing series • 1996
View 1 Excerpt

Remarks on algebraically compact categories

Peter Freyd
editors, Applications of Categories in Computer Science. Proceedings of the LMS Symposium, Durham 1991, • 1991
View 1 Excerpt

Similar Papers

Loading similar papers…