University of Cambridge > Talks.cam > Junior Category Theory Seminar > On the solution of recursive domain equations

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

On the solution of recursive domain equations

Download to your calendar using vCal

If you have a question about this talk, please contact Sean Moss .

To give denotational semantics to untyped programming languages (e.g., the untyped lambda calculus), and to recursive datatypes, semanticists solve recursive domain equations. We will review Freyd’s algebraically compact categories, where such solutions are guaranteed to exist as fixed-points of (mixed-variance) bifunctors. We will then review a class of algebraically compact categories arising through the work of Smyth and Plotkin on recursive domain equations in omega-chain complete enriched categories.

This talk is part of the Junior Category Theory Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

University Lecture Rooms (Mill Lane) - Room 2 Room FW11 at the William Gates Building https://cam-ac-uk.zoom.us/j/84149251556?pwd=eB8d74qlkoDlHaJCjOroBrUIj2KFFb.1

Other talks

Alicia Anderson discussing some exciting news about HARPS3 Title to be confirmed Title TBC Talk TBC Title TBC Online Causal Inference Seminar
 

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