{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:21:40Z","timestamp":1770272500496,"version":"3.49.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540074163","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029523","type":"book-chapter","created":{"date-parts":[[2005,12,6]],"date-time":"2005-12-06T14:42:57Z","timestamp":1133880177000},"page":"147-165","source":"Crossref","is-referenced-by-count":18,"title":["An algebraic interpretation of the \u03bb\u03b2K-calculus and a labelled \u03bb-calculus"],"prefix":"10.1007","author":[{"given":"Jean-Jacques","family":"Levy","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Barendregt H.P.,\u201cSome extensional term models for combinatory logics and lambda-calculi\u201d,PhD thesis,Utrecht(1971)"},{"key":"8_CR2","unstructured":"Church A.,\u201cThe calculi of lambda conversion\u201d,Annals of Math.Studies,n\u22186, Princeton(1941)"},{"key":"8_CR3","unstructured":"Curry H.B.,Feys R.,\u201cCombinatory logic\u201d,Vol 1,North Holland(1958)"},{"key":"8_CR4","unstructured":"Hyland M.,to appear in the Rome conference(1975)"},{"key":"8_CR5","unstructured":"L\u00e9vy J-J.,\u201cR\u00e9ductions sures dans le lambda calcul\u201d,3\u2134 cycle,Univ of Paris(1974)"},{"key":"8_CR6","unstructured":"L\u00e9vy J-J.,\u201cR\u00e9ductions sures et optimales dans le lambda calcul\u201d,to appear"},{"key":"8_CR7","unstructured":"Milner R.,\u201cProcesses;A model of computing agents\u201d,Univ. of Edinburgh,Internal report(1973)"},{"key":"8_CR8","volume-title":"PhD thesis","author":"J.H. Morris","year":"1968","unstructured":"Morris J.H.,\u201cLambda calculus models of programming languages\u201d,PhD thesis, MIT,Cambridge(1968)"},{"key":"8_CR9","unstructured":"Nivat M.,\u201cSur l'interpr\u00e9tation des sh\u00e9mas de programmes monadiques\u201d,Rapport IRIA-LABORIA (1972)"},{"key":"8_CR10","unstructured":"Scott D.,\u201cContinuous lattices\u201d,Technical monograph,PRG-7,Oxford(1971)"},{"key":"8_CR11","unstructured":"Scott D.,\u201cData types as lattices\u201d,to appear in Springer Lectures Notes"},{"key":"8_CR12","unstructured":"Vuillemin J.,\u201cSyntaxe,s\u00e9mantique et axiomatique d'un langage de programmation simple\u201d,Th\u00e8se d'\u00e9tat,Univ. Paris 7(1974)"},{"key":"8_CR13","unstructured":"Wadsworth C.P.,\u201cSemantics and pragmatics of the lambda calculus\u201d,PhD thesis, Oxford (1971)"},{"key":"8_CR14","unstructured":"Welch P.,\u201cAnother problem of lambda calculus\u201d,Univ. of Kent,Private communication (1973)"},{"key":"8_CR15","unstructured":"Welch P.,to appear in the Rome conference (1975)"}],"container-title":["Lecture Notes in Computer Science","\u03bb-Calculus and Computer Science Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029523.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:59:41Z","timestamp":1607551181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540074163"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0029523","relation":{},"subject":[]}}