{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T23:15:20Z","timestamp":1792970120193,"version":"4.5.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1997,11]]},"abstract":"<jats:p>\n                    This paper introduces trust analysis for higher-order \n\nlanguages. Trust analysis encourages the \n\nprogrammer to make explicit the trustworthiness of data, and \n\nin return it can guarantee that \n\nno mistakes with respect to trust will be made at run-time. \n\nWe present a confluent \u03bb-calculus \n\nwith explicit trust operations, and we equip it with a \n\ntrust-type system which has the subject \n\nreduction property. Trust information is presented as \n\nannotations of the underlying Curry \n\ntypes, and type inference is computable in\n                    <jats:italic>O<\/jats:italic>\n                    (\n                    <jats:italic>n<\/jats:italic>\n                    <jats:sup>3<\/jats:sup>\n                    ) time.\n                  <\/jats:p>","DOI":"10.1017\/s0956796897002906","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:26:15Z","timestamp":1027761975000},"page":"557-591","source":"Crossref","is-referenced-by-count":53,"title":["Trust in the \u03bb-calculus"],"prefix":"10.1017","volume":"7","author":[{"given":"P.","family":"\u00d8RB\u00c6K","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"PALSBERG","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[1997,11,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796897002906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:35:02Z","timestamp":1779834902000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796897002906\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0956796897002906"],"URL":"https:\/\/doi.org\/10.1017\/s0956796897002906","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}