Axiomatic Domain Theory

  • G.L.Cattani and M.P.Fiore. The Bicategory-Theoretic Solution of Recursive Domain Equations.  In Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, Electronic Notes in Theoretical Computer Science 172, 203-222 (2007).  [paper]

    •  
  • M.P.Fiore, E.Moggi and D.Sangiorgi. A fully-abstract model for the pi-calculus .  Information and Computation 179, 76-117 (2002) [ps file].  (Preliminary version in 11th Logic in Computer Science Conf. (LICS'96), pages 43-54.  IEEE, Computer Society Press, 1996.  [ ps file])

    •  
  • G.L.Cattani, M.P.Fiore and G.Winskel. A theory of recursive domains with applications to concurrency.  In 13th Logic in Computer Science Conf. (LICS'98), pages 214-225.  IEEE, Computer Society Press, 1998.  [ps file]

    •  
  • M.P.Fiore and K.Honda.  Recursive types in games: Axiomatics and process representation.  In 13th Logic in Computer Science Conf. (LICS'98), pages 345-356.  IEEE, Computer Society Press, 1998.  [ps file]

    •  
  • M.P.Fiore.  An enrichment theorem for an axiomatisation of categories of domains and continuous functions.  Mathematical Structures in Computer Science (Proceedings of the Workshop LDPL'95), 7:591-618, Cambridge University Press, 1997.  [ps file]

    •  
  • M.P.Fiore, G.D.Plotkin and J.Power. Complete cuboidal sets in axiomatic domain theory.  In 12th Logic in Computer Science Conf. (LICS'97), pages 268-279.  IEEE, Computer Society Press, 1997.  [ps file]

    •  
  • M.P.Fiore and G.D.Plotkin.  An extension of models of axiomatic domain theory to models of synthetic domain theory.  In Proceedings of the Computer Science Logic Conf. (CSL'96), volume 1258 of Lecture Notes in Computer Science, pages 129-149.  Springer-Verlag, 1997.  [ps file]

    •  
  • M.P.Fiore.  Enrichment and representation theorems for categories of domains and continuous functions.  Unpublished manuscript, 1996.  [ps file]

    •  
  • M.P.Fiore.  Axiomatic Domain Theory.  In Domains and denotational semantics: History, accomplishments and open problems, number 59 of Bulletin of the European Association for Theoretical Computer Science, pages 227-256, 1996.  [ps file]

    •  
  • M.P.Fiore.  A coinduction principle for recursive data types based on bisimulation. Information and Computation, 127(2):186-198, 1996.  [ps file]

    •  
  • M.P.Fiore.  Lifting as a KZ-doctrine.  In Proceedings of the 6th International Category Theory in Computer Science Conf. (CTCS'96), volume 953 of Lecture Notes in Computer Science, pages 146-158.  Springer-Verlag, 1995.  [ps file]

    •  
  • M.P.Fiore.  Order-enrichment for categories of partial maps. Mathematical Structures in Computer Science, 5:533-562, Cambridge University Press, 1995.  [ps file]

    •  
  • M.P.Fiore and G.D.Plotkin.  An Axiomatisation of computationally adequate domain-theoretic models of FPC.  In 9th Logic in Computer Science Conf. (LICS'94), pages 92-102.  IEEE, Computer Society Press, 1994.  [ps file]

    •