乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:06Z","timestamp":1725549186628},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_25","type":"book-chapter","created":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T20:07:56Z","timestamp":1267992476000},"page":"358-373","source":"Crossref","is-referenced-by-count":15,"title":["Solvability in Resource Lambda-Calculus"],"prefix":"10.1007","author":[{"given":"Michele","family":"Pagani","sequence":"first","affiliation":[]},{"given":"Simona Ronchi","family":"della Rocca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Boudol, G.: The Lambda-Calculus with Multiplicities. INRIA Report 2025 (1993)","key":"25_CR1","DOI":"10.1007\/3-540-57208-2_1"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(03)00392-X","volume":"309","author":"T. Ehrhard","year":"2003","unstructured":"Ehrhard, T., Regnier, L.: The Differential Lambda-Calculus. Theor. Comput. Sci.\u00a0309(1), 1\u201341 (2003)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Tranquilli, P.: Intuitionistic Differential Nets and Lambda-Calculus. Theor. Comput. Sci. (2008) (to appear)","key":"25_CR3"},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1006\/inco.1995.1145","volume":"122","author":"U. de\u2019Liguoro","year":"1995","unstructured":"de\u2019Liguoro, U., Piperno, A.: Non Deterministic Extensions of Untyped Lambda-Calculus. Inf. Comput.\u00a0122(2), 149\u2013177 (1995)","journal-title":"Inf. Comput."},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11780342_20","volume-title":"Logical Approaches to Computational Barriers","author":"T. Ehrhard","year":"2006","unstructured":"Ehrhard, T., Regnier, L.: B\u00f6hm trees, Krivine\u2019s Machine and the Taylor Expansion of Lambda-Terms. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 186\u2013197. Springer, Heidelberg (2006)"},{"issue":"2-3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.tcs.2008.06.001","volume":"403","author":"T. Ehrhard","year":"2008","unstructured":"Ehrhard, T., Regnier, L.: Uniformity and the Taylor Expansion of Ordinary Lambda-Terms. Theor. Comput. Sci.\u00a0403(2-3), 347\u2013372 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-642-10672-9_17","volume-title":"APLAS 2009","author":"M. Pagani","year":"2009","unstructured":"Pagani, M., Tranquilli, P.: Parallel Reduction in Resource Lambda-Calculus. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol.\u00a05904, pp. 226\u2013242. Springer, Heidelberg (2009)"},{"key":"25_CR8","series-title":"Stud. Logic Found. Math.","volume-title":"The Lambda-Calculus, its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda-Calculus, its Syntax and Semantics, 2nd edn. Stud. Logic Found. Math., vol.\u00a0103. North-Holland, Amsterdam (1984)","edition":"2"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/malq.19810270205","volume":"27","author":"M. Coppo","year":"1981","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Venneri, B.: Functional Characters of Solvable Terms. Zeitschrift f\u00fcr Mathematische Logik\u00a027, 45\u201358 (1981)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik"},{"issue":"12","key":"25_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","volume":"2","author":"J.M.E. Hyland","year":"1976","unstructured":"Hyland, J.M.E.: A Syntactic Characterization of the Equality in Some Models of the Lambda Calculus. J. London Math. Soc.\u00a02(12), 361\u2013370 (1976)","journal-title":"J. London Math. Soc."},{"key":"25_CR11","series-title":"EATCS Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-10394-4","volume-title":"The Parametric \u03bb-Calculus: a Metamodel for Computation","author":"S. Ronchi Della Rocca","year":"2004","unstructured":"Ronchi Della Rocca, S., Paolini, L.: The Parametric \u03bb-Calculus: a Metamodel for Computation. EATCS Series. Springer, Berlin (2004)"},{"unstructured":"de Carvalho, D.: Execution Time of \u03bb-Terms via Denotational Semantics and Intersection Types (2009) (submitted for publication)","key":"25_CR12"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-74915-8_24","volume-title":"Computer Science Logic","author":"A. Bucciarelli","year":"2007","unstructured":"Bucciarelli, A., Ehrhard, T., Manzonetto, G.: Not Enough Points Is Enough. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 298\u2013312. Springer, Heidelberg (2007)"},{"unstructured":"Tranquilli, P.: Nets between Determinism and Nondeterminism. Ph.D. thesis, Universit\u00e0 Roma Tre\/Universit\u00e9 Paris Diderot (Paris 7) (April 2009)","key":"25_CR14"},{"issue":"5","key":"25_CR15","first-page":"437","volume":"9","author":"G. Boudol","year":"1999","unstructured":"Boudol, G., Curien, P.L., Lavatelli, C.: A Semantics for Lambda Calculi with Resources. MSCS\u00a09(5), 437\u2013482 (1999)","journal-title":"MSCS"},{"key":"25_CR16","first-page":"480","volume-title":"Essays on Combinatory Logic, Lambda-calculus and Formalism","author":"M. Coppo","year":"1980","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Venneri, B.: Principal Type Schemes and Lambda-Calculus Semantics. In: Curry, To H.B. (ed.) Essays on Combinatory Logic, Lambda-calculus and Formalism, pp. 480\u2013490. Academic Press, London (1980)"},{"issue":"3","key":"25_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1093\/logcom\/10.3.411","volume":"10","author":"A.J. Kfoury","year":"2000","unstructured":"Kfoury, A.J.: A Linearization of the Lambda-Calculus and Consequences. Journal of Logic and Computation\u00a010(3), 411\u2013436 (2000)","journal-title":"Journal of Logic and Computation"},{"issue":"3","key":"25_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1017\/S0956796801004245","volume":"12","author":"J.B. Wells","year":"2002","unstructured":"Wells, J.B., Dimock, A., Muller, R., Turbak, F.: A Calculus with Polymorphic and Polyvariant Flow Types. J. Funct. Program.\u00a012(3), 183\u2013227 (2002)","journal-title":"J. Funct. Program."},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1145\/1016850.1016871","volume-title":"ICFP","author":"P.M. Neergaard","year":"2004","unstructured":"Neergaard, P.M., Mairson, H.G.: Types, Potency, and Idempotency: why Nonlinearity and Amnesia Make a Type System Work. In: ICFP, pp. 138\u2013149. ACM, New York (2004)"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","volume":"72","author":"M. Coppo","year":"1987","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Zacchi, M.: Type Theories, Normal Forms and D \u2009\u221e\u2009-Lambda-Models. Inf. Comput.\u00a072(2), 85\u2013116 (1987)","journal-title":"Inf. Comput."},{"unstructured":"Girard, J.Y.: Interpr\u00e9tation Fonctionnelle et \u00c9limination des Coupures de l\u2019Arithm\u00e9tique d\u2019Ordre Sup\u00e9rieur. Th\u00e8se de doctorat, Universit\u00e9 Paris 7 (1972)","key":"25_CR21"},{"issue":"7","key":"25_CR22","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s001530000070","volume":"40","author":"S. Valentini","year":"2001","unstructured":"Valentini, S.: An elementary proof of strong normalization for intersection types. Archive for Mathematical Logic\u00a040(7), 475\u2013488 (2001)","journal-title":"Archive for Mathematical Logic"},{"unstructured":"de Carvalho, D., Pagani, M., Tortora de Falco, L.: A Semantic Measure of the Execution Time in Linear Logic. Theor. Comput. Sci. (2008) (to appear)","key":"25_CR23"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T14:03:43Z","timestamp":1558879423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}