{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:40Z","timestamp":1761610360192,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80314-7","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"152-168","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Dependent Coercions"],"prefix":"10.1016","volume":"29","author":[{"given":"Zhaohui","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Soloviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"journal-title":"Lego with implicit coercions","year":"1996","author":"Bailey","key":"10.1016\/S1571-0661(05)80314-7_BIBBAI96"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBBAI98","series-title":"PhD thesis, University of Manchester","article-title":"The Machine-checked Literate Formalisation of Algebra in Type Theory","author":"Bailey","year":"1998"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBBCGS91","article-title":"Inheritance and explicit coercion","volume":"93","author":"Breazu-Tannen, T. Coquand","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBCAL99","article-title":"Plastic: an implementation of typed LF with coercions","author":"Callaghan","year":"1999","journal-title":"Talk given in the Annual Conf of TYPES'99"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBCHE98","series-title":"PhD thesis, University of Paris VII","article-title":"Subtyping, Type Conversion and Transitivity Elimination","author":"Chen","year":"1998"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBCL98","article-title":"Mathematical vernacular in type theory based proof assistants","author":"Callaghan","year":"1998","journal-title":"User Interfaces for Theorem Provers (UITP'98), Eindhoven"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBCOQ96","series-title":"INRIA-Rocquencourt and CNRS-ENS Lyon","article-title":"The Coq Proof Assistant Reference Manual (version 6.1)","author":"Coq","year":"1996"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBCPM90","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52335-9_47","article-title":"Inductively defined types","volume":"417","author":"Coquand","year":"1990","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBCW85","doi-asserted-by":"crossref","DOI":"10.1145\/6041.6042","article-title":"On understanding types, data abstraction and polymorphism","volume":"17","author":"Cardelli","year":"1985","journal-title":"Computing Surveys"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBDYB91","series-title":"Logical Frameworks","article-title":"Inductive sets and families in Martin-L\u00f6f's type theory and their set-theoretic semantics","author":"Dybjer","year":"1991"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBJLS98","doi-asserted-by":"crossref","unstructured":"A. Jones, Z. Luo, and S. Soloviev. Some proof-theoretic and algorithmic aspects of coercive subtyping. Types for proofs and programs (eds, E. Gimenez and C Paulin-Mohring), Proc. of the Inter. Conf. TYPES'96, LNCS 1512, 1998.","DOI":"10.1007\/BFb0097792"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBKLM99","article-title":"Some issues in functional programmiung with dependent types","author":"Kiessling","year":"1999","journal-title":"Talk in the Annual Conference of TYPES'99"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBLC98","doi-asserted-by":"crossref","unstructured":"Z. Luo and P. Callaghan. Mathematical vernacular and conceptual well-formedness in mathematical language. Proceedings of the 2nd Inter. Conf. on Logical Aspects of Computational Linguistics, LNCS\/LNAI 1582, 1998.","DOI":"10.1007\/3-540-48975-4_12"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBLMS95","article-title":"A logic of subtyping","author":"Longo","year":"1995","journal-title":"Proc. of LICS'95"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBLP92","article-title":"LEGO Proof Development System: User's Manual","author":"Luo","year":"1992","journal-title":"LFCS Report ECS-LFCS-92-211, Department of Computer Science, University of Edinburgh"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBLUO92","series-title":"Proc. of Symp. on Logical Foundations of Computer Science (Logic at Tver'92), LNCS 620 Also as LFCS Report ECS-LFCS\ue4f8","first-page":"92","article-title":"A unifying theory of dependent types: the schematic approach","author":"Luo","year":"1992"},{"year":"1994","series-title":"Computation and Reasoning: A Type Theory for Computer Science","author":"Luo","key":"10.1016\/S1571-0661(05)80314-7_BIBLUO94"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBLUO97","article-title":"Coercive subtyping in type theory","author":"Luo","year":"1997","journal-title":"Proc. of CSL'96, the 1996 Annual Conference of the European Association for Computer Science Logic, Utrecht. LNCS 1258"},{"issue":"1","key":"10.1016\/S1571-0661(05)80314-7_BIBLUO99","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1093\/logcom\/9.1.105","article-title":"Coercive subtyping","volume":"9","author":"Luo","year":"1999","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBML84","series-title":"Bibliopolis","article-title":"Intuitionistic Type Theory","author":"Martin-L\u00f6f","year":"1984"},{"year":"1990","series-title":"Programming in Martin-L\u00f6f's Type Theory: An Introduction","author":"Nordstr\u00f6m","key":"10.1016\/S1571-0661(05)80314-7_BIBNPS90"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBSAI97","doi-asserted-by":"crossref","DOI":"10.1145\/263699.263742","article-title":"Typing algorithm in type theory with inheritance","author":"Saibi","year":"1997","journal-title":"Proc of POPL'97"},{"key":"10.1016\/S1571-0661(05)80314-7_BIBSL98","article-title":"Coercion completion and conservertivity in coercive subtyping","author":"Soloviev","year":"1998","journal-title":"Draft submitted"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803147?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803147?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:04Z","timestamp":1761610084000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":23,"alternative-id":["S1571066105803147"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80314-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dependent Coercions","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80314-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}