{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:16:38Z","timestamp":1725905798016},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319631387"},{"type":"electronic","value":"9783319631394"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-63139-4_14","type":"book-chapter","created":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T03:22:55Z","timestamp":1500866575000},"page":"240-255","source":"Crossref","is-referenced-by-count":4,"title":["A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"14_CR1","unstructured":"Barendregt, H.P.: The Lambda Calculus its Syntax and Semantics. Revised edn. vol. 103. North Holland (1984)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Hindley, J.R., Seldin, J.P.: Lambda-Calculus and Combinators: An Introduction. vol. 13. Cambridge University Press, Cambridge (2008)","DOI":"10.1017\/CBO9780511809835"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Barendregt, H.P.: Lambda calculi with types. In: Handbook of Logic in Computer Science, vol. 2. Oxford University Press (1991)","DOI":"10.1093\/oso\/9780198537618.003.0002"},{"key":"14_CR4","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 (2011)","DOI":"10.1145\/1982595.1982615"},{"issue":"5","key":"14_CR5","doi-asserted-by":"crossref","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":"14_CR6","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":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bodini, O., Gardy, D., Gittenberger, B.: Lambda-terms of bounded unary height. In: ANALCO, SIAM, pp. 23\u201332 (2011)","DOI":"10.1137\/1.9781611973013.3"},{"key":"14_CR8","unstructured":"David, R., Grygiel, K., Kozik, J., Raffalli, C., Theyssier, G., Zaionc, M.: Asymptotically almost all $$\\lambda $$ -terms are strongly normalizing. Preprint: arXiv: math . LO\/0903.5505 v3 (2010)"},{"key":"14_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics, 1st edn. Cambridge University Press, New York (2009)","edition":"1"},{"key":"14_CR10","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. (2014) Published electronically at https:\/\/oeis.org\/"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-19686-2_9","volume-title":"Practical Aspects of Declarative Languages","author":"P Tarau","year":"2015","unstructured":"Tarau, P.: On logic programming representations of lambda terms: de bruijn indices, compression, type inference, combinatorial generation, normalization. In: Pontelli, E., Son, T.C. (eds.) PADL 2015. LNCS, vol. 9131, pp. 115\u2013131. Springer, Cham (2015). doi: 10.1007\/978-3-319-19686-2_9"},{"key":"14_CR12","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, Cham (2015). doi: 10.1007\/978-3-319-20615-8_8"},{"key":"14_CR13","first-page":"244","volume-title":"PPDP\u201915: Proceedings of the 17th international ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming","author":"P Tarau","year":"2015","unstructured":"Tarau, P.: On a uniform representation of combinators, arithmetic, lambda terms and types. In: Albert, E. (ed.) PPDP\u201915: Proceedings of the 17th international ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 244\u2013255. ACM, New York (2015)"},{"key":"14_CR14","unstructured":"Tarau, P.: On type-directed generation of lambda terms. In: De Vos, M., Eiter, T., Lierler, Y., Toni, F. (eds.) 31st International Conference on Logic Programming (ICLP 2015), Technical Communications, Cork, Ireland, CEUR available online at September 2015 http:\/\/ceur-ws.org\/Vol-1433\/"},{"key":"14_CR15","unstructured":"Tarau, P.: A logic programming playground for lambda terms, combinators, types and tree-based arithmetic computations. CoRR abs\/1507.06944 (2015)"},{"key":"14_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative Combinatorics","author":"RP Stanley","year":"1986","unstructured":"Stanley, R.P.: Enumerative Combinatorics. Wadsworth Publ. Co., Belmont (1986)"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(79)90006-9","volume":"9","author":"R Statman","year":"1979","unstructured":"Statman, R.: Intuitionistic propositional logic is polynomial-space complete. Theor. Comput. Sci. 9, 67\u201372 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-Prolog. Theory Pract. Logic Program. 12, 67\u201396 (2012)","DOI":"10.1017\/S1471068411000494"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Costa, V.S., Rocha, R., Damas, L.: The YAP Prolog system. Theory and Practice of Logic Programming 12, 5\u201334 (2012)","DOI":"10.1017\/S1471068411000512"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Grygiel, K., Lescanne, P.: Counting and generating terms in the binary lambda calculus. J. Funct. Program. 25 (2015)","DOI":"10.1017\/S0956796815000271"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-662-49192-8_15","volume-title":"SOFSEM 2016: Theory and Practice of Computer Science","author":"M Bendkowski","year":"2016","unstructured":"Bendkowski, M., Grygiel, K., Lescanne, P., Zaionc, M.: A natural counting of lambda terms. In: Freivalds, R.M., Engels, G., Catania, B. (eds.) SOFSEM 2016. LNCS, vol. 9587, pp. 183\u2013194. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49192-8_15"},{"key":"14_CR22","unstructured":"Lescanne, P.: Boltzmann samplers for random generation of lambda terms. CoRR abs\/1404.3875 (2014)"},{"key":"14_CR23","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). doi: 10.1007\/978-3-662-46669-8_16"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-68103-8_7","volume-title":"Types for Proofs and Programs","author":"A Genitrini","year":"2008","unstructured":"Genitrini, A., Kozik, J., Zaionc, M.: Intuitionistic vs. classical tautologies, quantitative comparison. In: Miculan, M., Scagnetto, I., Honsell, F. (eds.) TYPES 2007. LNCS, vol. 4941, pp. 100\u2013109. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-68103-8_7"},{"issue":"6","key":"14_CR25","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1093\/logcom\/ext071","volume":"25","author":"F Fioravanti","year":"2015","unstructured":"Fioravanti, F., Proietti, M., Senni, V.: Efficient generation of test data structures using constraint logic programming and program transformation. J. Logic Comput. 25(6), 1263\u20131283 (2015)","journal-title":"J. Logic Comput."},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Kuraj, I., Kuncak, V., Jackson, D.: Programming with enumerable sets of structures. In: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015, pp. 37\u201356. ACM, New York (2015)","DOI":"10.1145\/2814270.2814323"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63139-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T18:44:28Z","timestamp":1719341068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63139-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319631387","9783319631394"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63139-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}