{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:25:28Z","timestamp":1649085928581},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4702,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0304-3975(99)00086-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:21:37Z","timestamp":1027606897000},"page":"277-290","source":"Crossref","is-referenced-by-count":5,"title":["On principal types of combinators"],"prefix":"10.1016","volume":"247","author":[{"given":"Sabine","family":"Broda","sequence":"first","affiliation":[]},{"given":"Lu\u0131\u0301s","family":"Damas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00086-9_BIB1","unstructured":"A.R. Anderson, N.D. Belnap, Entailment. The Logic of Relevance and Necessity, vol. 1. Princeton University Press, Princeton, NJ, 1975."},{"key":"10.1016\/S0304-3975(99)00086-9_BIB2","series-title":"The Lambda Calculus, its Syntax and Semantics","author":"Barendregt","year":"1981"},{"key":"10.1016\/S0304-3975(99)00086-9_BIB3","first-page":"117","article-title":"Lambda calculi with types","volume":"vol. 2","author":"Barendregt","year":"1992"},{"key":"10.1016\/S0304-3975(99)00086-9_BIB4","unstructured":"H.B. Curry, R. Feys, Combinatory Logic, vol. 1, North-Holland, Amsterdam, 1958."},{"key":"10.1016\/S0304-3975(99)00086-9_BIB5","first-page":"29","article-title":"The mathematical language AUTOMATH, its usage and some of its extensions","volume":"vol. 125","author":"de Bruijn","year":"1970"},{"key":"10.1016\/S0304-3975(99)00086-9_BIB6","unstructured":"G.H. Helman, Restricted lambda abstraction and the interpretation of some non-classical logics, Ph.D. Thesis, Philosophy Department, University of Pittsburgh, 1977."},{"key":"10.1016\/S0304-3975(99)00086-9_BIB7","first-page":"29","article-title":"The principal type-scheme of an object in combinatory logic","volume":"146","author":"Hindley","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(99)00086-9_BIB8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(89)90100-X","article-title":"BCK-combinators and linear \u03bb-terms have types","volume":"64","author":"Hindley","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00086-9_BIB9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(93)90171-O","article-title":"Principal types of BCK-lambda-terms","volume":"107","author":"Hirokawa","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00086-9_BIB10","series-title":"To H. B. Curry","first-page":"479","article-title":"The formulae-as-types notion of construction","author":"Howard","year":"1980"},{"key":"10.1016\/S0304-3975(99)00086-9_BIB11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1305\/ndjfl\/1093957574","article-title":"Notes on the axiomatics of the propositional calculus","volume":"4","author":"Meredith","year":"1963","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/S0304-3975(99)00086-9_BIB12","first-page":"267","article-title":"Positive logic and \u03bb-constants","volume":"3","author":"Meredith","year":"1978","journal-title":"Studia Logica"},{"key":"10.1016\/S0304-3975(99)00086-9_BIB13","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/0304-3975(94)90114-7","article-title":"Combinatory abstraction using B, B\u2032 and friends","volume":"135","author":"Trigg","year":"1994","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000869?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000869?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:24:00Z","timestamp":1556450640000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0304397599000869"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00086-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}