{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:20:30Z","timestamp":1787509230810,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540589075","type":"print"},{"value":"9783540491361","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58907-4_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:53:29Z","timestamp":1330257209000},"page":"439-454","source":"Crossref","is-referenced-by-count":4,"title":["Space usage in functional query languages"],"prefix":"10.1007","author":[{"given":"Serge","family":"Abiteboul","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerd","family":"Hillebrand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"33_CR1","unstructured":"S. Abiteboul and C. Beeri. On the Power of Languages for the Manipulation of Complex Objects. INRIA Research Report 846, 1988."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"S. Abiteboul, P. Kanellakis, S. Ramaswamy, and E. Waller. Method Schemas. Technical Report CS-92-33, Brown University, 1992. (An earlier version appeared in Proc. 9th ACM PODS, 1990).","DOI":"10.1145\/298514.298538"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"A. V. Aho and J. D. Ullman. Universality of Data Retrieval Languages. In Proc. 6th ACM POPL, pp. 110\u2013117, 1979.","DOI":"10.1145\/567752.567763"},{"issue":"8","key":"33_CR4","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"J. Backus. Can Programming be Liberated from the von Neumann Style? A Functional Style of Programming and its Algebra of Programs. CACM 21(8):613\u2013641, 1978.","journal-title":"CACM"},{"key":"33_CR5","unstructured":"H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North Holland, 1984."},{"issue":"2","key":"33_CR6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/319702.319711","volume":"7","author":"P. Buneman","year":"1982","unstructured":"P. Buneman, R. Frankel, and R. Nikhil. An Implementation Technique for Database Query Languages. ACM Trans. Database Syst. 7(2):164\u2013186, 1982.","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"33_CR7","first-page":"156","volume":"21","author":"A. K. Chandra","year":"1980","unstructured":"A. K. Chandra and D. Harel. Computable Queries for Relational Data Bases. JCSS, 21(2):156\u2013178, 1980.","journal-title":"JCSS"},{"key":"33_CR8","unstructured":"A. Church. The Calculi of Lambda-Conversion. Princeton University Press, 1941."},{"issue":"6","key":"33_CR9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"E. F. Codd","year":"1970","unstructured":"E. F. Codd. A Relational Model of Data for Large Shared Data Banks. CACM, 13(6):377\u2013387, 1970.","journal-title":"CACM"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"B. Courcelle. Recursive Applicative Program Schemes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pp. 459\u2013492. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50014-7"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"M. J. Gordon, R. Milner, L. Morris, M. Newey and C. P. Wadsworth. A Metalanguage for Interactive Proof in LCF. In Proc. 5th ACM POPL, pp. 119\u2013130, 1978.","DOI":"10.1145\/512760.512773"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"S. Greibach. Theory of Program Structures: Schemes, Semantics, Verification. Springer LNCS 36, 1975.","DOI":"10.1007\/BFb0023017"},{"key":"33_CR13","unstructured":"G. Hillebrand. Finite Model Theory in the Simply Typed Lambda Calculus. Ph.D. thesis, Brown University, 1994. Available by anonymous ftp from ftp.cs.brown.edu:\/pub\/techreports\/94\/cs94-24.ps.Z."},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"G. Hillebrand and P. Kanellakis. Functional Database Query Languages as Typed Lambda Calculi of Fixed Order. In Proc. 13th ACM PODS, pp. 222\u2013231, 1994.","DOI":"10.1145\/182591.182615"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"G. Hillebrand, P. Kanellakis, and H. Mairson. Database Query Languages Embedded in the Typed Lambda Calculus. In Proc. 8th IEEE LICS, pp. 332\u2013343, 1993.","DOI":"10.1109\/LICS.1993.287575"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"G. Hillebrand, P. Kanellakis, and S. Ramaswamy. Functional Programming Formalisms for OODB Methods. In Proc. of the NATO ASI Summer School on OODEs, Turkey 1993. To appear in Springer LNCS.","DOI":"10.1007\/978-3-642-57939-4_4"},{"key":"33_CR17","unstructured":"J. R. Hindley and J. P. Seldin. Introduction to Combinators and \u03bb-Calculus. Cambridge University Press, 1986."},{"key":"33_CR18","unstructured":"P. Hudak and P. Wadler, editors. Report on the Functional Programming Language Haskell. Technical Report YALEU\/DCS\/RR656, Dept. of Computer Science, Yale University, 1988."},{"issue":"1","key":"33_CR19","first-page":"219","volume":"43","author":"R. Hull","year":"1991","unstructured":"R. Hull and J. Su. On the Expressive Power of Database Queries with Intermediate Types. JCSS 43(1):219\u2013267, 1991.","journal-title":"JCSS"},{"key":"33_CR20","unstructured":"P. Kanellakis, J. Mitchell, and H. Mairson. Unification and ML Type Reconstruction. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pp. 444\u2013479. MIT Press, 1991."},{"key":"33_CR21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(93)90219-J","volume":"116","author":"G. Kuper","year":"1993","unstructured":"G. Kuper and M. Y. Vardi. On the Complexity of Queries in the Logical Data Model. TCS 116:33\u201358, 1993.","journal-title":"TCS"},{"issue":"3","key":"33_CR22","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/155271.155274","volume":"18","author":"G. M. Kuper","year":"1993","unstructured":"G. M. Kuper and M. Y. Vardi. The Logical Data Model. ACM Trans. Database Syst. 18(3):379\u2013413, 1993.","journal-title":"ACM Trans. Database Syst."},{"key":"33_CR23","unstructured":"R. Milner. The Standard ML Core Language. Polymorphism, 2(2), 1985. (An earlier version appeared in Proc. of the 1984 ACM Symposium on Lisp and Functional Programming)."},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"D. Suciu and J. Paredaens. Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure. In Proc. 13th ACM PODS, pp. 201\u2013209, 1994.","DOI":"10.1145\/182591.182613"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"D. A. Turner. Miranda: A Non-Strict Functional Language with Polymorphic Types. In J.-P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, pp. 1\u201316. Springer LNCS 201, 1985.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"M. Y. Vardi. The Complexity of Relational Query Languages. In Proc. 14th STOC, pp. 137\u2013146, 1982.","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58907-4_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:24:39Z","timestamp":1605630279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58907-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589075","9783540491361"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-58907-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}