{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T17:10:13Z","timestamp":1739207413107,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642026133"},{"type":"electronic","value":"9783642026140"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02614-0_17","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:47:24Z","timestamp":1246535244000},"page":"170-185","source":"Crossref","is-referenced-by-count":11,"title":["A Groupoid of Isomorphic Data Transformations"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Metaphors We Live By","author":"G. Lakoff","year":"1980","unstructured":"Lakoff, G., Johnson, M.: Metaphors We Live By. University of Chicago Press, Chicago (1980)"},{"key":"17_CR2","unstructured":"Cook, S.: Theories for complexity classes and their propositional translations. In: Complexity of computations and proofs, pp. 1\u201336 (2004)"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01700692","volume":"38","author":"K. G\u00f6del","year":"1931","unstructured":"G\u00f6del, K.: \u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I. Monatshefte f\u00fcr Mathematik und Physik\u00a038, 173\u2013198 (1931)","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-06841-4_69","volume-title":"Automata, Languages and Programming","author":"J. Hartmanis","year":"1974","unstructured":"Hartmanis, J., Baker, T.P.: On simple goedel numberings and translations. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol.\u00a014, pp. 301\u2013316. Springer, Heidelberg (1974)"},{"key":"17_CR5","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1998","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Springer, New York (1998)"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.2307\/2267610","volume":"3","author":"J. Pepis","year":"1938","unstructured":"Pepis, J.: Ein verfahren der mathematischen logik. The Journal of Symbolic Logic\u00a03(2), 61\u201376 (1938)","journal-title":"The Journal of Symbolic Logic"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2266211","volume":"4","author":"L. Kalmar","year":"1939","unstructured":"Kalmar, L.: On the reduction of the decision problem. first paper. ackermann prefix, a single binary predicate. The Journal of Symbolic Logic\u00a04(1), 1\u20139 (1939)","journal-title":"The Journal of Symbolic Logic"},{"issue":"6","key":"17_CR8","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1090\/S0002-9939-1950-0038912-1","volume":"1","author":"J. Robinson","year":"1950","unstructured":"Robinson, J.: General recursive functions. Proceedings of the American Mathematical Society\u00a01(6), 703\u2013718 (1950)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"McCarthy, J.: Recursive functions of symbolic expressions and their computation by machine, part i. Commun. ACM\u00a03(4), 184\u2013195 (1960)","journal-title":"Commun. ACM"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Tarau, P.: Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell, 104 pages (January 2009) (unpublished draft), http:\/\/arXiv.org\/abs\/0808.2953","DOI":"10.1145\/1529282.1529706"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Meijer, E., Hutton, G.: Bananas in Space: Extending Fold and Unfold to Exponential Types. In: FPCA, pp. 324\u2013333 (1995)","DOI":"10.1145\/224164.224225"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"577","DOI":"10.2977\/prims\/1195190375","volume":"12","author":"M.O. Takahashi","year":"1976","unstructured":"Takahashi, M.O.: A Foundation of Finite Mathematics. Publ. Res. Inst. Math. Sci.\u00a012(3), 577\u2013708 (1976)","journal-title":"Publ. Res. Inst. Math. Sci."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Ackermann, W.F.: Die Widerspruchsfreiheit der allgemeinen Mengenlhere. Mathematische Annalen\u00a0(114), 305\u2013315 (1937)","DOI":"10.1007\/BF01594179"},{"key":"17_CR14","series-title":"seminumerical algorithms","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The art of computer programming, 3rd edn. seminumerical algorithms, vol.\u00a02. Addison-Wesley\/ Longman Publishing Co., Inc., Boston (1997)","edition":"3"},{"issue":"2","key":"17_CR15","first-page":"101","volume":"4","author":"R. Mantaci","year":"2001","unstructured":"Mantaci, R., Rakotondrajao, F.: A permutations representation that knows what \u201deulerian\u201d means. Discrete Mathematics & Theoretical Computer Science\u00a04(2), 101\u2013108 (2001)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1088348.1088357","volume-title":"Haskell 2005: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell","author":"A. Alimarine","year":"2005","unstructured":"Alimarine, A., Smetsers, S., van Weelden, A., van Eekelen, M., Plasmeijer, R.: There and back again: arrows for invertible programming. In: Haskell 2005: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, pp. 86\u201397. ACM Press, New York (2005)"},{"key":"17_CR17","unstructured":"Conal Elliott: Data.Bijections Haskell Module, http:\/\/haskell.org\/haskellwiki\/TypeCompose"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Hughes, J.: Generalizing Monads to Arrows Science of Computer Programming\u00a037, 67\u2013111 (2000)","DOI":"10.1016\/S0167-6423(99)00023-4"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-45138-9_51","volume-title":"Mathematical Foundations of Computer Science 2003","author":"C. Martinez","year":"2003","unstructured":"Martinez, C., Molinero, X.: Generic algorithms for the generation of combinatorial objects. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 572\u2013581. Springer, Heidelberg (2003)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Knuth, D.: The Art of Computer Programming, vol. 4, draft (2006), http:\/\/www-cs-faculty.stanford.edu\/~knuth\/taocp.html","DOI":"10.1145\/1283920.1283929"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0020-0190(01)00141-7","volume":"79","author":"W. Myrvold","year":"2001","unstructured":"Myrvold, W., Ruskey, F.: Ranking and unranking permutations in linear time. Information Processing Letters\u00a079, 281\u2013284 (2001)","journal-title":"Information Processing Letters"},{"issue":"1-2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(00)00109-2","volume":"257","author":"P. C\u00e9gielski","year":"2001","unstructured":"C\u00e9gielski, P., Richard, D.: Decidability of the theory of the natural integers with the cantor pairing function and the successor. Theor. Comput. Sci.\u00a0257(1-2), 51\u201377 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"17_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S012905410300156X","volume":"14","author":"A.L. Rosenberg","year":"2003","unstructured":"Rosenberg, A.L.: Efficient pairing functions - and why you should care. International Journal of Foundations of Computer Science\u00a014(1), 3\u201317 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"4","key":"17_CR24","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1305\/ndjfl\/1193667707","volume":"48","author":"R. Kaye","year":"2007","unstructured":"Kaye, R., Wong, T.L.: On Interpretations of Arithmetic and Set Theory. Notre Dame J. Formal Logic Volume\u00a048(4), 497\u2013510 (2007)","journal-title":"Notre Dame J. Formal Logic Volume"},{"issue":"1","key":"17_CR25","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1002\/malq.200610026","volume":"53","author":"L. Kirby","year":"2007","unstructured":"Kirby, L.: Addition and multiplication of sets. Math. Log. Q.\u00a053(1), 52\u201365 (2007)","journal-title":"Math. Log. Q."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02614-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T16:30:58Z","timestamp":1739205058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02614-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026133","9783642026140"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02614-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}