Skip to main content

Category of Δ-functors

  • Conference paper
  • First Online:
Mathematical Foundations of Programming Semantics (MFPS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 802))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Adamek J., Herrlich H., Strecker G. [1990] Abstract and Concrete Categories, John Wiley&Sons, 1990

    Google Scholar 

  • Fiech A., Huth M. [1991] Algebraic Domains of Natural Transformations, Technical Report, KSU, Comp. Sci., 1991

    Google Scholar 

  • Fiech A. [1992] Colimits in the Category CPO, Tech. Report, KSU, Comp. Sci.92

    Google Scholar 

  • Fiech A. [1993] A Denotational Model for Polymorphic Lambda Calculus with Subtyping, dissertation, Kansas State University, Dept. of Comp. and Inf. Sci., 1993

    Google Scholar 

  • Fiech A., Schmidt D. [1993] Polymorphic Lambda Calculus and Subtyping, in preparation

    Google Scholar 

  • O'Hearn P., Tennent R. [1993] Relational Parametricity and Local Variables, Proc 20th ACM Symp Princ Prog Lags, Charleston, SC, Jan 1993

    Google Scholar 

  • Oles F. [1982] A Category-Theoretic Approach to the Semantics of Programming Languages, Ph.D. thesis, Syracuse University, Syracuse, NY, 1982

    Google Scholar 

  • 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 1985

    Google Scholar 

  • Plotkin G. [1976] A powerdomain construction, SIAM J. of Computing, vol. 5, pp. 452–487

    Google Scholar 

  • Reynolds J. [1980] Using Category Theory to Design Implicit Conversions and Generic Operators, in LNCS 94, p. 211–258, Springer Verlag 1980

    Google Scholar 

  • Schmidt D. [1986] Denotational Semantics, Allyn and Bacon, Inc. 1986

    Google Scholar 

  • Schmidt D. [1990] Action Semantics Based Language Design, SOFSEM '90 Zotavovna Sirena, Janske Lazne, Krkonose, Nov. 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Stephen Brookes Michael Main Austin Melton Michael Mislove David Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fiech, A. (1994). Category of Δ-functors. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1993. Lecture Notes in Computer Science, vol 802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58027-1_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-58027-1_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58027-0

  • Online ISBN: 978-3-540-48419-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics