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

On the solution of recursive domain equations

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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