University of Cambridge > Talks.cam > SANDWICH Seminar (Computer Laboratory) > Dependent Linear Type Theory via Bunched(less) Implications

Dependent Linear Type Theory via Bunched(less) Implications

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

If you have a question about this talk, please contact Dr Meven Lennon-Bertrand.

Introducing the `number-of-usages` reading of linear variables to dependent type theory has in prior work resulted in type theories with dependencies and identity types restricted to closed linear terms. In this talk I will discuss work I have been doing for my Master’s thesis, supervised by Neel Krishnaswami, applying the ownership reading of resources as seen in the logic of bunched implications to dependent types, with the goal of designing a dependently typed bunched implications which allows dependency and identity types of terms which include resources.

This talk is part of the SANDWICH 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-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity