PreSheaves in Domain Theory

  • 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])

  •  
  • M.P.Fiore and G.Rosolini.  Domains in HJournal of Theoretical Computer Science, 264(2):171-193, 2001.  [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 G.Rosolini.  Two models of Synthetic Domain Theory. Journal of Pure and Applied Algebra, 116:151-162, 1997.  [ps file]

  •  
  • M.P.Fiore and G.Rosolini.  The category of cpos from a synthetic viewpoint.  In Proceedings of the Mathematical Foundations of Programming Semantics Conf. (MFPS XIII), volume 6 of Electronic Notes in Theoretical Computer Science, 1997.  (URL: http://www.elsevier.nl/locate/entcs/volume6.html)

  •  
  • M.P.Fiore.  An enrichment theorem for an axiomatisation of categories of domains and continuous functionsMathematical 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]

  •