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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

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.

Other lists

Millennium Maths Project public and schools' events Symposium on Computational Biology Electronics Knowledge Transfer Network Civic Matter Faculty Research Group @ CRASSH Gates Distinguished Lecture Series Stem Cells & Regenerative Medicine

Other talks

An Introduction to Cluster Categories of Type A The Digital Railway - Network Rail High-Dimensional Collocation for Lognormal Diffusion Problems Beating your final boss battle, or presenting with confidence and style (tough mode) Managing your research data effectively and working reproducibly for beginners Constructing datasets for multi-hop reading comprehension across documents
 

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