{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:22Z","timestamp":1725663622532},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544159"},{"type":"electronic","value":"9783540476177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54415-1_42","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:47:06Z","timestamp":1330210026000},"page":"88-111","source":"Crossref","is-referenced-by-count":1,"title":["From term models to domains"],"prefix":"10.1007","author":[{"given":"Wesley","family":"Phoa","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi, G. Plotkin: A PER model of polymorphism and recursive types, in: Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.","DOI":"10.1109\/LICS.1990.113761"},{"key":"5_CR2","unstructured":"H. P. Barendregt: The Lambda-Calculus: Its Syntax and Semantics (revised edition), North-Holland, 1984."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"M. Beeson: Foundations of Constructive Mathematics, Springer, 1985.","DOI":"10.1007\/978-3-642-68952-9"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"T. Coquand, G. Huet: Constructions: a higher-order proof system for mechanizing mathematics, in: EUROCAL '85: European Conference on Computer Algebra, Springer, 1985.","DOI":"10.1007\/3-540-15983-5_13"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"P. Freyd, P. Mulry, G. Rosolini, D.S. Scott: Extensional PERs, in: Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.","DOI":"10.1109\/LICS.1990.113760"},{"key":"5_CR6","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.","DOI":"10.1016\/S0049-237X(09)70129-6"},{"key":"5_CR7","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"},{"key":"5_CR8","unstructured":"J.M.E. Hyland: Synthetic domains\u2014the story so far, Abstracts EACTS, 1990."},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1090\/conm\/092\/1003199","volume":"92","author":"J.M.E. Hyland","year":"1989","unstructured":"J.M.E. Hyland, A.M. Pitts: The theory of constructions, categorical semantics and topos-theoretic models, in Categories in Computer Science and Logic (Proc. Boulder 1987), Contemp. Math. 92 (1989) 137\u2013199.","journal-title":"Contemp. Math."},{"issue":"3","key":"5_CR10","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."},{"key":"5_CR11","unstructured":"P. T. Johnstone: Topos Theory, Academic Press, 1977."},{"key":"5_CR12","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.","DOI":"10.1109\/LICS.1990.113762"},{"key":"5_CR13","unstructured":"W. K.-S. Phoa: Building domains from models of computation, submitted."},{"key":"5_CR14","unstructured":"W. K.-S. Phoa: Domain Theory in Realizability Toposes, Ph.D. dissertation, University of Cambridge, November 1990."},{"key":"5_CR15","unstructured":"W. K.-S. Phoa: Reflectivity for categories of synthetic domains, submitted, 1990."},{"key":"5_CR16","unstructured":"W. K.-S. Phoa: Two results on set-theoretic polymorphism, submitted, 1991."},{"key":"5_CR17","unstructured":"W. K.-S. Phoa, P. Taylor: The synthetic Plotkin powerdomain, preprint."},{"key":"5_CR18","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.","DOI":"10.1137\/0211062"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"E. Robinson: How complete is PER? in: Proc. of 4th Annual Symposium on Logic in Computer Science, 1989.","DOI":"10.1109\/LICS.1989.39165"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"G. Rosolini: Categories and effective computations, in: Lecture Notes in Computer Science 283, Springer, 1987.","DOI":"10.1007\/3-540-18508-9_17"},{"issue":"3","key":"5_CR21","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D.S. Scott","year":"1976","unstructured":"D.S. Scott: Data types as lattices, SIAM J. Comput. 5 (3) (1976) 522\u2013587.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54415-1_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:10Z","timestamp":1605646450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54415-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544159","9783540476177"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-54415-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}