Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Barendregt, H. & Longo, G. (1982) "Recursion Theoretic operators and morphisms of numbered sets" Fundamenta Matematicae CXIX.
Bernardi, C., Sorbi, A. (1983) "Classifying positive equivalence relations" J. Symb. Logic, vol. 48,3, 529–539.
Ershov, Yu. L. (1973) "The theory of A-spaces" Algebra and Logic, vol. 12,4, 209–232.
Ershov, Yu. L. (1973/5) "Theorie der Numerierungen I–II", Zeit. Math. Logik vol. 19/21, 289–388/473–584.
Ershov, Yu. L. (1977) "Model C of partial continuous functionals" Logic Colloquium 76 (Gandy, Hyland eds.) North Holland.
Giannini, P., Longo, G. (1983) "Effectively given domains and lambda-calculus semantics" Info. Contr. (to appear).
Kleene, S.C. (1959) "Countable functionals" In H. Heyting (ed.) Constructivity in Mathematics, North-Holland, 81–100.
Kreisel, G. (1959) "Interpretation of Analysis by means of functionals of finite type" ibidem.
Lambek, J. (1980) "From λ-calculus to Cartesian Closed Categories", In R. Hindley, J. Seldin (eds.) To H.B. Curry: essays in Combinatory Logic, lambda calculus and Formalisms Academic Press.
Longo, G. (1982) "Hereditary partial functionals in any finite type (Preliminary note)". Forsch. Inst. Math. E.T.H. Zürich.
Longo, G. (1983) "Set theoretical models of λ-calculus: theories, expansions, isomorphisms" Ann. Pure Applied Logic (formerly: Ann. Math. Logic) 24, 153–188.
Longo, G. (1984) "Continuous structures and analytic methods in Computer Science" In B. Courcelle (ed.), Proceedings of CAAP, Cambridge University Press.
Longo, G., Moggi, E. (1983) "The hereditary partial functionals and recursion theory in higher types" J. Symb. Logic (to appear).
Longo, G., Moggi, E. (1983b) "Gödel-numberings, principal morphisms, combinatory algebras" Nota Sci. D.I., Pisa.
Myhill, J., Shepherdson, J. (1955) "Effective operations on partial recursive functions" Zeit. Math. Logik Grund. Math. vol. 1, 310–317.
Normann, D. (1980) Recursion on the countable functionals, LNM 811 Springer-Verlag, Berlin.
Rogers, H. (1967) "Theory of recursive functions and effective computability" Mc Graw-Hill.
Scott, D.S. (1972) "Continuous lattices" In F. Lawvere (ed.) Toposes, Algebraic Geometry and Logic, LNM 274, Springer-Verlag.
Scott, D.S. (1980) "Relating theories of the λ-Calculus" Same volume as Lambek (1980).
Scott, D.S. (1982) "Some ordered sets in Computer Science" In I. Rival (ed.) Ordered sets, Reidel.
Visser, A. (1980) "Numerations lambda-calculus and arithmetic" Same volume as Lambek (1980).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Longo, G., Moggi, E. (1984). Cartesian closed categories of enumerations for effective type structures. In: Kahn, G., MacQueen, D.B., Plotkin, G. (eds) Semantics of Data Types. SDT 1984. Lecture Notes in Computer Science, vol 173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13346-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-13346-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13346-9
Online ISBN: 978-3-540-38891-3
eBook Packages: Springer Book Archive