{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:50:57Z","timestamp":1725846657489},"publisher-location":"Cham","reference-count":26,"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_7","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T06:54:42Z","timestamp":1452236082000},"page":"99-116","source":"Crossref","is-referenced-by-count":1,"title":["A Size-Proportionate Bijective Encoding of Lambda Terms as Catalan Objects Endowed with Arithmetic Operations"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01594179","volume":"114","author":"WF Ackermann","year":"1937","unstructured":"Ackermann, W.F.: Die Widerspruchsfreiheit der allgemeinen Mengenlhere. Mathematische Annalen 114, 305\u2013315 (1937)","journal-title":"Mathematische Annalen"},{"key":"7_CR2","volume-title":"The Lambda Calculus Its Syntax and Semantics","author":"HP Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus Its Syntax and Semantics, vol. 103, 2, revised edn. Elsevier, North Holland (1984)","edition":"2, revised"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bodini, O., Gardy, D., Gittenberger, B.: Lambda-terms of bounded unary height. In: ANALCO, pp. 23\u201332. SIAM (2011)","DOI":"10.1137\/1.9781611973013.3"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"NG Bruijn de","year":"1972","unstructured":"de Bruijn, N.G.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae 34, 381\u2013392 (1972)","journal-title":"Indagationes Mathematicae"},{"issue":"1\u20132","key":"7_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(97)00281-8","volume":"222","author":"P Cegielski","year":"1999","unstructured":"Cegielski, P., Richard, D.: On arithmetical first-order theories allowing encoding and decoding of lists. Theor. Comput. Sci. 222(1\u20132), 55\u201375 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR6","unstructured":"David, R., Grygiel, K., Kozik, J., Raffalli, C., Theyssier, G., Zaionc, M.: Asymptotically almost all \n                      \n                        \n                      \n                      $$\\lambda $$\n                    -terms are strongly normalizing (2010). Preprint: \n                      arXiv:math.LO\/0903.5505v3"},{"key":"7_CR7","unstructured":"David, R., Raffalli, C., Theyssier, G., Grygiel, K., Kozik, J., Zaionc, M.: Some properties of random lambda terms. Logical Methods Comput. Sci., 9(1) (2009)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-662-46669-8_16","volume-title":"Programming Languages and Systems","author":"B Fetscher","year":"2015","unstructured":"Fetscher, B., Claessen, K., Pa\u0142ka, M., Hughes, J., Findler, R.B.: Making random judgments: automatically generating well-typed terms from the definition of a type-system. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 383\u2013405. Springer, Heidelberg (2015)"},{"key":"7_CR9","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 38, 173\u2013198 (1931)","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1093\/logcom\/exs017","volume":"23","author":"K Grygiel","year":"2013","unstructured":"Grygiel, K., Idziak, P.M., Zaionc, M.: How big is BCI fragment of BCK logic. J. Log. Comput. 23(3), 673\u2013691 (2013)","journal-title":"J. Log. Comput."},{"issue":"5","key":"7_CR11","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1017\/S0956796813000178","volume":"23","author":"K Grygiel","year":"2013","unstructured":"Grygiel, K., Lescanne, P.: Counting and generating lambda terms. J. Funct. Program. 23(5), 594\u2013628 (2013)","journal-title":"J. Funct. Program."},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-06841-4_69","volume-title":"ICALP","author":"J Hartmanis","year":"1974","unstructured":"Hartmanis, J., Baker, T.P.: On simple Goedel numberings and translations. In: Loeckx, J. (ed.) ICALP. Lecture Notes in Computer Science, vol. 14, pp. 301\u2013316. Springer, Berlin Heidelberg (1974)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1093\/logcom\/11.3.363","volume":"11","author":"F Kamareddine","year":"2001","unstructured":"Kamareddine, F.: Reviewing the classical and the de Bruijn notation for calculus and pure type systems. J. Logic Comput. 11(3), 363\u2013394 (2001)","journal-title":"J. Logic Comput."},{"key":"7_CR14","volume-title":"The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees-History of Combinatorial Generation (Art of Computer Programming)","author":"DE Knuth","year":"2006","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, Boston (2006)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Matsuda, K., Shinohara, A.: Functional programs as compressed data. In: ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, ACM Press, January 2012","DOI":"10.1145\/2103746.2103770"},{"issue":"1","key":"7_CR16","first-page":"55","volume":"62","author":"M Lisi","year":"2007","unstructured":"Lisi, M.: Some remarks on the Cantor pairing function. Le Matematiche 62(1), 55\u201365 (2007). \n                      http:\/\/www.dmi.unict.it\/ojs\/index.php\/lematematiche\/article\/view\/14","journal-title":"Le Matematiche"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Palka, M.H., Claessen, K., Russo, A., Hughes, J.: Testing an optimising compiler by generating random lambda terms. In: Proceedings of the 6th International Workshop on Automation of Software Test, AST 2011, pp. 91\u201397. ACM, New York, NY, USA (2011)","DOI":"10.1145\/1982595.1982615"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Pfenning, F., Elliot, C.: Higher-order abstract syntax. In: Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation, PLDI 1988, pp. 199\u2013208. ACM, New York, NY, USA (1988)","DOI":"10.1145\/960116.54010"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-36377-7_19","volume-title":"The Essence of Computation","author":"P Sestoft","year":"2002","unstructured":"Sestoft, P.: Demonstrating lambda calculus reduction. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol. 2566, pp. 420\u2013435. Springer, Heidelberg (2002)"},{"key":"7_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative Combinatorics","author":"RP Stanley","year":"1986","unstructured":"Stanley, R.P.: Enumerative Combinatorics. Wadsworth Publishing Co., Belmont (1986)"},{"issue":"4\u20135","key":"7_CR21","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1017\/S1471068413000537","volume":"13","author":"P Tarau","year":"2013","unstructured":"Tarau, P.: Compact serialization of prolog terms (with catalan skeletons, cantor tupling and g\u00f6del numberings). Theor. Pract. Logic Program. 13(4\u20135), 847\u2013861 (2013)","journal-title":"Theor. Pract. Logic Program."},{"key":"7_CR22","unstructured":"Tarau, P.: A generic numbering system based on catalan families of combinatorial objects. CoRR \n                      abs\/1406.1796\n                      \n                     (2014)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Tarau, P.: On a uniform representation of combinators, arithmetic, Lambda terms and types. In: Albert, E. (ed.) PPDP 2015: Proceedings of the 17th international ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 244\u2013255. ACM, New York, NY, USA, July 2015","DOI":"10.1145\/2790449.2790526"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-20615-8_8","volume-title":"Intelligent Computer Mathematics","author":"P Tarau","year":"2015","unstructured":"Tarau, P.: Ranking\/unranking of Lambda terms with compressed de Bruijn Indices. In: Kerber, M., Carette, J., Kaliszyk, C., Rabe, F., Sorge, V. (eds.) CICM 2015. LNCS, vol. 9150, pp. 118\u2013133. Springer, Heidelberg (2015)"},{"key":"7_CR25","series-title":"LNCS","volume-title":"Proceedings of the Eighteenth International Symposium on Practical Aspects of Declarative Languages PADL\u201916","author":"P Tarau","year":"2016","unstructured":"Tarau, P.: Computing with catalan families, generically. In: Gavanelli, M., Reppy, J. (eds.) PADL\u201916. LNCS. Springer, St. Petersburg, Florida, USA (2016)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Vytiniotis, D., Kennedy, A.: Functional pearl: every bit counts. ICFP 2010 : The 15th ACM SIGPLAN International Conference on Functional Programming, ACM Press, September 2010","DOI":"10.1145\/1863543.1863548"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:04:59Z","timestamp":1559365499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28228-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319282275","9783319282282"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28228-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}