{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:40:31Z","timestamp":1752460831006},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_125","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:38:45Z","timestamp":1330191525000},"page":"60-75","source":"Crossref","is-referenced-by-count":28,"title":["Logical and computational aspects of programming with sets\/bags\/lists"],"prefix":"10.1007","author":[{"given":"Val","family":"Breazu-Tannen","sequence":"first","affiliation":[]},{"given":"Ramesh","family":"Subrahmanyam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"M.P. Atkinson and O.P. Buneman. Types and Persistence in Database Programming Languages. ACM Computing Surveys, June 1987.","DOI":"10.1145\/62070.45066"},{"key":"5_CR2","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 and its Algebra of Programs. Communications of the ACM, 21:613\u2013641, august 1978.","journal-title":"Communications of the ACM"},{"key":"5_CR3","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. Volume 103 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, second edition, 1984."},{"key":"5_CR4","unstructured":"R. Bird and P. Wadler. Introduction to Functional Programming. Series in Computer Science, Prentice Hall International, 1988."},{"key":"5_CR5","unstructured":"[Breazu-Tannen et al., 1991] V. Breazu-Tannen, P. Buneman, and S. Naqvi. Structural Recursion as a Query Language. Unpublished Manuscript, University of Pennsylvania. 1991."},{"key":"5_CR6","unstructured":"P. Buneman, A. Jung, and A. Ohori. Using Powerdomains to Generalize Relational Databases. Theoretical Computer Science, august 1989."},{"issue":"6","key":"5_CR7","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 For Large Shared Databank. Communications of the ACM, 13(6):377\u2013387, 1970.","journal-title":"Communications of the ACM"},{"key":"5_CR8","unstructured":"J. Y. Girard, Y. Lafont, and P. Taylor. Typed Lambda Calculus. Cambridge University Press, 1989."},{"key":"5_CR9","unstructured":"C. A. Gunter. Sets and the semantics of bounded non-determinism. Unpublished manuscript, University of Cambridge. 1986."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"E. Moggi. Categories of Partial Morphisms and the \u03bb p -calculus. In Proceedings of the Category Theory and Computer Programming, Springer-Verlag, 1985.","DOI":"10.1007\/3-540-17162-2_126"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"A. Ohori, P. Buneman, and V. Breazu-Tannen. Database Programming in Machiavelli \u2014 a Polymorphic Language with Static Type Inference. In Proceedings of the ACM SIGMOD conference, pages 46\u201357, May\u2013June 1989.","DOI":"10.1145\/67544.66931"},{"issue":"3","key":"5_CR12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1145\/320557.320568","volume":"2","author":"J.W. Schmidt","year":"1977","unstructured":"J.W. Schmidt. Some High Level Language Constructs for Data of Type Relation. ACM Transactions on Database Systems, 2(3):247\u2013261, september 1977.","journal-title":"ACM Transactions on Database Systems"},{"key":"5_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9575-1","volume-title":"Programming with Sets: An Introduction to SETL","author":"J. T. Schwartz","year":"1986","unstructured":"J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets: An Introduction to SETL. Springer-Verlag, New York, 1986."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"P. Wadler. Views: A Way For Pattern Matching to Cohabit with Data Abstraction. In Proceedings of the Conference on the Principles of Programming Languages, pages 307\u2013313, 1987.","DOI":"10.1145\/41625.41653"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_125.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:53:05Z","timestamp":1605628385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_125","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}