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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Logical equivalence for subtyping object and recursive types.

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Bioinformatics jounal club for the -omics Online & LT2, Computer Laboratory, William Gates Building. Type the title of a new list here

Other talks

Group Work Title abstract tbc "Green" RSEs? A new role (and a new community) to reduce the environmental impact of research Clonal haematopoiesis, early detection and pre-leukemia to leukemia development Seminars in Cancer Using A Function-Centric Lens to Re-consider Regularisation, Representation Transfer and Geometric Properties of Neural Networks
 

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