{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T07:55:41Z","timestamp":1777103741392,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s11390-025-5978-7","type":"journal-article","created":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:58:39Z","timestamp":1773392319000},"page":"217-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Overview of Cangjie Programming Language"],"prefix":"10.1007","volume":"41","author":[{"given":"Xin-Yu","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong-Xiao","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong-Yong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,11]]},"reference":[{"issue":"1","key":"5978_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/345099.345100","volume":"22","author":"B C Pierce","year":"2000","unstructured":"Pierce B C, Turner D N. Local type inference. ACM Trans. Programming Languages and Systems, 2000, 22(1): 1\u201344. DOI: https:\/\/doi.org\/10.1145\/345099.345100.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"5978_CR2","volume-title":"The Rust Programming Language","author":"S Klabnik","year":"2023","unstructured":"Klabnik S, Nichols C. The Rust Programming Language (2nd edition). No Starch Press, 2023. Burlingame, CA 94010-4093, USA","edition":"2nd edition"},{"issue":"1","key":"5978_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/00029890.1985.11971528","volume":"92","author":"J C Lagarias","year":"1985","unstructured":"Lagarias J C. The 3x + 1 problem and its generalizations. The American Mathematical Monthly, 1985, 92(1): 3\u201323. DOI: https:\/\/doi.org\/10.1080\/00029890.1985.11971528.","journal-title":"The American Mathematical Monthly"},{"issue":"5","key":"5978_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/130697.130699","volume":"27","author":"P Hudak","year":"1992","unstructured":"Hudak P, Peyton Jones S, Wadler P, Boutel B, Fairbairn J, Fasel J, Guzman M M, Hammond K, Hughes J, Johnsson T, Kieburtz D, Nikhil R, Partain W, Peterson J. Report on the programming language Haskell: A non-strict, purely functional language version 1.2. ACM SIGPLAN Notices, 1992, 27(5): 1\u2013164. DOI: https:\/\/doi.org\/10.1145\/130697.130699.","journal-title":"ACM SIGPLAN Notices"},{"key":"5978_CR5","series-title":"Technical Report IC\/2004\/64","volume-title":"An overview of the scala programming language","author":"M Odersky","year":"2004","unstructured":"Odersky M, Altherr P, Cremet V, Emir B, Maneth S, Micheloud S, Mihaylov N, Schinz M, Stenman E, Zenger M. An overview of the scala programming language. Technical Report IC\/2004\/64, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, 1015 Lausanne, Switzerland, 2004. https:\/\/infoscience.epfl.ch\/server\/api\/core\/bitstreams\/b7b0b562-3978-4af6-8c04-04c8b304935e\/content, Jan. 2026."},{"key":"5978_CR6","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/3426425.3426939","volume-title":"Proc. the 13th ACM SIGPLAN International Conference on Software Language Engineering","author":"D Racordon","year":"2020","unstructured":"Racordon D, Buchs D. Featherweight swift: A core calculus for swift\u2019s type system. In Proc. the 13th ACM SIGPLAN International Conference on Software Language Engineering, Nov. 2020, pp.140\u2013154. DOI: https:\/\/doi.org\/10.1145\/3426425.3426939."},{"key":"5978_CR7","doi-asserted-by":"publisher","unstructured":"Cui C, Jiang S, Oliveira B C D S. Greedy implicit bounded quantification. Proceedings of the ACM on Programming Languages, 2023, 7(OOPSLA2): Article No. 295. DOI: https:\/\/doi.org\/10.1145\/3622871.","DOI":"10.1145\/3622871"},{"key":"5978_CR8","doi-asserted-by":"publisher","unstructured":"Dunfield J, Krishnaswami N. Bidirectional typing. ACM Computing Surveys (CSUR), 2022, 54(5): Article No. 98. DOI: https:\/\/doi.org\/10.1145\/3450952.","DOI":"10.1145\/3450952"},{"issue":"9","key":"5978_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1145\/2544174.2500582","volume":"48","author":"J Dunfield","year":"2013","unstructured":"Dunfield J, Krishnaswami N R. Complete and easy bidirectional typechecking for higher-rank polymorphism. ACM SIGPLAN Notices, 2013, 48(9): 429\u2013442. DOI: https:\/\/doi.org\/10.1145\/2544174.2500582.","journal-title":"ACM SIGPLAN Notices"},{"key":"5978_CR10","doi-asserted-by":"publisher","unstructured":"Zhao J, Oliveira B C D S, Schrijvers T. A mechanical formalization of higher-ranked polymorphic type inference. Proceedings of the ACM on Programming Languages, 2019, 3(ICFP): Article No. 112. DOI: https:\/\/doi.org\/10.1145\/3341716.","DOI":"10.1145\/3341716"},{"key":"5978_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/582153.582176","volume-title":"Proc. the 9th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"L Damas","year":"1982","unstructured":"Damas L, Milner R. Principal type-schemes for functional programs. In Proc. the 9th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Jan. 1982, pp.207\u2013212. DOI: https:\/\/doi.org\/10.1145\/582153.582176."},{"issue":"3","key":"5978_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/373243.360207","volume":"36","author":"M Odersky","year":"2001","unstructured":"Odersky M, Zenger C, Zenger M. Colored local type inference. ACM SIGPLAN Notices, 2001, 36(3): 41\u201353. DOI: https:\/\/doi.org\/10.1145\/373243.360207.","journal-title":"ACM SIGPLAN Notices"},{"key":"5978_CR13","series-title":"Ph.D. Thesis","volume-title":"Polymorphic type inference for languages with overloading and subtyping","author":"G S Smith","year":"1991","unstructured":"Smith G S. Polymorphic type inference for languages with overloading and subtyping [Ph.D. Thesis]. Cornell University, Ithaca, 1991."},{"key":"5978_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3540543961_2","volume-title":"On the complexity of ml typability with overloading","author":"D M Volpano","year":"1991","unstructured":"Volpano D M, Smith G S. On the complexity of ml typability with overloading. In Lecture Notes in Computer Science 523, Hughes J (ed.), Springer, 1991, pp.15\u201328. DOI: https:\/\/doi.org\/10.1007\/3540543961_2."},{"key":"5978_CR15","volume-title":"Proc. the 36es Journ\u00e9es Francophones des Langages Applicatifs (JFLA 2025)","author":"A Chargu\u00e9raud","year":"2025","unstructured":"Chargu\u00e9raud A, Bodin M, Riboulet L. Typechecking of overloading in programming languages and mechanized mathematics. In Proc. the 36es Journ\u00e9es Francophones des Langages Applicatifs (JFLA 2025), Jan. 2025."},{"key":"5978_CR16","volume-title":"Algebraic Subtyping: Distinguished Dissertation","author":"S Dolan","year":"2017","unstructured":"Dolan S. Algebraic Subtyping: Distinguished Dissertation. BCS Learning & Development Ltd., 2017."},{"issue":"ICFP","key":"5978_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3409006","volume":"4","author":"L Parreaux","year":"2020","unstructured":"Parreaux L. The simple essence of algebraic subtyping: Principal type inference with subtyping made easy (functional pearl). Proceedings of the ACM on Programming Languages, 2020, 4(ICFP): 1\u201328. DOI: https:\/\/doi.org\/10.1145\/3409006.","journal-title":"Proceedings of the ACM on Programming Languages"},{"issue":"OOPSLA2","key":"5978_CR18","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1145\/3563304","volume":"6","author":"L Parreaux","year":"2022","unstructured":"Parreaux L, Chau C Y. MLstruct: Principal type inference in a Boolean algebra of structural types. Proceedings of the ACM on Programming Languages, 2022, 6(OOPSLA2): 449\u2013478. DOI: https:\/\/doi.org\/10.1145\/3563304.","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"5978_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/MICRO.2003.1253196","volume-title":"Proc. the 36th Annual IEEE\/ACM International Symposium on Microarchitecture","author":"V Adve","year":"2003","unstructured":"Adve V, Lattner C, Brukman M, Shukla A, Gaeke B. LLVA: A low-level virtual instruction set architecture. In Proc. the 36th Annual IEEE\/ACM International Symposium on Microarchitecture, Dec. 2003, pp.205\u2013216. DOI: https:\/\/doi.org\/10.1109\/MICRO.2003.1253196."},{"key":"5978_CR20","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/CGO51591.2021.9370308","volume-title":"Proc. the 2021 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)","author":"C Lattner","year":"2021","unstructured":"Lattner C, Amini M, Bondhugula U, Cohen A, Davis A, Pienaar J, Riddle R, Shpeisman T, Vasilache N, Zinenko O. MLIR: Scaling compiler infrastructure for domain specific computation. In Proc. the 2021 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), Feb. 27\u2013Mar. 3, 2021, pp.2\u201314. DOI: https:\/\/doi.org\/10.1109\/CGO51591.2021.9370308."},{"key":"5978_CR21","series-title":"Technical Report TR-CS-94-02","volume-title":"Dynamic dispatch in object-oriented languages","author":"S Milton","year":"1994","unstructured":"Milton S, Schmidt H W. Dynamic dispatch in object-oriented languages. Technical Report TR-CS-94-02, The Australian National University, Canberra, Australia, 1994. https:\/\/scispace.com\/pdf\/dynamic-dispatch-in-object-oriented-languages-4s64vkql74.pdf, Jan. 2026."},{"key":"5978_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/1868294.1868316","volume-title":"Proc. the 9th International Conference on Generative Programming and Component Engineering","author":"K Atkinson","year":"2010","unstructured":"Atkinson K, Flatt M, Lindstrom G. ABI compatibility through a customizable language. In Proc. the 9th International Conference on Generative Programming and Component Engineering, Oct. 2010, pp.147\u2013156. DOI: https:\/\/doi.org\/10.1145\/1868294.1868316."},{"key":"5978_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/378795.378797","volume-title":"Proc. the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"A Kennedy","year":"2001","unstructured":"Kennedy A, Syme D. Design and implementation of generics for the.NET common language runtime. In Proc. the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation, Jun. 2001, pp.1\u201312. DOI: https:\/\/doi.org\/10.1145\/378795.378797."},{"key":"5978_CR24","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/1064979.1064988","volume-title":"Proc. the 1st ACM\/USENIX International Conference on Virtual Execution Environments","author":"C Click","year":"2005","unstructured":"Click C, Tene G, Wolf M. The pauseless GC algorithm. In Proc. the 1st ACM\/USENIX International Conference on Virtual Execution Environments, Jun. 2005, pp.46\u201356. DOI: https:\/\/doi.org\/10.1145\/1064979.1064988."},{"key":"5978_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/1993478.1993491","volume-title":"Proc. the 2011 International Symposium on Memory Management","author":"G Tene","year":"2011","unstructured":"Tene G, Iyengar B, Wolf M. C4: The continuously concurrent compacting collector. In Proc. the 2011 International Symposium on Memory Management, Jun. 2011, pp.79\u201388. DOI: https:\/\/doi.org\/10.1145\/1993478.1993491."},{"issue":"3\/4\/5","key":"5978_CR26","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/cpe.712","volume":"15","author":"R L Hudson","year":"2003","unstructured":"Hudson R L, Moss J E B. Sapphire: Copying garbage collection without stopping the world. Concurrency and Computation: Practice and Experience, 2003, 15(3\/4\/5): 223\u2013261. DOI: https:\/\/doi.org\/10.1002\/cpe.712.","journal-title":"Concurrency and Computation: Practice and Experience"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-025-5978-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-025-5978-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-025-5978-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T07:21:01Z","timestamp":1777101661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-025-5978-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["5978"],"URL":"https:\/\/doi.org\/10.1007\/s11390-025-5978-7","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"24 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Conflict of Interest\n                      The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}]}}