{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:39:59Z","timestamp":1725475199697},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540692690"},{"type":"electronic","value":"9783540692706"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11965893_24","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T07:52:22Z","timestamp":1165477942000},"page":"344-358","source":"Crossref","is-referenced-by-count":2,"title":["Structural Recursion on Ordered Trees and List-Based Complex Objects"],"prefix":"10.1007","author":[{"given":"Edward L.","family":"Robertson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence V.","family":"Saxton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Van Gucht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stijn","family":"Vansummeren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/BF01354881","volume":"4","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Beeri, C.: The power of languages for the manipulation of complex values. VLDB Journal\u00a04(4), 727\u2013794 (1995)","journal-title":"VLDB Journal"},{"key":"24_CR2","volume-title":"Foundations Of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations Of Databases. Addison-Wesley, Reading (1995)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1145\/129712.129740","volume-title":"STOC 1992","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions (extended abstract). In: STOC 1992, pp. 283\u2013293. ACM Press, New York (1992)"},{"key":"24_CR4","unstructured":"Boag, S., Chamberlin, D., Fern\u00e1ndez, M.F., Florescu, D., Robie, J., Sim\u00e9on, J.: XQuery 1.0: An XML Query Language. W3C Candidate Recommendation (November 2005)"},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/jcss.1998.1562","volume":"57","author":"A.J. Bonner","year":"1998","unstructured":"Bonner, A.J., Mecca, G.: Sequences, datalog, and transducers. J. Comput. Syst. Sci.\u00a057(3), 234\u2013259 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR6","volume-title":"Computability and Logic","author":"G. Boolos","year":"1989","unstructured":"Boolos, G., Jeffrey, R.: Computability and Logic, 3rd edn. Cambridge University Press, Cambridge (1989)","edition":"3"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s007780050084","volume":"9","author":"P. Buneman","year":"2000","unstructured":"Buneman, P., Fernandez, M., Suciu, D.: UnQL: a query language and algebra for semistructured data based on structural recursion. VLDB Journal\u00a09(1), 76\u2013110 (2000)","journal-title":"VLDB Journal"},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(95)00024-Q","volume":"149","author":"P. Buneman","year":"1995","unstructured":"Buneman, P., Naqvi, S.A., Tannen, V., Wong, L.: Principles of programming with complex objects and collection types. Theoretical Comput. Sci.\u00a0149(1), 3\u201348 (1995)","journal-title":"Theoretical Comput. Sci."},{"key":"24_CR9","unstructured":"Caseiro, V.: Equations for Defining Poly-time Functions. PhD thesis, University of Oslo (1997)"},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","volume":"21","author":"A.K. Chandra","year":"1980","unstructured":"Chandra, A.K., Harel, D.: Computable queries for relational data bases. J. Comput. Syst. Sci.\u00a021(2), 156\u2013178 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR11","first-page":"24","volume-title":"Logic, Methodology, and Philosophy of Science II","author":"A. Cobham","year":"1965","unstructured":"Cobham, A.: The intrinsic computational difficulty of functions. In: Logic, Methodology, and Philosophy of Science II, pp. 24\u201330. Springer, Heidelberg (1965)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/3-540-62222-5_64","volume-title":"Database Theory - ICDT 1997","author":"L.S. Colby","year":"1996","unstructured":"Colby, L.S., Libkin, L.: Tractable iteration mechanisms for bag languages. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol.\u00a01186, pp. 461\u2013475. Springer, Heidelberg (1996)"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/182591.182611","volume-title":"PODS 1994","author":"L.S. Colby","year":"1994","unstructured":"Colby, L.S., Robertson, E.L., Saxton, L.V., Gucht, D.V.: A query language for list-based complex objects. In: PODS 1994, pp. 179\u2013189. ACM Press, New York (1994)"},{"key":"24_CR14","unstructured":"Draper, D., Fankhauser, P., Fern\u00e1ndez, M.F., Malhotra, A., Rose, K., Rys, M., Sim\u00e9on, J., Wadler, P.: XQuery 1.0 and XPath 2.0 Formal Semantics. W3C Candidate Recommendation (June 2006)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-44503-X_18","volume-title":"Database Theory - ICDT 2001","author":"M.F. Fern\u00e1ndez","year":"2000","unstructured":"Fern\u00e1ndez, M.F., Sim\u00e9on, J., Wadler, P.: A semi-monad for semi-structured data. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, pp. 263\u2013300. Springer, Heidelberg (2000)"},{"key":"24_CR16","unstructured":"Grumbach, S., Milo, T.: Personal communication"},{"issue":"2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1006\/inco.1998.2777","volume":"150","author":"S. Grumbach","year":"1999","unstructured":"Grumbach, S., Milo, T.: An algebra for pomsets. Inf. Comput.\u00a0150(2), 268\u2013306 (1999)","journal-title":"Inf. Comput."},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BFb0028020","volume-title":"Computer Science Logic","author":"M. Hofmann","year":"1998","unstructured":"Hofmann, M.: A mixed modal\/linear lambda calculus with applications to Bellantoni-Cook safe recursion. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414, pp. 275\u2013294. Springer, Heidelberg (1998)"},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1017\/S0956796899003433","volume":"9","author":"M. Hofmann","year":"1999","unstructured":"Hofmann, M.: Semantics of linear\/modal lambda calculus. Journal of Functional Programming\u00a09(3), 247\u2013277 (1999)","journal-title":"Journal of Functional Programming"},{"issue":"1","key":"24_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0022-0000(93)90022-O","volume":"47","author":"R. Hull","year":"1993","unstructured":"Hull, R., Su, J.: Algebraic and calculus query languages for recursively typed complex objects. J. Comput. Syst. Sci.\u00a047(1), 121\u2013156 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"24_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(94)00287-8","volume":"155","author":"N. Immerman","year":"1996","unstructured":"Immerman, N., Patnaik, S., Stemple, D.W.: The expressiveness of a family of finite set languages. Theor. Comput. Sci.\u00a0155(1), 111\u2013140 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR22","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/1065167.1065179","volume-title":"PODS 2005","author":"C. Koch","year":"2005","unstructured":"Koch, C.: On the complexity of nonrecursive XQuery and functional query languages on complex values. In: PODS 2005, pp. 84\u201397. ACM Press, New York (2005)"},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/158511.158659","volume-title":"POPL 1993","author":"D. Leivant","year":"1993","unstructured":"Leivant, D.: Stratified functional programs and computational complexity. In: POPL 1993, pp. 325\u2013333. ACM Press, New York (1993)"},{"issue":"2","key":"24_CR24","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1006\/jcss.1997.1523","volume":"55","author":"L. Libkin","year":"1997","unstructured":"Libkin, L., Wong, L.: Query languages for bags and aggregate functions. J. Comput. Syst. Sci.\u00a055(2), 241\u2013272 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"24_CR25","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(93)90345-T","volume":"119","author":"V.Y. Sazonov","year":"1993","unstructured":"Sazonov, V.Y.: Hereditarily-finite sets, data bases and polynomial-time computability. Theor. Comput. Sci.\u00a0119(1), 187\u2013214 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"24_CR26","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0304-3975(96)00293-9","volume":"176","author":"D. Suciu","year":"1997","unstructured":"Suciu, D.: Bounded fixpoints for complex objects. Theor. Comput. Sci.\u00a0176(1-2), 283\u2013328 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-58907-4_10","volume-title":"Database Theory - ICDT \u201995","author":"D. Suciu","year":"1995","unstructured":"Suciu, D., Wong, L.: On two forms of structural recursion. In: Y. Vardi, M., Gottlob, G. (eds.) ICDT 1995. LNCS, vol.\u00a0893, pp. 111\u2013124. Springer, Heidelberg (1995)"},{"key":"24_CR28","unstructured":"Thompson, H.S., Beech, D., Maloney, M., Mendelsohn, N.: XML Schema Part 1: Structures. W3C Recommendation (May 2001)"},{"key":"24_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-30570-5_7","volume-title":"Database Theory - ICDT 2005","author":"J. Bussche Van den","year":"2004","unstructured":"Van den Bussche, J., Van Gucht, D., Vansummeren, S.: Well-definedness and semantic type-checking in the nested relational calculus and xquery. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 99\u2013113. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2013 ICDT 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11965893_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T05:49:33Z","timestamp":1587275373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11965893_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540692690","9783540692706"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11965893_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}