{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:34Z","timestamp":1761611194878},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651376"},{"type":"electronic","value":"9783540495628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0097792","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T14:27:48Z","timestamp":1164378468000},"page":"173-195","source":"Crossref","is-referenced-by-count":9,"title":["Some algorithmic and proof-theoretical aspects of coercive subtyping"],"prefix":"10.1007","author":[{"given":"Alex","family":"Jones","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaohui","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Soloviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,26]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"D. Aspinall and A. Compagnoni. Subtyping dependent types. Proc. of LICS96, 1996.","key":"10_CR1","DOI":"10.1109\/LICS.1996.561307"},{"unstructured":"Anthony Bailey. Representing algebra in LEGO. Master's thesis, Department of Computer Science, University of Edinburgh, 1993.","key":"10_CR2"},{"unstructured":"A. Bailey. Lego with implicit coercions. 1996. Draft.","key":"10_CR3"},{"doi-asserted-by":"crossref","unstructured":"L. Cardelli. Type-checking dependent types and subtypes. Lecture Notes in Computer Science, 306, 1988.","key":"10_CR4","DOI":"10.1007\/3-540-19129-1_2"},{"unstructured":"L. Cardelli. Typeful programming. Lecture notes for the IFIP State of the Art Seminar on Formal Description of Programming Concepts, Rio de Janeiro, Brazil, 1989.","key":"10_CR5"},{"doi-asserted-by":"crossref","unstructured":"Th. Coquand. An algorithm for testing conversion in Type Theory. In G. Huet and G. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.","key":"10_CR6","DOI":"10.1017\/CBO9780511569807.011"},{"doi-asserted-by":"crossref","unstructured":"H. Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, 1994.","key":"10_CR7","DOI":"10.1007\/BFb0014053"},{"unstructured":"G. Huet et al. The Coq Proof Assistant Reference Manual. INRIA-Rocquencourt, February 1996.","key":"10_CR8"},{"doi-asserted-by":"crossref","unstructured":"G\u00e9rard Huet. The constructive engine. In R. Narasimhan, editor, A Perspective in Theoretical Computer Science. World Scientific Publishing, 1989. Commemorative Volume for Gift Siromoney.","key":"10_CR9","DOI":"10.1142\/0867"},{"unstructured":"Alex Jones. The formalization of linear algebra in LEGO: The decidable dependency theorem. Master's thesis, Department of Mathematics, University of Manchester, 1995.","key":"10_CR10"},{"unstructured":"Giuseppe Longo, Kathleen Milsted, and Sergei Soloviev. Coherence and transitivity of subtyping as entailment. To appear in Journal of Logic and Computation.","key":"10_CR11"},{"unstructured":"G. Longo, K. Milsted, and S. Soloviev. A logic of subtyping. In Proc. of LICS'95, 1995.","key":"10_CR12"},{"unstructured":"Zhaohui Luo and Robert Pollack. LEGO proof development system: User's manual. Technical Report LFCS Report ECS-LFCS-92-211, Department of Computer Science, University of Edinburgh, 1992.","key":"10_CR13"},{"doi-asserted-by":"crossref","unstructured":"Z. Luo. Program specification and data refinement in type theory. Mathematical Structures in Computer Science, 3(3), 1993.","key":"10_CR14","DOI":"10.1017\/S0960129500000256"},{"doi-asserted-by":"crossref","unstructured":"Z. Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.","key":"10_CR15","DOI":"10.1093\/oso\/9780198538356.001.0001"},{"unstructured":"Z. Luo. Coercive subtyping in type theory. Proc. of CSL'96, the 1996 Annual Conference of the European Association for Computer Science Logic, Utrecht. LNCS 1258, 1996.","key":"10_CR16"},{"unstructured":"Z Luo. Coercive suptyping. Draft submitted for publication, 1997.","key":"10_CR17"},{"unstructured":"B. Nordstr\u00f6m, K. Petersson, and J. Smith. Programming in Martin-L\u00f6f's Type Theory: An Introduction. Oxford University Press, 1990.","key":"10_CR18"},{"doi-asserted-by":"crossref","unstructured":"A. Saibi. Typing algorithm in type theory with inheritance. Proc. of POPL'97, 1997.","key":"10_CR19","DOI":"10.1145\/263699.263742"}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0097792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T14:07:05Z","timestamp":1707401225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0097792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651376","9783540495628"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0097792","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}