Constructive category theory (No. 1)
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.
Unable to display preview. Download preview PDF.
- Kanda, A., Data types as effective objects, Theory of Computation Report, No. 22, Warwick Univ. (1977).Google Scholar
- 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).Google Scholar
- Kanda, A., Effective Solutions of Recursive Domain Equations, Ph.D. Thesis, Warwick Univ. (1980).Google Scholar
- 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).Google Scholar
- Plotkin & Smyth, The categorical solution of recursive domain equations, Proc. of the 18th FOCS Conference (1977).Google Scholar
- Scott, D., Some philosophical issues concenrning Theories of combinators. Proc. of the Conference on λ-calculus and Computer Science theory. LNCS No. 37.Google Scholar
- Scott, D., A Space of Retracts, Lecture Note, Bremen, Nov. (1979).Google Scholar
- McCarthy, J., A basis for a mathematical theory of computation, Computer Programming and formal systems, North-Holland, Amsterdam (1963).Google Scholar
- Scott, D, Data types as lattices, Lecture Note, Amsterdam, (1972).Google Scholar