{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T02:10:23Z","timestamp":1742436623557,"version":"3.40.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642276934"},{"type":"electronic","value":"9783642276941"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27694-1_20","type":"book-chapter","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T22:38:40Z","timestamp":1328654320000},"page":"273-288","source":"Crossref","is-referenced-by-count":1,"title":["A Declarative Specification of Tree-Based Symbolic Arithmetic Computations"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Tarau, P.: An Embedded Declarative Data Transformation Language. In: Proceedings of 11th International ACM SIGPLAN Symposium PPDP 2009, Coimbra, Portugal, pp. 171\u2013182. ACM (September 2009)","DOI":"10.1145\/1599410.1599432"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Tarau, P.: Everything Is Everything Revisited: Shapeshifting Data Types with Isomorphisms and Hylomorphisms. Complex Systems\u00a0(18) (2010)","DOI":"10.25088\/ComplexSystems.18.4.475"},{"issue":"4","key":"20_CR3","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":"20_CR4","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1111\/j.1746-8361.1958.tb01464.x","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\u2013287 (1958)","journal-title":"Dialectica"},{"issue":"9","key":"20_CR6","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s00236-002-0085-4","volume":"38","author":"J. Berstel","year":"2002","unstructured":"Berstel, J., Boasson, L.: Formal properties of XML grammars and languages. Acta Informatica\u00a038(9), 649\u2013671 (2002)","journal-title":"Acta Informatica"},{"key":"20_CR7","first-page":"19","volume":"43","author":"J. Liebehenschel","year":"2000","unstructured":"Liebehenschel, J.: Ranking and unranking of a generalized Dyck language and the application to the generation of random trees. S\u00e9minaire Lotharingien de Combinatoire\u00a043, 19 (2000)","journal-title":"S\u00e9minaire Lotharingien de Combinatoire"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/11779148_11","volume-title":"Developments in Language Theory","author":"A. Bertoni","year":"2006","unstructured":"Bertoni, A., Choffrut, C., Palano, B.: Context-Free Grammars and XML Languages. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 108\u2013119. Springer, Heidelberg (2006)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-45711-9_1","volume-title":"Formal and Natural Computing","author":"J. Berstel","year":"2002","unstructured":"Berstel, J., Boasson, L.: Balanced Grammars and Their Languages. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 3\u201325. Springer, Heidelberg (2002)"},{"key":"20_CR10","unstructured":"Kraft, L.: A device for quantizing, grouping, and coding amplitude-modulated pulses. Master\u2019s thesis, Massachusetts Institute of Technology. Dept. of Electrical Engineering (1949)"},{"key":"20_CR11","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":"20_CR12","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":"20_CR13","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. Mart\u00ednez","year":"2003","unstructured":"Mart\u00ednez, 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":"20_CR14","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams, vol.\u00a04. Addison-Wesley Professional (2009)"},{"issue":"3","key":"20_CR15","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":"4","key":"20_CR16","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"},{"issue":"1","key":"20_CR17","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":"20_CR18","series-title":"Lecture Notes in Artificial Intelligence","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\/MKM 2009. LNCS (LNAI), vol.\u00a05625, pp. 170\u2013185. Springer, Heidelberg (2009)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Tarau, P.: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell. In: Proceedings of ACM SAC 2009, Honolulu, Hawaii, pp. 1898\u20131903. ACM (March 2009)","DOI":"10.1145\/1529282.1529706"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Tarau, P.: Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell, pages 150 (January 2009), unpublished draft, http:\/\/arXiv.org\/abs\/0808.2953 , updated version at http:\/\/logic.cse.unt.edu\/tarau\/research\/2010\/ISO.pdf","DOI":"10.1145\/1529282.1529706"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-56610-4_68","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"N. Dershowitz","year":"1993","unstructured":"Dershowitz, N.: Trees, Ordinals and Termination. In: Gaudel, M., Jouannaud, J. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 243\u2013250. Springer, Heidelberg (1993)"},{"key":"20_CR22","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., Shan, C.-c.: Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl). In: Garrigue, J., Hermenegildo, M. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 64\u201380. Springer, Heidelberg (2008)"},{"key":"20_CR23","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":"20_CR24","unstructured":"Kiselyov, O.: Type arithmetics: Computation based on the theory of types. CoRR cs.CL\/0104010 (2001)"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Wen, J., Villasenor, J.: Reversible variable length codes for efficient and robust image and video coding. In: Proceedings Data Compression Conference, pp. 471\u2013480 (1998)","DOI":"10.1109\/DCC.1998.672209"},{"key":"20_CR26","doi-asserted-by":"publisher","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-Verlag New York, Inc., New York (1993)"},{"issue":"2","key":"20_CR27","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P. Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory\u00a021(2), 194\u2013203 (1975)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27694-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T01:39:20Z","timestamp":1742434760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27694-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276934","9783642276941"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27694-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}