乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:39:24Z","timestamp":1725799164010},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441442"},{"type":"electronic","value":"9783662441459"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44145-9_3","type":"book-chapter","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T21:10:45Z","timestamp":1408741845000},"page":"36-50","source":"Crossref","is-referenced-by-count":10,"title":["On the Value of Variables"],"prefix":"10.1007","author":[{"given":"Beniamino","family":"Accattoli","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Sacerdoti Coen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the lambda-calculus. Theor. Comput. Sci.\u00a01(2), 125\u2013159 (1975)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"Landin, P.J.: The Mechanical Evaluation of Expressions. The Computer Journal\u00a06(4), 308\u2013320 (1964)","journal-title":"The Computer Journal"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Crank, E., Felleisen, M.: Parameter-passing and the lambda calculus. In: POPL, pp. 233\u2013244 (1991)","DOI":"10.1145\/99583.99616"},{"key":"3_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-10394-4","volume-title":"The Parametric \u0142-Calculus","author":"S. Ronchi Della Rocca","year":"2004","unstructured":"Ronchi Della Rocca, S., Paolini, L.: The Parametric \u0142-Calculus. Springer, Heidelberg (2004)"},{"key":"3_CR5","volume-title":"Types and Programming Languages","author":"B.C. Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Pfenning, F., Simmons, R.J.: Substructural operational semantics as ordered logic programming. In: LICS, pp. 101\u2013110 (2009)","DOI":"10.1109\/LICS.2009.8"},{"key":"3_CR7","unstructured":"Accattoli, B.: An abstract factorization theorem for explicit substitutions. In: RTA, pp. 6\u201321 (2012)"},{"key":"3_CR8","unstructured":"Accattoli, B., Dal Lago, U.: On the invariance of the unitary cost model for head reduction. In: RTA, pp. 22\u201337 (2012)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Accattoli, B., Bonelli, E., Kesner, D., Lombardi, C.: A nonstandard standardization theorem. In: POPL, pp. 659\u2013670 (2014)","DOI":"10.1145\/2535838.2535886"},{"key":"3_CR10","unstructured":"Accattoli, B., Barenbaum, P., Mazza, D.: Distilling abstract machines. In: ICFP 2014 (accepted, 2014)"},{"key":"3_CR11","unstructured":"Accattoli, B., Dal Lago, U.: Beta Reduction is Invariant, Indeed. In: LICS\/CSL 2014 (accepted, 2014)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Launchbury, J.: A natural semantics for lazy evaluation. In: POPL, pp. 144\u2013154 (1993)","DOI":"10.1145\/158511.158618"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0956796897002724","volume":"7","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Felleisen, M.: The call-by-need lambda calculus. J. Funct. Program.\u00a07(3), 265\u2013301 (1997)","journal-title":"J. Funct. Program."},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1017\/S0956796898003037","volume":"8","author":"J. Maraist","year":"1998","unstructured":"Maraist, J., Odersky, M., Wadler, P.: The call-by-need lambda calculus. J. Funct. Program.\u00a08(3), 275\u2013317 (1998)","journal-title":"J. Funct. Program."},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-28869-2_7","volume-title":"Programming Languages and Systems","author":"S. Chang","year":"2012","unstructured":"Chang, S., Felleisen, M.: The call-by-need lambda calculus, revisited. In: Seidl, H. (ed.) Programming Languages and Systems. LNCS, vol.\u00a07211, pp. 128\u2013147. Springer, Heidelberg (2012)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Danvy, O., Zerny, I.: A synthetic operational account of call-by-need evaluation. In: PPDP, pp. 97\u2013108 (2013)","DOI":"10.1145\/2505879.2505898"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Accattoli, B.: Proof nets and the call-by-value lambda-calculus. In: LSFA, pp. 11\u201326 (2012)","DOI":"10.4204\/EPTCS.113.5"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-02930-1_14","volume-title":"Automata, Languages and Programming","author":"U. Lago Dal","year":"2009","unstructured":"Dal Lago, U., Martini, S.: On constructor rewrite systems and the lambda-calculus. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 163\u2013174. Springer, Heidelberg (2009)"},{"key":"3_CR20","unstructured":"Wadsworth, C.P.: Some unusual \u03bb-calculus numeral systems. In: Seldin, J., Hindley, J. (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press (1980)"},{"key":"3_CR21","unstructured":"Felleisen, M., Friedman, D.P.: Control operators, the SECD-machine, and the lambda-calculus. In: 3rd Working Conference on the Formal Description of Programming Concepts (August 1986)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44145-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T13:07:04Z","timestamp":1558962424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44145-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441442","9783662441459"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44145-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}