**Organisers**: S Abramsky (*Imperial College, London*), G Kahn (*INRIA, Sophia-Antipolis*), J C Mitchell (*Stanford*), A M Pitts (*Cambridge*)

### Semantics of Computation Seminar

Friday 17 November, 2:15 pm

#### Factorization Systems on Domains

Mathias Kegelmann (Birmingham)

I will present a category of domains containing a category of Scott-continuous functions and one of stable functions as full subcategories. To this end the order of each domain is enriched by a factorization system. The morphisms can then be described in an algebraic and a generalized topological way. At the end I will give an outline of the proof that the bifinite objects form a cartesian closed subcategory. It contains all Scott domains (with Scott-continuous functions) and all dI-domains (with stable functions).

This work builds on results by Francois Lamarche (`A large category of domains').