{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:44Z","timestamp":1725456044970},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051662X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0018348","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:50:09Z","timestamp":1132645809000},"page":"118-127","source":"Crossref","is-referenced-by-count":4,"title":["A note on categorical datatypes"],"prefix":"10.1007","author":[{"given":"G. C.","family":"Wralth","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","first-page":"131","volume":"173","author":"K.B. Bruce","year":"1984","unstructured":"K.B. Bruce, A.R. Meyer (1984) The semantics of second order polymorphic lambda-calculus. SLNCS 173 pp 131\u2013144","journal-title":"SLNCS"},{"key":"8_CR2","unstructured":"J.Bell (1988) Toposes and Local set Theories. Oxford University Press"},{"key":"8_CR3","first-page":"85","volume":"59","author":"T. Coquand","year":"1988","unstructured":"T. Coquand, V. Breazu-Tannen (1988) Extensional Models of Polymorphism. T.C.S. 59 pp 85\u2013114","journal-title":"T.C.S."},{"key":"8_CR4","unstructured":"Jon Fairbairn (1985) Design and Implementation of a simple typed language based on the lambda-calculus. University of Cambridge Technical Report No. 75"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"T. Hagino (1987) A Typed Lambda Calculus with Categorical Type Constructors. Preprint.","DOI":"10.1007\/3-540-18508-9_24"},{"key":"8_CR6","unstructured":"T. Hagino (1987) A Categorical Programming Language. Thesis. Edinburgh University."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"D.B.MacQueen, R.Sethi, G.Plotkin (1984) An Ideal Model for Recursive Polymorphic Types. 11-th Annual ACM Symposium on the Principles of Programming Languages.","DOI":"10.1145\/800017.800528"},{"key":"8_CR8","unstructured":"P. Mendler (1987) Inductive Definitions in type Theory. Thesis \u2014 Cornell University."},{"key":"8_CR9","first-page":"61","volume":"193","author":"C. Mendler","year":"1985","unstructured":"Mendler, Constable (1985) Recursive Definitions in Type Theory. LNCS 193 pp 61\u201378","journal-title":"LNCS"},{"key":"8_CR10","first-page":"145","volume":"173","author":"J.C. Reynolds","year":"1984","unstructured":"J.C. Reynolds (1984) Polymorphism is not Set-Theoretic. SLNCS 173 pp 145\u2013156","journal-title":"SLNCS"},{"key":"8_CR11","first-page":"97","volume":"185","author":"J.C. Reynolds","year":"1985","unstructured":"J.C. Reynolds (1985) Three approaches to type structure. TAPSOFT. SLNCS 185 pp 97\u2013138","journal-title":"TAPSOFT. SLNCS"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"A.Pitts (1987) Polymorphism is Set-Theoretic Constructively. Preprint. University of Sussex.","DOI":"10.1007\/3-540-18508-9_18"}],"container-title":["Lecture Notes in Computer Science","Category Theory and Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018348.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:41:08Z","timestamp":1607550068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051662X"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0018348","relation":{},"subject":[]}}