University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Logical equivalence for subtyping object and recursive types.

Logical equivalence for subtyping object and recursive types.

Add to your list(s) Download to your calendar using vCal

  • UserSteffen van Bakel
  • ClockFriday 13 October 2006, 14:00-15:00
  • HouseFW11.

If you have a question about this talk, please contact Tom Ridge.

We study subtyping in first order object calculi with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised through an assignment system. Equality in the full first order varsigma-calculus is modelled by this notion, which in turn is included in a Morris-style contextual equivalence.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity