{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T17:38:49Z","timestamp":1748367529579,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_14","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"163-174","source":"Crossref","is-referenced-by-count":13,"title":["On Constructor Rewrite Systems and the Lambda-Calculus"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Martini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","first-page":"141","volume-title":"Parallel Languages on PARLE: Parallel Architectures and Languages Europe","author":"H. Barendregt","year":"1986","unstructured":"Barendregt, H., Eekelen, M., Glauert, J., Kennaway, J., Plasmeijer, M., Sleep, M.: Term graph rewriting. In: de Bakker, J., Nijman, A., Treleaven, P. (eds.) Parallel Languages on PARLE: Parallel Architectures and Languages Europe, vol.\u00a0II, pp. 141\u2013158. Springer, Heidelberg (1986)"},{"key":"14_CR2","first-page":"712","volume-title":"Term Rewriting Systems","author":"E. Barendsen","year":"2003","unstructured":"Barendsen, E.: Term graph rewriting. In: Bezem, M., Klop, J.W., de Vrijer, R. (eds.) Term Rewriting Systems, pp. 712\u2013743. Cambridge Univ. Press, Cambridge (2003)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/11780342_11","volume-title":"Logical Approaches to Computational Barriers","author":"U. Lago Dal","year":"2006","unstructured":"Dal Lago, U., Martini, S.: An invariant cost model for the lambda-calculus. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 105\u2013114. Springer, Heidelberg (2006)"},{"key":"14_CR5","unstructured":"Dal Lago, U., Martini, S.: On constructor rewrite systems and the lambda-calculus. Extended Version (2009), \n                    \n                      http:\/\/arxiv.org\/abs\/0904.4120"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J.-Y. Girard","year":"1998","unstructured":"Girard, J.-Y.: Light linear logic. Inform. and Comp.\u00a0143(2), 175\u2013204 (1998)","journal-title":"Inform. and Comp."},{"key":"14_CR7","first-page":"363","volume-title":"Current trends in theoretical computer science","author":"Y. Gurevich","year":"2001","unstructured":"Gurevich, Y.: The sequential ASM thesis. In: Current trends in theoretical computer science, pp. 363\u2013392. World Scientific, Singapore (2001)"},{"key":"14_CR8","volume-title":"The Implementation of Functional Programming Languages","author":"S.P. Jones","year":"1987","unstructured":"Jones, S.P.: The Implementation of Functional Programming Languages. Prentice-Hall, Englewood Cliffs (1987)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-1-4612-2566-9_11","volume-title":"Feasible Mathematics II","author":"D. Leivant","year":"1995","unstructured":"Leivant, D.: Ramified recurrence and computational complexity I: word recurrence and poly-time. In: Feasible Mathematics II, pp. 320\u2013343. Birkh\u00e4user, Basel (1995)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-44404-1_3","volume-title":"Logic for Programming and Automated Reasoning","author":"J.-Y. Marion","year":"2000","unstructured":"Marion, J.-Y., Moyen, J.-Y.: Efficient first order functional program interpreter with time bound certifications. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS, vol.\u00a01955, pp. 25\u201342. Springer, Heidelberg (2000)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-52753-2_47","volume-title":"CSL \u201989","author":"M. Parigot","year":"1990","unstructured":"Parigot, M.: On the representation of data in lambda-calculus. In: B\u00f6rger, E., Kleine B\u00fcning, H., Richter, M.M. (eds.) CSL 1989. LNCS, vol.\u00a0440, pp. 309\u2013321. Springer, Heidelberg (1990)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/3-540-57182-5_52","volume-title":"Mathematical Foundations of Computer Science 1993","author":"M. Parigot","year":"1993","unstructured":"Parigot, M., Rozi\u00e8re, P.: Constant time reductions in lambda-caculus. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 608\u2013617. Springer, Heidelberg (1993)"},{"issue":"2","key":"14_CR13","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. Theoretical Computer Science\u00a01(2), 125\u2013159 (1975)","journal-title":"Theoretical Computer Science"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-36377-7_4","volume-title":"The Essence of Computation","author":"D. Sands","year":"2002","unstructured":"Sands, D., Gustavsson, J., Moran, A.: Lambda calculi and linear speedups. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol.\u00a02566, pp. 60\u201382. Springer, Heidelberg (2002)"},{"key":"14_CR15","first-page":"102","volume-title":"4th International Conference on Functional Programming, Proceedings","author":"Z. Splawski","year":"1999","unstructured":"Splawski, Z., Urzyczyn, P.: Type fixpoints: Iteration vs. recursion. In: 4th International Conference on Functional Programming, Proceedings, pp. 102\u2013113. ACM Press, New York (1999)"},{"key":"14_CR16","first-page":"1","volume-title":"Handbook of Theoretical Computer Science, Algorithms and Complexity","author":"P. Emde Boas van","year":"1990","unstructured":"van Emde Boas, P.: Machine models and simulation. In: Handbook of Theoretical Computer Science, Algorithms and Complexity, pp. 1\u201366. MIT Press, Cambridge (1990)"},{"key":"14_CR17","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"C. Wadsworth","year":"1980","unstructured":"Wadsworth, C.: Some unusual \u03bb-calculus numeral systems. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, London (1980)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T20:34:02Z","timestamp":1552077242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}