{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:08:49Z","timestamp":1648807729526},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":8720,"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":[[1989,9]]},"DOI":"10.1016\/0304-3975(89)90029-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"129-139","source":"Crossref","is-referenced-by-count":2,"title":["Decidability of the restriction equational theory in the partial lambda calculus"],"prefix":"10.1016","volume":"67","author":[{"given":"Ram\u00f3n","family":"Pino Perez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90029-7_BIB1","series-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"Curien","year":"1986"},{"key":"10.1016\/0304-3975(89)90029-7_BIB2","doi-asserted-by":"crossref","unstructured":"P.L. Curien and A. Obtulowicz, Partiality, cartesian closedness and toposes, Inform. and Control, to appear.","DOI":"10.1016\/0890-5401(89)90023-0"},{"key":"10.1016\/0304-3975(89)90029-7_BIB3","article-title":"Logic of Programming and Calculi of Discrete Design","volume":"Vol. F36","author":"Huet","year":"1987"},{"key":"10.1016\/0304-3975(89)90029-7_BIB4","series-title":"Ph.D. Thesis","article-title":"The partial lambda calculus","author":"Moggi","year":"1988"},{"key":"10.1016\/0304-3975(89)90029-7_BIB5","series-title":"Rapport LIENS No. 11","article-title":"Le lambda calcul partiel","author":"Pino P\u00e9rez","year":"1987"},{"key":"10.1016\/0304-3975(89)90029-7_BIB6","author":"Pino P\u00e9rez","year":"1988","journal-title":"A standard model for partial lambda calculus"},{"key":"10.1016\/0304-3975(89)90029-7_BIB7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name, call-by-value and the \u03bb-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90029-7_BIB8","author":"Plotkin","year":"1985","journal-title":"Types and partial categories"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:56:15Z","timestamp":1555113375000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0304397589900297"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90029-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}