This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Berry, G., Modeles completement adequats et stables des lambda-calculus types, These, Universite Paris VII, 1979.
Bishop, E., Foundations of Constructive Analysis, McGraw-Hill (N.Y.), 1967.
Constable, R., Constructive mathematics and automatic program writers, IFIP (1972), 229–233.
Curien, P., Algorithmes sequentiels sur structures de donnees concretes, These de 3e cycles, Universite Paris VII, 1979.
Egli, H. & R. Constable, Computability concepts for programming language semantics, Theor. Comp. Sci. 2 (1976).
Ehrich, H.-D. & V. Lohberger, Parametric specification of abstract data types, parametric substitution, and graph replacements, Proc. of workshop on "Graphentheoretische Konzepte in der Informatik", ed. — J. Mühlbacher, Hanser-Verl., München, 1977.
Freyd, P., Abelian Categories, Harper and Row, 1964.
Hennessy, M. & G. Plotkin, Full abstraction for a simple parallel programming language, MFCS '79, LNCS 74, 1979.
Herrlich, H. & D. Strecker, Category Theory, Allyn and Bacon, 1978.
Kahn, G. & G. Plotkin, Domaines concrets, Rapport No. 336, IRIA Laboria, 1978.
Kanda, A., Thesis, University of Warwick, 1979.
Kanda, A., Fully effective solutions of recursive domain equations, MFCS '79, LNCS 74, 1979.
Kanda, A. & D. Park, When are two effectively given domains identical?, Proc. 4th GI Conf. in T.C.S., Aachen, LNCS 67, 1979.
Lehmann, D., Categories for fixpoint semantics, Theory of Computation Report No. 15, University of Warwick, 1976.
Lehmann, D., On the algebra of order, Mathematics Institute, Hebrew University, Jerusalem.
Lehmann, D. & M. Smyth, The algebraic specification of data types; a synthetic approach, Report No. 119, Dept. of Computer Studies, University of Leeds, 1978 (also to appear in Math. Syst. Theory).
Martin Löf, P., Constructive mathematics and computer programming, 6th Int. Congress for Logic, Methodology and Phil. of Science, Hannover, 1979.
Myhill, J. & J. Shepherdson, Effective operations on partial recursive functions, Zeitschr. f. math. Logik u. Grundl. d. Math., 1956.
Plotkin, G., A power-domain construction, SIAM J. Comput. 5 (1976), 452–487.
Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967.
Scott, D., Continuous lattices, Lecture Notes in Math. 274, Springer, 1974.
Scott, D., Data types as lattices, SIAM J. Comput. 5 (1976), 522–587.
Smyth, M., Effectively given domains, Theor. Comp. Sci. 5 (1977), 257–274.
Smyth, M., Power Domains, J. Comp. Syst. Sci. 16, (1978), 23–26.
Smyth, M., D. Phil Thesis, University of Oxford, 1978.
Smyth, M. & G. Plotkin, Category-theoretic solution of recursive domain equations, D.A.I. Report 60, University of Edinburgh, 1978.
Smyth, M., Computability in Categories, Theory of Computation Report, University of Warwick, 1979.
Tang, A., Recursion theory and descriptive set theory in effectively given T0 spaces, Ph.D. Thesis, Princeton University (1974).
Bergstra, J. & J. Tucker, Algebraic specifications of computable and semi-computable data structures, Dept. of Computer Science Report 1W115, Math. Cent., Amsterdam, 1979.
Wand, M., Fixed-point constructions in order-enriched categories, TR 23, Computer Science Dept., Indiana University, 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smyth, M.B. (1980). Computability in categories. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_102
Download citation
DOI: https://doi.org/10.1007/3-540-10003-2_102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10003-4
Online ISBN: 978-3-540-39346-7
eBook Packages: Springer Book Archive