![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Monday 02 June 2025, 10:00-11:00
An Invitation to Synthetic Domain Theory
- đ¤ Speaker: Jon Sterling (University of Cambridge)
- đ Date & Time: Monday 02 June 2025, 10:00 - 11:00
- đ Venue: FW26, Computer Laboratory
Abstract
Domain theory offers a denotational semantics for general recursive functional programming, but working directly with domains and their continuity laws can be a bit technical; it is also not easy to find a single notion of “domain” that is good for most purposes. Synthetic methods can simplify the use of domain theory by recasting domains as special types in an alternate reality where all functions are automatically as continuous as possible. We will see how to formulate domains and general recursion in the synthetic setting by extending Homotopy Type Theory with a bounded distributive lattice of observations satisfying a few additional laws.
Series This talk is part of the SANDWICH Seminar (Computer Laboratory) series.
Included in Lists
Note: Ex-directory lists are not shown.