Abstract
In this paper, a notion of effective categories and effective functions is presented as an attempt to handle effective properties of categories with effectiveness constraint. Using this notion, we study a categorical generalization of the Kleene 1st recursion theorem, as the effectively initial algebra theorem. Various effective categories and effective functors are studied.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kanda, A., Data types as effective objects, Theory of Computation Report, No. 22, Warwick Univ. (1977).
Kanda, A., Fully effective solutions of recursive domain equations, Proc. of the M.F.C.S. '79. Lecture Note in Computer Science, No. 74 (1979).
Kanda, A., Effective Solutions of Recursive Domain Equations, Ph.D. Thesis, Warwick Univ. (1980).
Kanda & Park, When are two effectively given domains identical? Proc. of the 4th GT. Theoretical Computer Science Symposium, Lecture Note in Computer Science, No. 67 (1979).
Plotkin & Smyth, The categorical solution of recursive domain equations, Proc. of the 18th FOCS Conference (1977).
Scott, D., Some philosophical issues concenrning Theories of combinators. Proc. of the Conference on λ-calculus and Computer Science theory. LNCS No. 37.
Scott, D., A Space of Retracts, Lecture Note, Bremen, Nov. (1979).
McCarthy, J., A basis for a mathematical theory of computation, Computer Programming and formal systems, North-Holland, Amsterdam (1963).
Scott, D, Data types as lattices, Lecture Note, Amsterdam, (1972).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanda, A. (1981). Constructive category theory (No. 1). In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_125
Download citation
DOI: https://doi.org/10.1007/3-540-10856-4_125
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10856-6
Online ISBN: 978-3-540-38769-5
eBook Packages: Springer Book Archive