乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:41:42Z","timestamp":1730313702652,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,8,24]]},"DOI":"10.1145\/1013963.1013982","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"155-166","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Characterizing strong normalization in a language with control operators"],"prefix":"10.1145","author":[{"given":"Dan","family":"Dougherty","sequence":"first","affiliation":[{"name":"Worcester Polytechnic Institute, Worcester, MA"}]},{"given":"Silvia","family":"Ghilezan","sequence":"additional","affiliation":[{"name":"University of Novi Sad, Novi Sad, Serbia"}]},{"given":"Pierre","family":"Lescanne","sequence":"additional","affiliation":[{"name":"LIP, ENS de Lyon, Lyon, France"}]}],"member":"320","published-online":{"date-parts":[[2004,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/3-540-45061-0_68","volume-title":"ICALP: Annual International Colloquium on Automata, Languages and Programming","author":"Ariola Z. M.","year":"2003","unstructured":"Z. M. Ariola and H. Herbelin . Minimal classical logic and control operators . In ICALP: Annual International Colloquium on Automata, Languages and Programming , volume 2719 of Lecture Notes in Computer Science , pages 871 -- 885 . sv, 2003 .]] Z. M. Ariola and H. Herbelin. Minimal classical logic and control operators. In ICALP: Annual International Colloquium on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 871--885. sv, 2003.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0025"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1086"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273659"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003524"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/645727.667521"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","volume-title":"Internet Programming Languages","author":"Buneman P.","year":"1998","unstructured":"P. Buneman and B. Pierce . Union types for semistructured data . In Internet Programming Languages , volume 1686 of Lecture Notes in Computer Science . Springer-Verlag , September 1998 . Proceedings of the International Database Programming Languages Workshop.]] P. Buneman and B. Pierce. Union types for semistructured data. In Internet Programming Languages, volume 1686 of Lecture Notes in Computer Science. Springer-Verlag, September 1998. Proceedings of the International Database Programming Languages Workshop.]]"},{"key":"e_1_3_2_1_8_1","first-page":"535","volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"Coppo M.","year":"1980","unstructured":"M. Coppo , M. Dezani-Ciancaglini , and B. Venneri . Principal type schemes and \u03bb-calculus semantics . In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism , pages 535 -- 560 . Academic Press , London , 1980 .]] M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Principal type schemes and \u03bb-calculus semantics. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 535--560. Academic Press, London, 1980.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"Archive for Mathematical Logic","author":"Curien P.-L.","year":"2001","unstructured":"P.-L. Curien . Symmetry and interactivity in programming . Archive for Mathematical Logic , 2001 . to appear.]] P.-L. Curien. Symmetry and interactivity in programming. Archive for Mathematical Logic, 2001. to appear.]]"},{"key":"e_1_3_2_1_10_1","volume-title":"APPSEM 2000","volume":"2395","author":"Curien P.-L.","year":"2000","unstructured":"P.-L. Curien . Abstract machines, control, and sequents. In Applied Semantics, International Summer School , APPSEM 2000 , Caminha, Portugal , September 9-15, 2000 , Advanced Lectures, volume 2395 of Lecture Notes in Computer Science, pages 123--136. Springer-Verlag, 2002.]] P.-L. Curien. Abstract machines, control, and sequents. In Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures, volume 2395 of Lecture Notes in Computer Science, pages 123--136. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351262"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(00)00030-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645708.664169"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001328"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96714"},{"key":"e_1_3_2_1_16_1","volume-title":"Universit\u00e9 Paris 7, Janvier","author":"Herbelin H.","year":"1995","unstructured":"H. Herbelin . S\u00e9quents qu'on calcule~: de l'interpr\u00e9tation du calcul des s\u00e9quents comme calcul de \u03bb-termes et comme calcul de strat\u00e9gies gagnantes. Th\u00e8se d'universit\u00e9 , Universit\u00e9 Paris 7, Janvier 1995 .]] H. Herbelin. S\u00e9quents qu'on calcule~: de l'interpr\u00e9tation du calcul des s\u00e9quents comme calcul de \u03bb-termes et comme calcul de strat\u00e9gies gagnantes. Th\u00e8se d'universit\u00e9, Universit\u00e9 Paris 7, Janvier 1995.]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90074-9"},{"key":"e_1_3_2_1_18_1","volume-title":"Manuscript","author":"Laurent O.","year":"2004","unstructured":"O. Laurent . On the denotational semantics of the pure lambda-mu calculus . Manuscript , 2004 .]] O. Laurent. On the denotational semantics of the pure lambda-mu calculus. Manuscript, 2004.]]"},{"key":"e_1_3_2_1_19_1","volume-title":"Electronic Notes in Theoretical Computer Science","author":"Lengrand S.","year":"2003","unstructured":"S. Lengrand . Call-by-value , call-by-name, and strong normalization for the classical sequent calculus . In Bernhard Gramlich and Salvador Lucas, editors, Electronic Notes in Theoretical Computer Science , volume 86 . Elsevier , 2003 .]] S. Lengrand. Call-by-value, call-by-name, and strong normalization for the classical sequent calculus. In Bernhard Gramlich and Salvador Lucas, editors, Electronic Notes in Theoretical Computer Science, volume 86. Elsevier, 2003.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263722"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680100394X"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645706.663989"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275652"},{"key":"e_1_3_2_1_25_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/978-3-540-24727-2_30","volume-title":"Igor Walukiewicz","author":"Polonovski E.","year":"2004","unstructured":"E. Polonovski . Strong normalization of \u03bb\u03bc\u03bc-calculus with explicit substitutions. In Igor Walukiewicz , editor, Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004 , volume 2987 of Lecture Notes in Computer Science , pages 423 -- 437 . Springer , 2004.]] E. Polonovski. Strong normalization of \u03bb\u03bc\u03bc-calculus with explicit substitutions. In Igor Walukiewicz, editor, Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, volume 2987 of Lecture Notes in Computer Science, pages 423--437. Springer, 2004.]]"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0003-4843(77)80004-1"},{"key":"e_1_3_2_1_27_1","first-page":"561","volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"Pottinger G.","year":"1980","unstructured":"G. Pottinger . A type assignment for the strongly normalizable \u03bb-terms . In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism , pages 561 -- 577 . Academic Press , London , 1980 .]] G. Pottinger. A type assignment for the strongly normalizable \u03bb-terms. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 561--577. Academic Press, London, 1980.]]"},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/3-540-48959-2_26","volume-title":"Typed Lambda Calculus and Applications","author":"Urban C.","year":"1999","unstructured":"C. Urban and G. M. Bierman . Strong normalisation of cut-elimination in classical logic . In Typed Lambda Calculus and Applications , volume 1581 of Lecture Notes in Computer Science , pages 365 -- 380 , 1999 .]] C. Urban and G. M. Bierman. Strong normalisation of cut-elimination in classical logic. In Typed Lambda Calculus and Applications, volume 1581 of Lecture Notes in Computer Science, pages 365--380, 1999.]]"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944723"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004245"}],"event":{"name":"PPDP04: Principles and Practice of Declarative Programming 2004","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Verona Italy","acronym":"PPDP04"},"container-title":["Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1013963.1013982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T14:09:59Z","timestamp":1673014199000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1013963.1013982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,24]]},"references-count":29,"alternative-id":["10.1145\/1013963.1013982","10.1145\/1013963"],"URL":"https:\/\/doi.org\/10.1145\/1013963.1013982","relation":{},"subject":[],"published":{"date-parts":[[2004,8,24]]},"assertion":[{"value":"2004-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}