{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:37:41Z","timestamp":1775029061971,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319516752","type":"print"},{"value":"9783319516769","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T00:00:00Z","timestamp":1481932800000},"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-51676-9_8","type":"book-chapter","created":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T07:14:29Z","timestamp":1481958869000},"page":"120-135","source":"Crossref","is-referenced-by-count":6,"title":["Boltzmann Samplers for Closed Simply-Typed Lambda Terms"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Bendkowski","sequence":"first","affiliation":[]},{"given":"Katarzyna","family":"Grygiel","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Tarau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,17]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809835","volume-title":"Lambda-Calculus and Combinators: An Introduction","author":"JR Hindley","year":"2008","unstructured":"Hindley, J.R., Seldin, J.P.: Lambda-Calculus and Combinators: An Introduction, vol. 13. Cambridge University Press, Cambridge (2008)"},{"key":"8_CR2","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"},{"issue":"5","key":"8_CR3","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":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bodini, O., Gardy, D., Gittenberger, B.: Lambda terms of bounded unary height. In: 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 23\u201332 (2011)","DOI":"10.1137\/1.9781611973013.3"},{"issue":"1:02","key":"8_CR5","first-page":"1","volume":"9","author":"R David","year":"2013","unstructured":"David, R., Grygiel, K., Kozik, J., Raffalli, C., Theyssier, G., Zaionc, M.: Asymptotically almost all $$\\lambda $$ -terms are strongly normalizing. Logical Meth. Comput. Sci. 9(1:02), 1\u201330 (2013)","journal-title":"Logical Meth. Comput. Sci."},{"key":"8_CR6","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":"8_CR7","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences (2014). https:\/\/oeis.org\/"},{"key":"8_CR8","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":"8_CR9","doi-asserted-by":"crossref","first-page":"e24","DOI":"10.1017\/S0956796815000271","volume":"25","author":"K Grygiel","year":"2015","unstructured":"Grygiel, K., Lescanne, P.: Counting and generating terms in the binary lambda calculus. J. Funct. Program. 25, e24 (2015)","journal-title":"J. Funct. Program."},{"key":"8_CR10","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":"8_CR11","doi-asserted-by":"crossref","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 Math. 34, 381\u2013392 (1972)","journal-title":"Indagationes Math."},{"issue":"4\u20135","key":"8_CR12","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1017\/S0963548304006315","volume":"13","author":"P Duchon","year":"2004","unstructured":"Duchon, P., Flajolet, P., Louchard, G., Schaeffer, G.: Boltzmann samplers for the random generation of combinatorial structures. Comb. Probab. Comput. 13(4\u20135), 577\u2013625 (2004)","journal-title":"Comb. Probab. Comput."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Claessen, K., Hughes, J.: QuickCheck: a lightweight tool for random testing of Haskell programs. In: Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming, ICFP 2000, pp. 268\u2013279. ACM, New York (2000)","DOI":"10.1145\/351240.351266"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44854-3_6","volume-title":"Implementation of Functional Languages","author":"P Koopman","year":"2003","unstructured":"Koopman, P., Alimarine, A., Tretmans, J., Plasmeijer, R.: Gast: generic automated software testing. In: Pe\u00f1a, R., Arts, T. (eds.) IFL 2002. LNCS, vol. 2670, pp. 84\u2013100. Springer, Berlin (2003). doi: 10.1007\/3-540-44854-3_6"},{"key":"8_CR15","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"},{"key":"8_CR16","unstructured":"Koopman, P., Plasmeijer, R.: Systematic synthesis of functions, pp. 68\u201383. The University of Nottingham (2006)"},{"key":"8_CR17","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 (2015). http:\/\/ceur-ws.org\/Vol-1433\/"}],"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-51676-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T07:23:38Z","timestamp":1718954618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51676-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,17]]},"ISBN":["9783319516752","9783319516769"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51676-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,17]]}}}