Cartesian closed categories of enumerations for effective type structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 173 LNCS, Issue , 1984, Pages 235-255

  Longo, G ^a   Moggi, E ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976043146     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-13346-1_12     Document Type: Conference Paper

References (21)

1. Barendregt, H. & Longo, G. (1982) "Recursion Theoretic operators and morphisms of numbered sets" Fundamenta Matematicae CXIX.
2. Bernardi, C., Sorbi, A. (1983) "Classifying positive equivalence relations" J. Symb. Logic, vol. 48, 3, 529-539.
3. Ershov, Yu. L. (1973) "The theory of A-spaces” Algebra and Logic, vol. 12, 4, 209-232.
4. Ershov, Yu. L. (1973/5) "Theorie der Numerierungen I-II", Zeit. Math. Logik vol. 19/21, 289-388/473-584.
5. Ershov, Yu. L. (1977) "Model C of partial continuous functionals" Logic Colloquium 76 (Gandy, Hyland eds.) North Holland.
6. Giannini, P., Longo, G. (1983) "Effectively given domains and lambda-calculus semantics" Info. Contr. (to appear).
7. Kleene, S.C. (1959) "Countable functionals" In H. Heyting (ed.) Constructivity in Mathematics, North-Holland, 81-100.
8. Kreisel, G. (1959)"Interpretation of Analysis by means of functionals of finite type" Constructivity in Mathematics.
9. Lambek, J. (1980) "From X-calculus to Cartesian Closed Categories”, In R. Bindley, J. Seldin (eds.) To H.B. Curry: essays in Combinatory Logic, lambda calculus and Formalisms Academic Press.
10. Longo, G. (1982) "Hereditary partial functionals in any finite type (Preliminary note)". Forsch. Inst. Math. E.T.H. Zürich.
11. Longo, G. (1983) "Set theoretical models of λ-calculus: theories, expansions, isomorphisms" Ann. Pure Applied Logic (formerely: Ann. Math. Logic) 24, 153-188.
12. Longo, G. (1984) "Continuous structures and analytic methods in Computer Science" In B. Courcelle (ed.), Proceedings of CAAP, Cambridge University Press.
13. Longo, G., Moggi, E. (1983) "The hereditary partial functionals and „recursion theory in higher types" J. Symb. Logic (to appear).
14. Longo, G-, Moggi, E. (1983b) "Gödel-numberings, principal morphisms, combinatory algebras" Nota Sci. D.I., Pisa.
15. Myhill, J., Shepherdson, J. (1955) ".Effective operations on partial recursive functions" Zeit. Math. Logik Grund. Math. vol. 1, 310-317.
16. Normann, D. (1980) Recursion on the countable functionals, LNM 811 Springer-Verlag, Berlin.
17. Rogers, H. (1967) "Theory of recursive functions and effective computability" Me Graw-Hill.
18. Scott, D.S. (1972) "Continuous lattices" In F. Lawvere (ed.) Toposes, Algebraic Geometry and Logic, LNM 274, Springer-Verlag.
19. Scott, D.S. (1980) "Relating theories of the X-Galculus" Same volume as Lambék (1980).
20. Scott, D.S. (1982) "Some ordered sets in Computer Science" In I. Rival (ed.) Ordered sets, Reidel.
21. Visser, A. (1980) "Numerations lambda-calculus and arithmetic" Same volume as Lambek (1980).