{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:39Z","timestamp":1760202459203,"version":"3.44.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,12,22]],"date-time":"1999-12-22T00:00:00Z","timestamp":945820800000},"content-version":"vor","delay-in-days":1635,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00283-o","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"5-23","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":20,"title":["A characterization of lambda definability in categorical models of implicit polymorphism"],"prefix":"10.1016","volume":"146","author":[{"given":"Moez","family":"Alimohamed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1993","series-title":"Categories for Types","author":"Crole","key":"10.1016\/0304-3975(94)00283-O_bib1"},{"year":"1990","series-title":"Categories, Allegories","author":"Freyd","key":"10.1016\/0304-3975(94)00283-O_bib2"},{"key":"10.1016\/0304-3975(94)00283-O_bib3","series-title":"Typed Lambda Calculi and Applications","first-page":"230","article-title":"A new characterization of lambda definability","volume":"Vol. 664","author":"Jung","year":"1993"},{"article-title":"Logiques, categories and machines","year":"1988","author":"Lafont","key":"10.1016\/0304-3975(94)00283-O_bib4"},{"key":"10.1016\/0304-3975(94)00283-O_bib5","article-title":"Introduction to Higher-Order Categorical Logic","volume":"Vol. 7","author":"Lambek","year":"1986"},{"key":"10.1016\/0304-3975(94)00283-O_bib6","series-title":"Proc. Summer Conf. Intuitionism and Proof Theory","first-page":"227","article-title":"An abstract notion of realizability for which intuitionistic predicate calculus is complete","author":"L\u00e4uchli","year":"1970"},{"key":"10.1016\/0304-3975(94)00283-O_bib7","series-title":"Proc. 1991 Conf. on Mathematical Foundations of Programming Semantics","first-page":"1","article-title":"Types, abstraction and parametric polymorphism","volume":"Vol. 598","author":"Ma","year":"1992"},{"key":"10.1016\/0304-3975(94)00283-O_bib8","series-title":"Proc. 15th ACM Symp. on Principles of Programming Languages","first-page":"28","article-title":"The essence of ML","author":"Mitchell","year":"1988"},{"key":"10.1016\/0304-3975(94)00283-O_bib9","series-title":"Logics of Programs","first-page":"225","article-title":"Second-order logical relations","volume":"Vol. 193","author":"Mitchell","year":"1985"},{"key":"10.1016\/0304-3975(94)00283-O_bib10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0168-0072(91)90067-V","article-title":"Kripke-style models for typed lambda calculus","volume":"51","author":"Mitchell","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(94)00283-O_bib11","series-title":"Computer Science Logic '92, Selected Papers","first-page":"352","article-title":"Notes on sconing and relators","volume":"Vol. 702","author":"Mitchell","year":"1993"},{"key":"10.1016\/0304-3975(94)00283-O_bib12","series-title":"Categories in Computer Science and Logic","first-page":"301","article-title":"Typed lambda calculus and cartesian closed categories","volume":"Vol. 92","author":"Mitchell","year":"1989"},{"key":"10.1016\/0304-3975(94)00283-O_bib13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1017\/S0960129500000074","article-title":"A category-theoretic account of program modules","volume":"1","author":"Moggi","year":"1991","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00283-O_bib14","unstructured":"P.W. O'Hearn and J.G. Riecke, Kripke logical relations and PCF, Inform. and Comput., to appear."},{"key":"10.1016\/0304-3975(94)00283-O_bib15","series-title":"Conf. Record 20th Symp. on Principles of Programming Languages","first-page":"171","article-title":"Relational parametricity and local variables","author":"O'Hearn","year":"1993"},{"key":"10.1016\/0304-3975(94)00283-O_bib16","series-title":"Proc. Category Theory and Computer Science","first-page":"12","article-title":"Polymorphism is set-theoretic, constructively","volume":"Vol. 283","author":"Pitts","year":"1987"},{"key":"10.1016\/0304-3975(94)00283-O_bib17","series-title":"Proc. 8th Ann. Symp. on Logic in Computer Science","first-page":"86","article-title":"Relational properties of recursively defined domains","author":"Pitts","year":"1993"},{"key":"10.1016\/0304-3975(94)00283-O_bib18","series-title":"To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism","first-page":"363","article-title":"Lambda-definability in the full type hierarchy","author":"Plotkin","year":"1980"},{"key":"10.1016\/0304-3975(94)00283-O_bib19","series-title":"Information Processing 83","first-page":"513","article-title":"Types, abstraction and parametric polymorphism","author":"Reynolds","year":"1983"},{"key":"10.1016\/0304-3975(94)00283-O_bib20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0166-218X(88)90070-4","article-title":"An intersection problems for finite automata","volume":"21","author":"Saks","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(94)00283-O_bib21","doi-asserted-by":"crossref","DOI":"10.2307\/2273831","article-title":"Categorical semantics for higher order polymorphic lambda calculus","volume":"52","author":"Seely","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(94)00283-O_bib22","series-title":"Proc. LMS Symp. on Applications of Catgeories in Computer Science","first-page":"258","article-title":"Reasoning about sequential functions via logical relations","volume":"Vol. 177","author":"Sieber","year":"1992"},{"key":"10.1016\/0304-3975(94)00283-O_bib23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0019-9958(85)80001-2","article-title":"Logical relations and the typed lambda calculus","volume":"65","author":"Statman","year":"1985","journal-title":"Inform. and Control"},{"year":"1967","series-title":"Fundamental Concepts in Programming Languages","author":"Strachey","key":"10.1016\/0304-3975(94)00283-O_bib24"},{"key":"10.1016\/0304-3975(94)00283-O_bib25","series-title":"4th Internat. Symp. on Functional Programming Languages and Computer Architecture","first-page":"347","article-title":"Theorems for free!","author":"Wadler","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400283O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400283O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:17:56Z","timestamp":1757477876000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400283O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400283O"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00283-o","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1995,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A characterization of lambda definability in categorical models of implicit polymorphism","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(94)00283-O","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}