{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:52:30Z","timestamp":1649033550108},"reference-count":5,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3619,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s1571-0661(04)80761-8","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"125-145","source":"Crossref","is-referenced-by-count":0,"title":["Polymorphic type-checking for the ramified theory of types of Principia Mathematica"],"prefix":"10.1016","volume":"85","author":[{"given":"M.Randall","family":"Holmes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"no. 2","key":"10.1016\/S1571-0661(04)80761-8_NEWBIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1305\/ndjfl\/1038949535","article-title":"\u201cSubsystems of Quine's \u201cNew Foundations\u201d with Predicativity Restrictions\u201d","volume":"vol. 40","author":"Holmes","year":"1999","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"10.1016\/S1571-0661(04)80761-8_NEWBIB2","unstructured":"Holmes, M. Randall, software files (in standard ML) rtt.sml (source for the type checker) and rttdemo.sml (demonstration file), accessible at http:\/\/math.boisestate.edu\/~holmes\/holmes\/rttcover.html."},{"issue":"no. 2","key":"10.1016\/S1571-0661(04)80761-8_NEWBIB3","doi-asserted-by":"crossref","DOI":"10.2178\/bsl\/1182353871","article-title":"\u201cTypes in mathematics and logic before 1940\u201d","volume":"vol. 8","author":"Kamareddine","year":"2002","journal-title":"Bulletin of Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)80761-8_NEWBIB4","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"\u201cA theory of type polymorphism in programming\u201d","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comp. Sys. Sci"},{"key":"10.1016\/S1571-0661(04)80761-8_NEWBIB5","series-title":"\u201cPrincipia Mathematica (to \u2217 56)\u201d","author":"Whitehead","year":"1967"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807618?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807618?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:53:09Z","timestamp":1549191189000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104807618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":5,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S1571066104807618"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80761-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}