|
| EPSRC Reference: |
GR/T22049/01 |
| Title: |
Domain Theory for Concurrency---New Categorical Foundations |
| Principal Investigator: |
Professor G Winskel |
| Other Investigators: |
|
| Researcher Co-investigator: |
|
| Project Partner: |
|
| Department: |
Computer Laboratory |
| Organisation: |
University of Cambridge |
| Scheme: |
Standard Research |
| Starts: |
01 July 2005 |
Ends: |
31 December 2008 |
Value (£): |
278,179
|
| EPSRC Research Topic Classifications: |
| Fundamentals of Computing |
|
|
| EPSRC Industrial Sector Classifications: |
| No relevance to Underpinning Sectors |
|
|
| Related Grants: |
|
| Panel History: |
|
|
Summary |
|
It is proposed to develop a domain theory which provides a global mathematical setting for concurrent and mobile computation, a domain theory on new foundations which is extensible and scales up to the more intricate models needed in distributed systems, and feeds forward design and analytical techniques. Specifically, this proposal will work towards a domain theory which simultaneously handles independance models such as event structures, name generation as in the pi-Calculus, higher-order processes, nondeterministic dataflow, and possesses an operataional interpretation. It's techniques rest on recent successes in extracting process languages (HOPLA, affine-HOPLA and new-HOPLA), type disciplines and operational semantics from categories of presheaf models of processes (where domains are presheaf categories) and newly-found representations in terms of event structures.
|
| Final Report Summary |
|
It is proposed to develop a domain theory which provides a global mathematical setting for concurrent and mobile computation, a domain theory on new foundations which is extensible and scales up to the more intricate models needed in distributed systems, and feeds forward design and analytical techniques. Specifically, this proposal will work towards a domain theory which simultaneously handles independance models such as event structures, name generation as in the pi-Calculus, higher-order processes, nondeterministic dataflow, and possesses an operataional interpretation. It's techniques rest on recent successes in extracting process languages (HOPLA, affine-HOPLA and new-HOPLA), type disciplines and operational semantics from categories of presheaf models of processes (where domains are presheaf categories) and newly-found representations in terms of event structures.
|
| Further Information: |
|
| Organisation Website: |
http://www.cam.ac.uk |
|
|