{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:26:13Z","timestamp":1725456373326},"publisher-location":"Berlin\/Heidelberg","reference-count":26,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354054495X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013468","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:51:37Z","timestamp":1132728697000},"page":"219-235","source":"Crossref","is-referenced-by-count":3,"title":["Two results on set-theoretic polymorphism"],"prefix":"10.1007","author":[{"given":"Wesley","family":"Phoa","sequence":"first","affiliation":[]}],"member":"297","reference":[{"unstructured":"R. Amadio: Domains in a realizability framework, LIENS-TR 19\u201390.","key":"16_CR1"},{"unstructured":"E. S. Bainbridge, P. J. Freyd, A. Scedrov, P. J. Scott: Functorial polymorphism: preliminary report, Proceedings of the Programming Institute on Logical Foundations of Functional Programmin (Austin, 1987).","key":"16_CR2"},{"doi-asserted-by":"crossref","unstructured":"M. Beeson: Foundations of Constructive Mathematics, Springer, 1985.","key":"16_CR3","DOI":"10.1007\/978-3-642-68952-9"},{"unstructured":"P. J. Freyd: POLYNAT in Per, in Categories in Computer Science and Logic (Proc. Boulder 1987), Contemp. Math. 92 (1989).","key":"16_CR4"},{"unstructured":"P. J. Freyd: Functorial polymorphism, to appear.","key":"16_CR5"},{"unstructured":"P. J. Freyd: Structural polymorphism, to appear.","key":"16_CR6"},{"doi-asserted-by":"crossref","unstructured":"P. J. Freyd, P. Mulry, G. Rosolini, D.S. Scott: Extensional PERs, in: Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.","key":"16_CR7","DOI":"10.1109\/LICS.1990.113760"},{"unstructured":"J.-Y. Girard, Y. Lafont, P. Taylor: Proofs and Types, Cambridge University Press, 1989.","key":"16_CR8"},{"doi-asserted-by":"crossref","unstructured":"J.M.E. Hyland: The effective topos, in: The L.E.J. Brouwer Centenary Symposium (ed. A. S. Troelstra, D. van Dalen), North-Holland, 1982.","key":"16_CR9","DOI":"10.1016\/S0049-237X(09)70129-6"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0168-0072(88)90018-8","volume":"40","author":"J.M.E. Hyland","year":"1988","unstructured":"J.M.E. Hyland: A small complete category, Annals of Pure and Applied Logic 40 (1988) 135\u2013165.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"16_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/plms\/s3-60.1.1","volume":"60","author":"J.M.E. Hyland","year":"1990","unstructured":"J.M.E. Hyland, E.P. Robinson, G. Rosolini: The discrete objects in the effective topos, Proc. Lond. Math. Soc. (3) 60 (1990) 1\u201336.","journal-title":"Proc. Lond. Math. Soc."},{"unstructured":"J. M. E. Hyland, E. P. Robinson, G. Rosolini: Algebraic types in PER models.","key":"16_CR12"},{"unstructured":"P. T. Johnstone: Topos Theory, Academic Press, 1977.","key":"16_CR13"},{"doi-asserted-by":"crossref","unstructured":"S. Mac Lane: Categories for the Working Mathematician, Springer-Verlag, 1971.","key":"16_CR14","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1017\/S0305004100068146","volume":"106","author":"W. K. Phoa","year":"1989","unstructured":"W. K.-S. Phoa: Relative computability in the effective topos, Math. Proc. Camb. Phil. Soc. 106 (1989), 419\u2013422.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"doi-asserted-by":"crossref","unstructured":"W. K.-S. Phoa: Effective domains and intrinsic structure, in: Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.","key":"16_CR16","DOI":"10.1109\/LICS.1990.113762"},{"unstructured":"W. K.-S. Phoa: Reflectivity for categories of synthetic domains, submitted, 1990.","key":"16_CR17"},{"doi-asserted-by":"crossref","unstructured":"W. K.-S. Phoa: From term models to domains, to appear in the proceedings of Theoretical Aspects of Computer Software (Sendai, 1990).","key":"16_CR18","DOI":"10.1007\/3-540-54415-1_42"},{"unstructured":"W. K.-S. Phoa: Using fibrations to understand subtypes, in preparation.","key":"16_CR19"},{"doi-asserted-by":"crossref","unstructured":"G. D. Plotkin, M. B. Smyth: The category-theoretic solution of recursive domain equations, SIAM Journal of Computing vol. 11 no. 4, 1982.","key":"16_CR20","DOI":"10.1137\/0211062"},{"doi-asserted-by":"crossref","unstructured":"E. Robinson: How complete is PER? in: Proc. of 4th Annual Symposium on Logic in Computer Science, 1989.","key":"16_CR21","DOI":"10.1109\/LICS.1989.39165"},{"doi-asserted-by":"crossref","unstructured":"J. C. Reynolds: Polymorphism is not set-theoretic, Symposium on Semantics of Data Types (ed. Kahn, McQueen, Plotkin), Springer LNCS 173, 1984.","key":"16_CR22","DOI":"10.1007\/3-540-13346-1_7"},{"unstructured":"G. Rosolini: Uniformity, dinaturality and 2.","key":"16_CR23"},{"unstructured":"G. Rosolini: An Exper model for Quest, to appear in the proceedings of MFPS91.","key":"16_CR24"},{"unstructured":"G. Rosolini: About modest sets, to appear.","key":"16_CR25"},{"unstructured":"P. Taylor: The fixed point property in synthetic domain theory, to appear in the proceedings of the 6th Annual Symposium on Logic in Computer Science (Amsterdam, 1991).","key":"16_CR26"}],"container-title":["Lecture Notes in Computer Science","Category Theory and Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:29:27Z","timestamp":1586579367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354054495X"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0013468","relation":{},"subject":[]}}