A theory of recursive domains with applications to concurrency

We develop a 2-categorical theory for recursively defined domains. In particular we generalise the traditional approach based on order-theoretic structures to category-theoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf models for concurrent process calculi. Further we use the framework to study (open-map) bisimulation.

[1]  Gordon D. Plotkin,et al.  A Powerdomain for Countable Non-Determinism (Extended Abstract) , 1982, ICALP.

[2]  Marcelo P. Fiore,et al.  A coinduction principle for recursive data types based on bisimulation , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[3]  Kim G. Larsen,et al.  Model Checking via Reachability Testing for Timed Automata , 1997, TACAS.

[4]  J. Hyland.  First steps in synthetic domain theory , 1991 .

[5]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[6]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[7]  lawa Kanas,et al.  Metric Spaces , 2020, An Introduction to Functional Analysis.

[8]  Ross Street,et al.  Cauchy characterization of enriched categories , 1981 .

[9]  Thore Husfeldt,et al.  Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method , 1998, ICALP.

[10]  Daniele Turi,et al.  Axiomatic domain theory in categories of partial maps , 1998 .

[11]  Andrew M. Pitts,et al.  A co-Induction Principle for Recursively Defined Domains , 1994, Theor. Comput. Sci..

[12]  Gordon D. Plotkin,et al.  An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory , 1996, CSL.

[13]  Glynn Winskel,et al.  Presheaf Models for Concurrency , 1996, CSL.

[14]  Samson Abramsky,et al.  On Semantic Foundations for Applicative Multiprogramming , 1983, ICALP.

[15]  Andrew M. Pitts,et al.  Relational Properties of Domains , 1996, Inf. Comput..

[16]  F. William Lawvere,et al.  Metric spaces, generalized logic, and closed categories , 1973 .

[17]  Gonzalo E. Reyes,et al.  A Note on Frame Distributions , 1997 .

[18]  Ieke Moerdijk,et al.  Algebraic set theory , 1995 .

[19]  Daniel J. Lehmann.  Categories for fixpoint-semantics , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[20]  Ivan Damgård,et al.  Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free? , 1997 .

[21]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[22]  Glynn Winskel,et al.  A Theory of Recursive Domains with Applications to Concurrency , 1997 .

[23]  Harold Simmons,et al.  The glueing construction and lax limits , 1994, Mathematical Structures in Computer Science.

[24]  Ross Street,et al.  Fibrations in bicategories , 1980 .

[25]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[26]  Peter W. O'Hearn,et al.  Relational parametricity and local variables , 1993, POPL '93.

[27]  Kim G. Larsen,et al.  Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL , 1997, Proceedings Real-Time Systems Symposium.

[28]  Sally Popkorn,et al.  A Handbook of Categorical Algebra , 2009 .

[29]  Glynn Winskel,et al.  A Presheaf Semantics of Value-Passing Processes , 1996, CONCUR.

[30]  Jirí Adámek,et al.  A categorical generalization of Scott domains , 1997, Mathematical Structures in Computer Science.

[31]  P. J. Freyd.  Applications of Categories in Computer Science: Remarks on algebraically compact categories , 1992 .

[32]  Ieke Moerdijk,et al.  A Completeness Theorem for Open Maps , 1994, Ann. Pure Appl. Log..

[33]  P. Freyd.  Algebraically complete categories , 1991 .

[34]  Glynn Winskel,et al.  Presheaf Models for the pi-Calculus , 1997 .

[35]  Gordon D. Plotkin,et al.  Complete cuboidal sets in axiomatic domain theory , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[36]  Viggo Stoltenberg-hansen,et al.  In: Handbook of Logic in Computer Science , 1995 .

[37]  Charles Ehresmann,et al.  Cahiers de topologie et géometrie différentielle , 1982 .

[38]  R. Cramer,et al.  Span Programs and General Secure Multi-Party Computation , 1997 .