Category of Δ-functors

  • Adrian Fiech
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 802)


We define the category FuncΔ with functors F:DF→ Scott (DFεCPO) as objects and pairs \((f:D_F \to D_G ,\eta :F\mathop \to \limits^ \cdot G \circ f)\) as morphisms (η is a natural transformation). We show that this category is closed under the common domain theoretical operations +,X,⊥ and →. The category FuncΔ is an O-category and all the operations we define on it are continuous functors, so we will be able to solve recursive equations in FuncΔ. We also show that if we restrict FuncΔ to functors that preserve directed colimits then the category is not closed under the → operation. The category FuncΔ is a basis for a model of second-order lambda calculus with subtyping.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Adamek J., Herrlich H., Strecker G. [1990] Abstract and Concrete Categories, John Wiley&Sons, 1990Google Scholar
  2. Fiech A., Huth M. [1991] Algebraic Domains of Natural Transformations, Technical Report, KSU, Comp. Sci., 1991Google Scholar
  3. Fiech A. [1992] Colimits in the Category CPO, Tech. Report, KSU, Comp. Sci.92Google Scholar
  4. Fiech A. [1993] A Denotational Model for Polymorphic Lambda Calculus with Subtyping, dissertation, Kansas State University, Dept. of Comp. and Inf. Sci., 1993Google Scholar
  5. Fiech A., Schmidt D. [1993] Polymorphic Lambda Calculus and Subtyping, in preparationGoogle Scholar
  6. O'Hearn P., Tennent R. [1993] Relational Parametricity and Local Variables, Proc 20th ACM Symp Princ Prog Lags, Charleston, SC, Jan 1993Google Scholar
  7. Oles F. [1982] A Category-Theoretic Approach to the Semantics of Programming Languages, Ph.D. thesis, Syracuse University, Syracuse, NY, 1982Google Scholar
  8. Oles F. [1985] Type Algebras, Functor Categories and Stock Structure. In M. Nivat and J. Reynolds, editors, Algebraic Methods in Semantics, Cambridge University Press, Cambridge 1985Google Scholar
  9. Plotkin G. [1976] A powerdomain construction, SIAM J. of Computing, vol. 5, pp. 452–487Google Scholar
  10. Reynolds J. [1980] Using Category Theory to Design Implicit Conversions and Generic Operators, in LNCS 94, p. 211–258, Springer Verlag 1980Google Scholar
  11. Schmidt D. [1986] Denotational Semantics, Allyn and Bacon, Inc. 1986Google Scholar
  12. Schmidt D. [1990] Action Semantics Based Language Design, SOFSEM '90 Zotavovna Sirena, Janske Lazne, Krkonose, Nov. 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Adrian Fiech
    • 1
  1. 1.Department of Computing and Information SciencesKansas State UniversityUSA

Personalised recommendations