{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:35:40Z","timestamp":1725471340711},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540454588"},{"type":"electronic","value":"9783540454595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11874683_8","type":"book-chapter","created":{"date-parts":[[2006,9,27]],"date-time":"2006-09-27T09:47:26Z","timestamp":1159350446000},"page":"119-134","source":"Crossref","is-referenced-by-count":9,"title":["The Power of Linear Functions"],"prefix":"10.1007","author":[{"given":"Sandra","family":"Alves","sequence":"first","affiliation":[]},{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"M\u00e1rio","family":"Florido","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Mackie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","volume":"111","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S.: Computational Interpretations of Linear Logic. Theoretical Computer Science\u00a0111, 3\u201357 (1993)","journal-title":"Theoretical Computer Science"},{"key":"8_CR2","volume-title":"Proc. Logic in Computer Science (LICS 1998)","author":"A. Asperti","year":"1998","unstructured":"Asperti, A.: Light affine logic. In: Proc. Logic in Computer Science (LICS 1998). IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Asperti, A., Roversi, L.: Intuitionistic light affine logic. ACM Transactions on Computational Logic (2002)","DOI":"10.1145\/504077.504081"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-24727-2_4","volume-title":"Foundations of Software Science and Computation Structures","author":"P. Baillot","year":"2004","unstructured":"Baillot, P., Mogbil, V.: Soft lambda-calculus: A language for polynomial time computation. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 27\u201341. Springer, Heidelberg (2004)"},{"key":"8_CR5","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, 2nd revised edn., vol.\u00a0103. North-Holland Publishing Company, Amsterdam (1984)","edition":"2"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1017\/S0960129504004633","volume":"15","author":"M. Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M., Mackie, I., Sinot, F.-R.: Closed reduction: explicit substitutions without alpha conversion. Mathematical Structures in Computer Science\u00a015(2), 343\u2013381 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Girard, J.: Light linear logic. Information and Computation (1998)","DOI":"10.1006\/inco.1998.2700"},{"issue":"1","key":"8_CR8","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), 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1090\/conm\/092\/1003197","volume-title":"Categories in Computer Science and Logic: Proc. of the Joint Summer Research Conference","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y.: Towards a geometry of interaction. In: Gray, J.W., Scedrov, A. (eds.) Categories in Computer Science and Logic: Proc. of the Joint Summer Research Conference, pp. 69\u2013108. American Mathematical Society, Providence (1989)"},{"key":"8_CR10","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Proofs and Types","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol.\u00a07. Cambridge University Press, Cambridge (1989)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(92)90386-T","volume":"97","author":"J.-Y. Girard","year":"1992","unstructured":"Girard, J.-Y., Scedrov, A., Scott, P.J.: Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science\u00a097, 1\u201366 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(89)90100-X","volume":"64","author":"J. Hindley","year":"1989","unstructured":"Hindley, J.: BCK-combinators and linear lambda-terms have types. Theoretical Computer Science (TCS)\u00a064(1), 97\u2013105 (1989)","journal-title":"Theoretical Computer Science (TCS)"},{"key":"8_CR13","volume-title":"Proc. Logic in Computer Science (LICS 1999)","author":"M. Hofmann","year":"1999","unstructured":"Hofmann, M.: Linear types and non-size-increasing polynomial time computation. In: Proc. Logic in Computer Science (LICS 1999). IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"8_CR14","unstructured":"Holmstr\u00f6m, S.: Linear functional programming. In: Johnsson, T., Peyton Jones, S.L., Karlsson, K. (eds.) Proceedings of the Workshop on Implementation of Lazy Functional Languages, pp. 13\u201332 (1988)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. Theoretical Computer Science (2004)","DOI":"10.1016\/j.tcs.2003.10.018"},{"key":"8_CR16","first-page":"366","volume-title":"Proceedings of the Twentieth Annual IEEE Symp. on Logic in Computer Science, LICS 2005","author":"U.D. Lago","year":"2005","unstructured":"Lago, U.D.: The geometry of linear higher-order recursion. In: Panangaden, P. (ed.) Proceedings of the Twentieth Annual IEEE Symp. on Logic in Computer Science, LICS 2005, pp. 366\u2013375. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"8_CR17","first-page":"363","volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"J. Lambek","year":"1980","unstructured":"Lambek, J.: From lambda calculus to cartesian closed categories. In: Seldin, J.P., Hindley, J.R. (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 363\u2013402. Academic Press, London (1980)"},{"key":"8_CR18","series-title":"Cambridge Studies in Advanced Mathematics","volume-title":"Introduction to Higher Order Categorical Logic","author":"J. Lambek","year":"1986","unstructured":"Lambek, J., Scott, P.J.: Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics, vol.\u00a07. Cambridge University Press, Cambridge (1986)"},{"issue":"4","key":"8_CR19","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1017\/S0956796800001131","volume":"4","author":"I. Mackie","year":"1994","unstructured":"Mackie, I.: Lilac: A functional programming language based on linear logic. Journal of Functional Programming\u00a04(4), 395\u2013433 (1994)","journal-title":"Journal of Functional Programming"},{"issue":"3","key":"8_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00873993","volume":"1","author":"I. Mackie","year":"1993","unstructured":"Mackie, I., Rom\u00e1n, L., Abramsky, S.: An internal language for autonomous categories. Journal of Applied Categorical Structures\u00a01(3), 311\u2013343 (1993)","journal-title":"Journal of Applied Categorical Structures"},{"issue":"2","key":"8_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M. Newman","year":"1942","unstructured":"Newman, M.: On theories with a combinatorial definition of \u201cequivalence\u201d. Annals of Mathematics\u00a043(2), 223\u2013243 (1942)","journal-title":"Annals of Mathematics"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0037116","volume-title":"Typed Lambda Calculi and Applications","author":"C. Paulin-Mohring","year":"1993","unstructured":"Paulin-Mohring, C.: Inductive Definitions in the System Coq - Rules and Properties. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664. Springer, Heidelberg (1993)"},{"key":"8_CR23","first-page":"79","volume-title":"Handbook of Logic in Computer Science","author":"I. Phillips","year":"1992","unstructured":"Phillips, I.: Recursion theory. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol.\u00a01, pp. 79\u2013187. Oxford University Press, Oxford (1992)"},{"key":"8_CR24","volume-title":"Proc. Logic in Computer Science (LICS 2001)","author":"K. Terui","year":"2001","unstructured":"Terui, K.: Affine lambda-calculus and polytime strong normalization. In: Proc. Logic in Computer Science (LICS 2001). IEEE Computer Society Press, Los Alamitos (2001)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11874683_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:24:48Z","timestamp":1619493888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11874683_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454588","9783540454595"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11874683_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}