{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:31Z","timestamp":1750221031658,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,10,22]]},"DOI":"10.1145\/3331453.3360959","type":"proceedings-article","created":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T13:34:22Z","timestamp":1571664862000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing Strongly Normalizing \u03bbGtz-terms via Non-Idempotent Intersection Types"],"prefix":"10.1145","author":[{"given":"Xinxin","family":"Shen","sequence":"first","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kougen","family":"Zheng","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"A new type assignment for lambda-terms. Archiv f\u00fcr mathematische Logik und Grundlagenforschung, 19, 139--156","author":"Coppo M","year":"1978","unstructured":"M Coppo and M Dezani-Ciancaglini ( 1978 ). A new type assignment for lambda-terms. Archiv f\u00fcr mathematische Logik und Grundlagenforschung, 19, 139--156 . M Coppo and M Dezani-Ciancaglini (1978). A new type assignment for lambda-terms. Archiv f\u00fcr mathematische Logik und Grundlagenforschung, 19, 139--156."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093883253"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273659"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129502003821"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2003.09.004"},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","volume-title":"Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi","author":"Kikuchi K","year":"2017","unstructured":"K Kikuchi ( 2017 ). Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi . in: F. Baader (Ed.), RTA 2007, Lecture Notes in Computer Science , 4533, 257--272. K Kikuchi (2017). Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi. in: F. Baader (Ed.), RTA 2007, Lecture Notes in Computer Science, 4533, 257--272."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.011"},{"key":"e_1_3_2_1_8_1","volume-title":"ICALP.","author":"Matthes R","year":"2000","unstructured":"R Matthes ( 2000 ). Characterizing strongly normalizing terms of \u03bb-calculus with generalized applications via intersection types , in: ICALP. R Matthes (2000). Characterizing strongly normalizing terms of \u03bb-calculus with generalized applications via intersection types, in: ICALP."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.022"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.121.1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149823"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.26686\/ajl.v6i0.1792"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80487-0"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2594832.2594839"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1922649.1922657"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4118-8_9"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), ACM, 268--277","author":"Freeman T","year":"1991","unstructured":"T Freeman and F Pfenning ( 1991 ). Refinement types for ML. In D. S. Wise ed ., Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), ACM, 268--277 . T Freeman and F Pfenning (1991). Refinement types for ML. In D. S. Wise ed., Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), ACM, 268--277."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129502003857"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2643135.2643142"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/993954"},{"key":"e_1_3_2_1_21_1","volume-title":"P Dybjer and U Norell","author":"Bove A","year":"2009","unstructured":"A Bove , P Dybjer and U Norell ( 2009 ). A brief overview of Agda-A functional language with dependent types. In : S. Berghofer, T. Nipkow, C. Urban, M. Wenzel, Eds. Theorem Proving in Higher Order Logics (TPHOLs 2009), LNCS 5674, New York, Springer , 73--78. A Bove, P Dybjer and U Norell (2009). A brief overview of Agda-A functional language with dependent types. In: S. Berghofer, T. Nipkow, C. Urban, M. Wenzel, Eds. Theorem Proving in Higher Order Logics (TPHOLs 2009), LNCS 5674, New York, Springer, 73--78."},{"key":"e_1_3_2_1_22_1","volume-title":"A. P. Felty and A. Middeldorp (Eds.) International Conference on Automated Deduction (CADE","author":"de Moura L M","year":"2015","unstructured":"L M de Moura , S Kong , J Avigad , F van Doorn and J von Raumer ( 2015 ). The Lean theorem prover . In: A. P. Felty and A. Middeldorp (Eds.) International Conference on Automated Deduction (CADE 2015), LNCS 9195, Springer, New York, 378--388. L M de Moura, S Kong, J Avigad, F van Doorn and J von Raumer (2015). The Lean theorem prover. In: A. P. Felty and A. Middeldorp (Eds.) International Conference on Automated Deduction (CADE 2015), LNCS 9195, Springer, New York, 378--388."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57887-0_115"},{"key":"e_1_3_2_1_24_1","volume-title":"Alinearization of the lambda-calculus and consequences.Journal of Logic and Computation, 10(3), 411--434","author":"Kfoury A J","year":"2000","unstructured":"A J Kfoury ( 2000 ). Alinearization of the lambda-calculus and consequences.Journal of Logic and Computation, 10(3), 411--434 . A J Kfoury (2000). Alinearization of the lambda-calculus and consequences.Journal of Logic and Computation, 10(3), 411--434."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129516000396"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19805-2_7"},{"key":"e_1_3_2_1_28_1","volume-title":"Non-idempotent intersection types and strong normalization. Logical Methods in Computer Science, 9 (4:3), 1--46","author":"Bernadet A","year":"2013","unstructured":"A Bernadet and S Graham-Lengrand ( 2013 ). Non-idempotent intersection types and strong normalization. Logical Methods in Computer Science, 9 (4:3), 1--46 . A Bernadet and S Graham-Lengrand (2013). Non-idempotent intersection types and strong normalization. Logical Methods in Computer Science, 9 (4:3), 1--46."},{"key":"e_1_3_2_1_29_1","first-page":"1","article-title":"Types as Resources for Classical Natural Deduction. in 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)","volume":"85","author":"Kesner D","year":"2017","unstructured":"D Kesner and P Vial ( 2017 ). Types as Resources for Classical Natural Deduction. in 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) , LIPIcs , 85 , 1 -- 17 . D Kesner and P Vial (2017). Types as Resources for Classical Natural Deduction. in 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017), LIPIcs, 85, 1--17.","journal-title":"LIPIcs"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2015.12.010"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzx018"},{"key":"e_1_3_2_1_32_1","volume-title":"Lectures on the Curry-Howard Isomorphism","author":"S\u00f8rensen M H","year":"2006","unstructured":"M H S\u00f8rensen and P Urzyczyn ( 2006 ). Lectures on the Curry-Howard Isomorphism . Elsevier . M H S\u00f8rensen and P Urzyczyn (2006). Lectures on the Curry-Howard Isomorphism. Elsevier."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022247"},{"key":"e_1_3_2_1_34_1","first-page":"118","article-title":"Completing Herbelin's programme. in: S. Ronchi Della Rocca (Ed.), Typed Lambda Calculi and Applications","volume":"4583","author":"Esp\u00edrito Santo J","year":"2007","unstructured":"J Esp\u00edrito Santo ( 2007 ). Completing Herbelin's programme. in: S. Ronchi Della Rocca (Ed.), Typed Lambda Calculi and Applications , Lecture Notes in Computer Science , 4583 , 118 -- 132 . J Esp\u00edrito Santo (2007). Completing Herbelin's programme. in: S. Ronchi Della Rocca (Ed.), Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, 4583, 118--132.","journal-title":"Lecture Notes in Computer Science"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.2307\/2271658"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2012-772"},{"key":"e_1_3_2_1_37_1","volume-title":"4th Workshop on Intersection Types and Related Systems.","author":"Esp\u00edrito Santo J","year":"2008","unstructured":"J Esp\u00edrito Santo , J Iveti\u0107 and S Likavec ( 2008 ). Intersection type assignment systems for intuitionistic sequent calculus . in: 4th Workshop on Intersection Types and Related Systems. J Esp\u00edrito Santo, J Iveti\u0107 and S Likavec (2008). Intersection type assignment systems for intuitionistic sequent calculus. in: 4th Workshop on Intersection Types and Related Systems."},{"key":"e_1_3_2_1_38_1","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt H","year":"1984","unstructured":"H Barendregt ( 1984 ). The Lambda Calculus: Its Syntax and Semantics , Elsevier . H Barendregt (1984). The Lambda Calculus: Its Syntax and Semantics, Elsevier."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001328"}],"event":{"name":"CSAE 2019: The 3rd International Conference on Computer Science and Application Engineering","acronym":"CSAE 2019","location":"Sanya China"},"container-title":["Proceedings of the 3rd International Conference on Computer Science and Application Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3331453.3360959","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3331453.3360959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:29Z","timestamp":1750207409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3331453.3360959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,22]]},"references-count":38,"alternative-id":["10.1145\/3331453.3360959","10.1145\/3331453"],"URL":"https:\/\/doi.org\/10.1145\/3331453.3360959","relation":{},"subject":[],"published":{"date-parts":[[2019,10,22]]},"assertion":[{"value":"2019-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}