{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:35Z","timestamp":1725489515989},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540731467"},{"type":"electronic","value":"9783540731474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73147-4_9","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T00:01:50Z","timestamp":1187308910000},"page":"182-195","source":"Crossref","is-referenced-by-count":2,"title":["Linear Recursive 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":[{"issue":"3","key":"9_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), 3\u201357 (1993)","journal-title":"Theoretical Computer Science"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11874683_8","volume-title":"Computer Science Logic","author":"S. Alves","year":"2006","unstructured":"Alves, S., Fern\u00e1ndez, M., Florido, M., Mackie, I.: The power of linear functions. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 119\u2013134. Springer, Heidelberg (2006)"},{"key":"9_CR3","unstructured":"Alves, S., Fern\u00e1ndez, M., Florido, M., Mackie, I.: G\u00f6del\u2019s System T revisited. Technical Report TR-07-02, King\u2019s College London (2007)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-540-71389-0_3","volume-title":"Proceedings FOSSACS","author":"S. Alves","year":"2007","unstructured":"Alves, S., Fern\u00e1ndez, M., Florido, M., Mackie, I.: Iterator types. In: Seidl, H. (ed.) FOSSACS 2007, vol.\u00a04423, pp. 17\u201331. Springer, Heidelberg (2007)"},{"key":"9_CR5","unstructured":"Alves, S., Fern\u00e1ndez, M., Florido, M., Mackie, I.: Very primitive recursive functions. In: Computation and Logic in the Real World, CiE 2007, Quaderni del Dipartimento di Scienze Matematiche e Informatiche Roberto Magari (2007)"},{"key":"9_CR6","first-page":"300","volume-title":"Proc. Logic in Computer Science (LICS\u201998)","author":"A. Asperti","year":"1998","unstructured":"Asperti, A.: Light affine logic. In: Proc. Logic in Computer Science (LICS\u201998), pp. 300\u2013308. IEEE Computer Society, Washington (1998)"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/504077.504081","volume":"3","author":"A. Asperti","year":"2002","unstructured":"Asperti, A., Roversi, L.: Intuitionistic light affine logic. ACM Transactions on Computational Logic\u00a03(1), 137\u2013175 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-540-24727-2_4","volume-title":"Proc. Foundations of Software Science and Computation Structures (FOSSACS\u201904)","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":"9_CR9","volume-title":"Theory of Computation","author":"W.S. Brainerd","year":"1974","unstructured":"Brainerd, W.S., Landweber, L.H.: Theory of Computation. John Wiley and Sons, Inc, New York, NY, USA (1974)"},{"key":"9_CR10","unstructured":"Burroni, A.: R\u00e9cursivit\u00e9 graphique, I: Cat\u00e9gorie des fonctions r\u00e9cursives primitives formelles. Cahiers de topologie et g\u00e9om\u00e9trie diff\u00e9rentielle cat\u00e9goriques, XXVII:49 (1986)"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J. Girard","year":"1998","unstructured":"Girard, J.-Y.: Light linear logic. Information and Computation\u00a0143(2), 175\u2013204 (1998)","journal-title":"Information and Computation"},{"issue":"1","key":"9_CR12","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":"9_CR13","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":"9_CR14","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"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Gladstone, M.: A reduction of the recursion scheme. J. Symb. Logic, 32 (1967)","DOI":"10.2307\/2270177"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Gladstone, M.: Simplification of the recursion scheme. J. Symb. Logic 36 (1971)","DOI":"10.2307\/2272468"},{"key":"9_CR17","unstructured":"Kleene, S.C.: Introduction to Metamathematics. North-Holland (1952)"},{"issue":"1-2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2003.10.018","volume":"318","author":"Y. Lafont","year":"2004","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. Theoretical Computer Science\u00a0318(1-2), 163\u2013180 (2004)","journal-title":"Theoretical Computer Science"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Lawvere, F.: An elementary theory of the category of sets. Proc. Nat. Acad. Sci. 52 (1964)","DOI":"10.1073\/pnas.52.6.1506"},{"issue":"3","key":"9_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"},{"key":"9_CR21","volume-title":"Classical recursion theory","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical recursion theory. Elsevier Science, Amsterdam (1999)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Robinson, R.: Primitive recursive functions. Bull. Am. Math. Soc., 53 (2004)","DOI":"10.1090\/S0002-9904-1947-08911-4"},{"key":"9_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22378-9","volume-title":"Recursion Theory","author":"J. Shoenfield","year":"1993","unstructured":"Shoenfield, J.: Recursion Theory. Springer, Heidelberg (1993)"},{"key":"9_CR24","volume-title":"Fondements Mathematiques de L\u2019Informatique","author":"J. Stern","year":"1994","unstructured":"Stern, J.: Fondements Mathematiques de L\u2019Informatique. Ediscience International, Paris (1994)"},{"key":"9_CR25","volume-title":"Proc. Logic in Computer Science (LICS 2001)","author":"K. Terui","year":"2001","unstructured":"Terui, K.: Light affine calculus and polytime strong normalization. In: Proc. Logic in Computer Science (LICS 2001), IEEE Computer Society, Washington (2001)"}],"container-title":["Lecture Notes in Computer Science","Rewriting, Computation and Proof"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73147-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:12:19Z","timestamp":1605744739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73147-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540731467","9783540731474"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73147-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}