{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:15:04Z","timestamp":1774988104108,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0304-3975(00)00174-2","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T16:53:12Z","timestamp":1036083192000},"page":"249-272","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":28,"title":["A typed context calculus"],"prefix":"10.1016","volume":"266","author":[{"given":"Masatomo","family":"Hashimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsushi","family":"Ohori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0304-3975(00)00174-2_BIB1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","article-title":"Explicit substitutions","volume":"1","author":"Abadi","year":"1991","journal-title":"J. Funct. Program"},{"issue":"2","key":"10.1016\/S0304-3975(00)00174-2_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0304-3975(97)00150-3","article-title":"A lambda-calculus for dynamic binding","volume":"192","author":"Dami","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00174-2_BIB3","doi-asserted-by":"crossref","unstructured":"G. Dowek, T. Hardin, C. Kirchner, Higher-order unification via explicit substitutions, in:D. Kozen (Ed.), Proc. Logic in Computer Science, June 1995, pp. 366\u2013374.","DOI":"10.1109\/LICS.1995.523271"},{"issue":"6","key":"10.1016\/S0304-3975(00)00174-2_BIB4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/2.587548","article-title":"The feel of Java","volume":"30","author":"Gosling","year":"1997","journal-title":"Computer"},{"key":"10.1016\/S0304-3975(00)00174-2_BIB5","doi-asserted-by":"crossref","unstructured":"M. Hashimoto, First-class contexts in ML, in: Proc. 4th Asian Comput. Sci. Conf. Lecture Notes in Computer Science, vol. 1538, Springer, Berlin, 1998, pp. 206\u2013223.","DOI":"10.1007\/3-540-49366-2_16"},{"key":"10.1016\/S0304-3975(00)00174-2_BIB6","doi-asserted-by":"crossref","unstructured":"H. Herbelin, A \u03bb-calculus structure isomorphic to sequent calculus structure, Proc. Annu. Conf. of the European Association for Computer Science Logic, CSL\u201994, 1994.","DOI":"10.1007\/BFb0022247"},{"key":"10.1016\/S0304-3975(00)00174-2_BIB7","series-title":"Essays on Combinatory Logic, Lambda-Calculus and Formalism","first-page":"476","article-title":"The formulae-as-types notion of construction","author":"Howard","year":"1980"},{"issue":"6","key":"10.1016\/S0304-3975(00)00174-2_BIB8","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1023\/A:1005311532280","article-title":"Partial proof trees as building blocks for a categorized grammars","volume":"20","author":"Joshi","year":"1997","journal-title":"Linguist. Philos."},{"key":"10.1016\/S0304-3975(00)00174-2_BIB9","doi-asserted-by":"crossref","unstructured":"S. Kahrs, Context rewriting, in: Conditional Term Rewriting Systems, 3rd Internat. Workshop, CTRS-92 Proc. 1993, pp. 21\u201335.","DOI":"10.1007\/3-540-56393-8_2"},{"key":"10.1016\/S0304-3975(00)00174-2_BIB10","doi-asserted-by":"crossref","unstructured":"S. Lee, D. Friedman, Enriching the Lambda calculus with contexts: towards a theory of incremental program construction, Proc. Internat. Conf. on Functional Programming, ACM SIGPLAN Notices, 1996, pp. 239\u2013250.","DOI":"10.1145\/232627.232652"},{"key":"10.1016\/S0304-3975(00)00174-2_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of typed \u03bb-calculi","volume":"4","author":"Milner","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00174-2_BIB12","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"key":"10.1016\/S0304-3975(00)00174-2_BIB13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00174-2_BIB14","doi-asserted-by":"crossref","unstructured":"M. Sato, T. Sakurai, R. Burstall, Explicit environments, in: Proc. Typed Lambda Calculi and Applications (TLCA\u201999), Lecture Notes in Computer Science, vol. 1581, Springer, Berlin, 1999, pp. 340\u2013354.","DOI":"10.1007\/3-540-48959-2_24"},{"key":"10.1016\/S0304-3975(00)00174-2_BIB15","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1006\/inco.1995.1057","article-title":"Parallel reductions in \u03bb-calculus","volume":"118","author":"Takahashi","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00174-2_BIB16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(93)90240-T","article-title":"A theory of binding structures and applications to rewriting","volume":"112","author":"Talcott","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00174-2_BIB17","doi-asserted-by":"crossref","unstructured":"J. Wells, R. Vestergaard, Confluent equational reasoning for linking with first-class primitive modules, August 1999, available from http:\/\/www.cee.hw.ac.uk\/\u00a0\u0303jbw\/papers\/.","DOI":"10.1007\/3-540-46425-5_27"},{"key":"10.1016\/S0304-3975(00)00174-2_BIB18","series-title":"Programming in Modula-2, Texts and Monographs in Computer Science","author":"Wirth","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001742?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001742?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:08Z","timestamp":1759625528000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0304397500001742"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00174-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A typed context calculus","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00174-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}