{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:03:48Z","timestamp":1725563028646},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148071"},{"type":"electronic","value":"9783642148088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14808-8_25","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T05:52:01Z","timestamp":1282369921000},"page":"367-381","source":"Crossref","is-referenced-by-count":1,"title":["On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"25_CR1","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\u00a048(4), 497\u2013510 (2007)","journal-title":"Notre Dame J. Formal Logic"},{"doi-asserted-by":"crossref","unstructured":"Wadler, P., Blott, S.: How to make ad-hoc polymorphism less ad-hoc. In: POPL, pp. 60\u201376 (1989)","key":"25_CR2","DOI":"10.1145\/75277.75283"},{"unstructured":"Jones, S.P., Jones, M., Meijer, E.: Type classes: An exploration of the design space. In: Haskell Workshop (1997)","key":"25_CR3"},{"doi-asserted-by":"crossref","unstructured":"Ackermann, W.F.: Die Widerspruchsfreiheit der allgemeinen Mengenlhere. Mathematische Annalen\u00a0(114), 305\u2013315 (1937)","key":"25_CR4","DOI":"10.1007\/BF01594179"},{"key":"25_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-02614-0_17","volume-title":"Intelligent Computer Mathematics","author":"P. Tarau","year":"2009","unstructured":"Tarau, P.: A Groupoid of Isomorphic Data Transformations. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) Calculemus 2009. LNCS (LNAI), vol.\u00a05625, pp. 170\u2013185. Springer, Heidelberg (2009)"},{"key":"25_CR6","first-page":"171","volume-title":"Proceedings of 11th International ACM SIGPLAN Symposium PPDP 2009","author":"P. Tarau","year":"2009","unstructured":"Tarau, P.: An Embedded Declarative Data Transformation Language. In: Proceedings of 11th International ACM SIGPLAN Symposium PPDP 2009, Coimbra, Portugal, September 2009, pp. 171\u2013182. ACM, New York (2009)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1145\/197320.197356","volume":"16","author":"J. Misra","year":"1994","unstructured":"Misra, J.: Powerlist: a structure for parallel recursion. ACM Transactions on Programming Languages and Systems\u00a016, 1737\u20131767 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"25_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"1993","unstructured":"Li, M., Vit\u00e1nyi, P.: An introduction to Kolmogorov complexity and its applications. Springer, New York (1993)"},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G.J. Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A theory of program size formally identical to information theory. J. Assoc. Comput. Mach.\u00a022, 329\u2013340 (1975)","journal-title":"J. Assoc. Comput. Mach."},{"key":"25_CR10","first-page":"472","volume-title":"Developments in Language Theory","author":"C. Calude","year":"1994","unstructured":"Calude, C., Salomaa, A.: Algorithmically coding the universe. In: Developments in Language Theory, pp. 472\u2013492. World Scientific, Singapore (1994)"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1215\/00294527-2009-003","volume":"50","author":"R. Pettigrew","year":"2009","unstructured":"Pettigrew, R.: On Interpretations of Bounded Arithmetic and Bounded Set Theory. Notre Dame J. Formal Logic\u00a050(2), 141\u2013151 (2009)","journal-title":"Notre Dame J. Formal Logic"},{"issue":"280-287","key":"25_CR12","first-page":"12","volume":"12","author":"K G\u00f6del","year":"1958","unstructured":"G\u00f6del, K.: \u00dcber eine bisher noch nicht ben\u00fctzte Erweiterung des finiten Standpunktes. Dialectica\u00a012(280-287), 12 (1958)","journal-title":"Dialectica"},{"unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences (2010), published electronically at http:\/\/www.research.att.com\/~njas\/sequences","key":"25_CR13"},{"unstructured":"Lagarias, J.C.: The 3x+1 Problem: An Annotated Bibliography (1963-1999) (2008), http:\/\/arXiv.org 0309224v11","key":"25_CR14"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"1898","DOI":"10.1145\/1529282.1529706","volume-title":"Proceedings of ACM SAC 2009","author":"P. Tarau","year":"2009","unstructured":"Tarau, P.: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell. In: Proceedings of ACM SAC 2009, pp. 1898\u20131903. ACM, New York (2009)"},{"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","key":"25_CR16","DOI":"10.1145\/1529282.1529706"},{"issue":"3","key":"25_CR17","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."},{"issue":"1","key":"25_CR18","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."},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-78969-7_7","volume-title":"Functional and Logic Programming","author":"O. Kiselyov","year":"2008","unstructured":"Kiselyov, O., Byrd, W.E., Friedman, D.P., Shan, C.-c.: Pure, declarative, and constructive arithmetic relations (declarative pearl). In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 64\u201380. Springer, Heidelberg (2008)"},{"issue":"2\/3","key":"25_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T. Coquand","year":"1988","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Information and Computation\u00a076(2\/3), 95\u2013120 (1988)","journal-title":"Information and Computation"},{"unstructured":"The Coq development team: The Coq proof assistant reference manual. LogiCal Project. Version 8.0 (2004)","key":"25_CR21"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14808-8_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:57:47Z","timestamp":1606168667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14808-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642148071","9783642148088"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14808-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}