{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:56:35Z","timestamp":1730314595547,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,9,7]]},"DOI":"10.1145\/1599410.1599432","type":"proceedings-article","created":{"date-parts":[[2009,9,8]],"date-time":"2009-09-08T12:53:09Z","timestamp":1252414389000},"page":"171-182","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["An embedded declarative data transformation language"],"prefix":"10.1145","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[{"name":"University of North Texas, Denton, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,9,7]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1305\/ndjfl\/1093888220"},{"key":"e_1_3_2_1_2_1","volume-title":"Die Widerspruchsfreiheit der allgemeinen Mengenlhere. Mathematische Annalen, (114): 305--315","author":"Ackermann Wilhelm Friedrich","year":"1937","unstructured":"Wilhelm Friedrich Ackermann . Die Widerspruchsfreiheit der allgemeinen Mengenlhere. Mathematische Annalen, (114): 305--315 , 1937 . Wilhelm Friedrich Ackermann. Die Widerspruchsfreiheit der allgemeinen Mengenlhere. Mathematische Annalen, (114): 305--315, 1937."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1016\/S0304-3975(00)00109-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/321892.321894"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/636517.636527"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.5555\/646820.706594"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/BF01700692"},{"unstructured":"Juris\n Hartmanis\n and \n Theodore P.\n Baker\n . \n On simple goedel numberings and translations\n . In Jacques Loeckx editor ICALP volume \n 14\n of \n Lecture Notes in Computer Science pages \n 301\n --\n 316\n . \n Springer 1974\n . ISBN 3-540-06841-4. URL http:\/\/dblp.uni-trier.de\/db\/conf\/icalp\/icalp74.html#HartmanisB74. Juris Hartmanis and Theodore P. Baker. On simple goedel numberings and translations. In Jacques Loeckx editor ICALP volume 14 of Lecture Notes in Computer Science pages 301--316. Springer 1974. ISBN 3-540-06841-4. URL http:\/\/dblp.uni-trier.de\/db\/conf\/icalp\/icalp74.html#HartmanisB74.","key":"e_1_3_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.2307\/2266211"},{"key":"e_1_3_2_1_10_1","volume-title":"On Interpretations of Arithmetic and Set Theory. Notre Dame J. Formal Logic Volume, 48 (4): 497--510","author":"Kaye Richard","year":"2007","unstructured":"Richard Kaye and Tin Lock Wong . On Interpretations of Arithmetic and Set Theory. Notre Dame J. Formal Logic Volume, 48 (4): 497--510 , 2007 . Richard Kaye and Tin Lock Wong. On Interpretations of Arithmetic and Set Theory. Notre Dame J. Formal Logic Volume, 48 (4): 497--510, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1002\/malq.200610026"},{"key":"e_1_3_2_1_12_1","volume-title":"The Art of Computer Programming","author":"Knuth Donald","year":"2006","unstructured":"Donald Knuth . The Art of Computer Programming , Volume 4 , draft, 2006 . http:\/\/www-cs-faculty.stanford.edu\/~knuth\/taocp.html. Donald Knuth. The Art of Computer Programming, Volume 4, draft, 2006. http:\/\/www-cs-faculty.stanford.edu\/~knuth\/taocp.html."},{"key":"e_1_3_2_1_13_1","volume-title":"The art of computer programming","author":"Knuth Donald E.","year":"1997","unstructured":"Donald E. Knuth . The art of computer programming , volume 2 ( 3 rd ed.): seminumerical algorithms. Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA , 1997 . ISBN 0201896842. Donald E. Knuth. The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1997. ISBN 0201896842.","edition":"3"},{"key":"e_1_3_2_1_14_1","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"Koza John R.","year":"1992","unstructured":"John R. Koza . Genetic Programming: On the Programming of Computers by Means of Natural Selection . MIT Press , Cambridge, MA, USA , 1992 . ISBN 0-262-11170-5. John R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992. ISBN 0-262-11170-5."},{"key":"e_1_3_2_1_15_1","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"Li Ming","year":"1993","unstructured":"Ming Li and Paul Vit\u00e1nyi . An introduction to Kolmogorov complexity and its applications . Springer-Verlag New York, Inc. , New York, NY, USA , 1993 . ISBN 0-387-94053-7. Ming Li and Paul Vit\u00e1nyi. An introduction to Kolmogorov complexity and its applications. Springer-Verlag New York, Inc., New York, NY, USA, 1993. ISBN 0-387-94053-7."},{"key":"e_1_3_2_1_16_1","volume-title":"Categories for the Working Mathematician","author":"Lane Saunders Mac","year":"1998","unstructured":"Saunders Mac Lane . Categories for the Working Mathematician . Springer-Verlag , New York, NY, USA , 1998 . Saunders Mac Lane. Categories for the Working Mathematician. Springer-Verlag, New York, NY, USA, 1998."},{"issue":"2","key":"e_1_3_2_1_17_1","first-page":"101","article-title":"A permutations representation that knows what \"eulerian\" means. Discrete Mathematics&","volume":"4","author":"Mantaci Roberto","year":"2001","unstructured":"Roberto Mantaci and Fanja Rakotondrajao . A permutations representation that knows what \"eulerian\" means. Discrete Mathematics& Theoretical Computer Science , 4 ( 2 ): 101 -- 108 , 2001 . Roberto Mantaci and Fanja Rakotondrajao. A permutations representation that knows what \"eulerian\" means. Discrete Mathematics&Theoretical Computer Science, 4 (2): 101--108, 2001.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Conrado\n Martinez\n and \n Xavier\n Molinero\n .\n Generic algorithms for the generation of combinatorial objects\n . In Branislav Rovan and Peter Vojtas editors MFCS volume \n 2747\n of \n Lecture Notes in Computer Science pages \n 572\n --\n 581\n . \n Springer 2003\n . Conrado Martinez and Xavier Molinero. Generic algorithms for the generation of combinatorial objects. In Branislav Rovan and Peter Vojtas editors MFCS volume 2747 of Lecture Notes in Computer Science pages 572--581. Springer 2003.","key":"e_1_3_2_1_18_1","DOI":"10.1007\/978-3-540-45138-9_51"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/367177.367199"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/224164.224225"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/197320.197356"},{"unstructured":"Lawrence C.\n Paulson\n .\n A Concrete Final Coalgebra Theorem for ZF Set Theory\n . In Peter Dybjer Bengt Nordstr\u00f6m and Jan M. Smith editors TYPES volume \n 996\n of \n Lecture Notes in Computer Science pages \n 120\n --\n 139\n . \n Springer 1994\n . ISBN 3-540-60579-7. Lawrence C. Paulson. A Concrete Final Coalgebra Theorem for ZF Set Theory. In Peter Dybjer Bengt Nordstr\u00f6m and Jan M. Smith editors TYPES volume 996 of Lecture Notes in Computer Science pages 120--139. Springer 1994. ISBN 3-540-60579-7.","key":"e_1_3_2_1_22_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.2307\/2267610"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1017\/S1471068404002091"},{"key":"e_1_3_2_1_25_1","volume-title":"Universit\u00e9 de Montr\u00e9al","author":"Pigeon Stephen","year":"2001","unstructured":"Stephen Pigeon . Contributions \u00e0 la compression de donn\u00e9es. Ph.d. thesis , Universit\u00e9 de Montr\u00e9al , Montr\u00e9al , 2001 . Stephen Pigeon. Contributions \u00e0 la compression de donn\u00e9es. Ph.d. thesis, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1090\/S0002-9939-1950-0038912-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1142\/S012905410300156X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.2977\/prims\/1195190375"},{"key":"e_1_3_2_1_29_1","volume-title":"Hylomorphisms and Hereditarily Finite Data Types in Haskell","author":"Tarau Paul","year":"2009","unstructured":"Paul Tarau . Declarative Combinatorics : Isomorphisms , Hylomorphisms and Hereditarily Finite Data Types in Haskell , January 2009 . http:\/\/arXiv.org\/abs\/0808.2953, unpublished draft, 104 pages. Paul Tarau. Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell, January 2009. http:\/\/arXiv.org\/abs\/0808.2953, unpublished draft, 104 pages."},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of CICLOPS 2008","author":"Tarau Paul","year":"2008","unstructured":"Paul Tarau . Declarative Combinatorics in Prolog: ShapeShifting Data Objects with Isomorphisms and Hylomorphisms. In Manuel Carro and Bart Demoen, editors , Proceedings of CICLOPS 2008 , 8th International Colloquium on Implementation of Constraint and LOgic Programming Systems, pages 107- -123, December 2008 . URL http:\/\/clip.dia.fi.upm.es\/Conferences\/CICLOPS-2008\/CICLOPS-2008-proceedings.pdf. Paul Tarau. Declarative Combinatorics in Prolog: ShapeShifting Data Objects with Isomorphisms and Hylomorphisms. In Manuel Carro and Bart Demoen, editors, Proceedings of CICLOPS 2008, 8th International Colloquium on Implementation of Constraint and LOgic Programming Systems, pages 107--123, December 2008. URL http:\/\/clip.dia.fi.upm.es\/Conferences\/CICLOPS-2008\/CICLOPS-2008-proceedings.pdf."},{"unstructured":"Jean\n Vuillemin\n .\n Digital algebra and circuits\n . In Nachum Dershowitz editor Verification\n : Theory and Practice volume \n 2772\n of \n Lecture Notes in Computer Science pages \n 733\n --\n 746\n . \n Springer 2003\n . ISBN 3-540-21002-4. Jean Vuillemin. Digital algebra and circuits. In Nachum Dershowitz editor Verification: Theory and Practice volume 2772 of Lecture Notes in Computer Science pages 733--746. Springer 2003. ISBN 3-540-21002-4.","key":"e_1_3_2_1_31_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/358841.358852"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1109\/12.295849"},{"key":"e_1_3_2_1_34_1","volume-title":"Higher-order extensions to Prolog -- are they needed? In D","author":"Warren D.H.D.","year":"1981","unstructured":"D.H.D. Warren . Higher-order extensions to Prolog -- are they needed? In D . Michie, J. Hayes, and Y.H. Pao, editors, Machine Intelligence 10. Ellis Horwood , 1981 . D.H.D. Warren. Higher-order extensions to Prolog -- are they needed? In D. Michie, J. Hayes, and Y.H. Pao, editors, Machine Intelligence 10. Ellis Horwood, 1981."}],"event":{"sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"acronym":"PPDP '09","name":"PPDP '09: Principles and Practice of Declarative Programming","location":"Coimbra Portugal"},"container-title":["Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1599410.1599432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T19:58:33Z","timestamp":1673467113000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1599410.1599432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,7]]},"references-count":34,"alternative-id":["10.1145\/1599410.1599432","10.1145\/1599410"],"URL":"https:\/\/doi.org\/10.1145\/1599410.1599432","relation":{},"subject":[],"published":{"date-parts":[[2009,9,7]]},"assertion":[{"value":"2009-09-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}