An Axiomatisation of Computationally Adequate 
                 Domain Theoretic Models of FPC

             Marcelo P. Fiore     Gordon D. Plotkin

                 Department of Computer Science 
          Laboratory for Foundations of Computer Science 
          University of Edinburgh, The King's Buildings 
                  Edinburgh EH9 3JZ, Scotland 
            <mf@dcs.ed.ac.uk>     <gdp@dcs.ed.ac.uk>

                           Synopsis

Categorical models of the metalanguage FPC (a type theory with sums,
products, exponentials and recursive types) are defined. Then, 
domain-theoretic models of FPC are axiomatised and a wide subclass 
of them ---the non-trivial and absolute ones--- are proved to be both 
computationally sound and adequate.

Examples include: the category of cpos and partial continuous functions
and functor categories over it.