{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:50:59Z","timestamp":1725846659950},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319282275"},{"type":"electronic","value":"9783319282282"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-28228-2_8","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T11:54:42Z","timestamp":1452254082000},"page":"117-134","source":"Crossref","is-referenced-by-count":0,"title":["Computing with Catalan Families, Generically"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.2307\/2268019","volume":"9","author":"R Goodstein","year":"1944","unstructured":"Goodstein, R.: On the restricted ordinal theorem. J. Symbolic Logic 9, 33\u201341 (1944)","journal-title":"J. Symbolic Logic"},{"issue":"4","key":"8_CR2","first-page":"163","volume":"39","author":"D Haraburda","year":"2013","unstructured":"Haraburda, D., Tarau, P.: Binary trees as a computational framework. Comput. Lang. Syst. Struct. 39(4), 163\u2013181 (2013)","journal-title":"Comput. Lang. Syst. Struct."},{"issue":"4271","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1126\/science.194.4271.1235","volume":"194","author":"DE Knuth","year":"1976","unstructured":"Knuth, D.E.: Mathematics and computer science: coping with finiteness. Science 194(4271), 1235\u20131242 (1976)","journal-title":"Science"},{"key":"8_CR4","unstructured":"Knuth, D.E.: TCALC (1994). \n                      http:\/\/math.mit.edu\/~rstan\/ec\/catadd.pdf"},{"key":"8_CR5","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees-History of Combinatorial Generation (Art of Computer Programming). Addison-Wesley Professional (2006)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Kreher, D.L., Stinson, D.: Combinatorial Algorithms: Generation, Enumeration, and Search. The CRC Press Series on Discrete Mathematics and its Applications, CRC PressINC (1999)","DOI":"10.1145\/309739.309744"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative Combinatorics","author":"Richard P. Stanley","year":"1986","unstructured":"Stanley, R.P.: Enumerative Combinatorics. Wadsworth Publ. Co., Belmont (1986).\n                      http:\/\/www-cs-faculty.stanford.edu\/~uno\/programs\/tcalc.w.gz"},{"key":"8_CR8","unstructured":"Stanley, R.P.: Catalan Addendum (2013). \n                      http:\/\/www-math.mit.edu\/rstan\/ec\/catadd.pdf"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","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.) MKM 2009, Held as Part of CICM 2009. LNCS, vol. 5625, pp. 170\u2013185. Springer, Heidelberg (2009)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Tarau, P.: Bijective collection encodings and boolean operations with hereditarily binary natural numbers. In: Proceedings of the 16th international ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP 2014. ACM, New York (2014)","DOI":"10.1145\/2643135.2643139"},{"key":"8_CR11","unstructured":"Tarau, P.: A Generic Numbering System based on Catalan Families of Combinatorial Objects (2014). \n                      CoRR abs\/1406.1796"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-04921-2_46","volume-title":"Language and Automata Theory and Applications","author":"P Tarau","year":"2014","unstructured":"Tarau, P.: Computing with Catalan families. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 565\u2013575. Springer, Heidelberg (2014)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/978-3-319-10882-7_24","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2014","author":"P Tarau","year":"2014","unstructured":"Tarau, P.: The arithmetic of recursively run-length compressed natural numbers. In: Ciobanu, G., M\u00e9ry, D. (eds.) ICTAC 2014. LNCS, vol. 8687, pp. 406\u2013423. Springer, Heidelberg (2014)"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-319-28228-2_7","volume-title":"Practical Aspects of Declarative Languages","author":"Paul Tarau","year":"2016","unstructured":"Tarau, P.: A Size-proportionate Bijective Encoding of Lambda Terms as Catalan Objects endowed with Arithmetic Operations. In: Gavanelli, M., Reppy, J. (eds.) PADL 2016. LNCS, vol. 9585, pp. 99\u2013116. Springer, Cham (2016)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Tarau, P., Buckles, B.: Arithmetic algorithms for hereditarily binary natural numbers. In: Proceedings of SAC 2014, ACM Symposium on Applied Computing, PL track. ACM, Gyeongju, March 2014","DOI":"10.1109\/SYNASC.2014.23"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Wadler, P., Blott, S.: How to make ad-hoc polymorphism less ad-hoc. In: POPL, pp. 60\u201376 (1989)","DOI":"10.1145\/75277.75283"}],"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-319-28228-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:06:51Z","timestamp":1559380011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28228-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319282275","9783319282282"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28228-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}