{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T17:50:14Z","timestamp":1767117014758},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,6,1]],"date-time":"1976-06-01T00:00:00Z","timestamp":202435200000},"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":13560,"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":[[1976,6]]},"DOI":"10.1016\/0304-3975(76)90009-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"97-114","source":"Crossref","is-referenced-by-count":73,"title":["An algebraic interpretation of the \u03bb\u03b2K-calculus; and an application of a labelled \u03bb-calculus"],"prefix":"10.1016","volume":"2","author":[{"given":"Jean-Jacques","family":"L\u00e9vy","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90009-8_BIB1","article-title":"Some extensional term models for combinatory logics and lambda-calculi","author":"Barendregt","year":"1971","journal-title":"Ph.D. Thesis"},{"key":"10.1016\/0304-3975(76)90009-8_BIB2","article-title":"The Calculi of Lambda Conversion","volume":"6","author":"Church","year":"1941"},{"key":"10.1016\/0304-3975(76)90009-8_BIB3","volume":"Vol. 1","author":"Curry","year":"1958"},{"key":"10.1016\/0304-3975(76)90009-8_BIB4","author":"Hyland","year":"1975","journal-title":"Proc. of the Rome conference"},{"key":"10.1016\/0304-3975(76)90009-8_BIB5","doi-asserted-by":"crossref","unstructured":"M. Hyland, A syntactic characterization of the equality in some models for the lambda calculus, J. London Math. Soc., to appear.","DOI":"10.1112\/jlms\/s2-12.3.361"},{"key":"10.1016\/0304-3975(76)90009-8_BIB6","volume":"7","author":"L\u00e9vy","year":"1974"},{"key":"10.1016\/0304-3975(76)90009-8_BIB7","unstructured":"J.-J. L\u00e9vy, R\u00e9ductions sures et optimales dans le lambda calcul, to appear."},{"key":"10.1016\/0304-3975(76)90009-8_BIB8","series-title":"Internal report","article-title":"Processes; A model of computing agents","author":"Milner","year":"1973"},{"key":"10.1016\/0304-3975(76)90009-8_BIB9","series-title":"Ph.D. Thesis","article-title":"Lambda calculus models of programming languages","author":"Morris","year":"1968"},{"key":"10.1016\/0304-3975(76)90009-8_BIB10","series-title":"Automata, Languages and Programming","article-title":"Langages alg\u00e9briques sue le magma libre et s\u00e9mantique des sch\u00e9mas de programme","author":"Nivat","year":"1972"},{"key":"10.1016\/0304-3975(76)90009-8_BIB11","article-title":"Continuous lattices","author":"Scott","year":"1971","journal-title":"Technical monograph"},{"key":"10.1016\/0304-3975(76)90009-8_BIB12","unstructured":"D. Scott, Data Types as Lattices, to appear in Springer Lecture Notes."},{"key":"10.1016\/0304-3975(76)90009-8_BIB13","article-title":"Syntaxe, s\u00e9mantique et axiomatique d'un langage de programmation simple","volume":"7","author":"Vuillemin","year":"1974"},{"key":"10.1016\/0304-3975(76)90009-8_BIB14","article-title":"Semantics and pragmatics of the lambda calculus","author":"Wadsworth","year":"1971","journal-title":"Ph.D. Thesis"},{"key":"10.1016\/0304-3975(76)90009-8_BIB15","series-title":"Another problem of the lambda calculus","author":"Welch","year":"1973"},{"key":"10.1016\/0304-3975(76)90009-8_BIB16","author":"Welch","year":"1975","journal-title":"Proc. of the Rome conference"},{"key":"10.1016\/0304-3975(76)90009-8_BIB17","doi-asserted-by":"crossref","unstructured":"C.P. Wadsworth, Approximate reduction and \u03bb-calculus models, SIAM J., to appear.","DOI":"10.1137\/0207028"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900098?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900098?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:20:56Z","timestamp":1555111256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,6]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,6]]}},"alternative-id":["0304397576900098"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90009-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,6]]}}}