{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T04:47:09Z","timestamp":1768020429210,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662466681","type":"print"},{"value":"9783662466698","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46669-8_16","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T18:37:37Z","timestamp":1427913457000},"page":"383-405","source":"Crossref","is-referenced-by-count":29,"title":["Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System"],"prefix":"10.1007","author":[{"given":"Burke","family":"Fetscher","sequence":"first","affiliation":[]},{"given":"Koen","family":"Claessen","sequence":"additional","affiliation":[]},{"given":"Micha\u0142","family":"Pa\u0142ka","sequence":"additional","affiliation":[]},{"given":"John","family":"Hughes","sequence":"additional","affiliation":[]},{"given":"Robert Bruce","family":"Findler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Claire, E., Alvis, J.J., Willcock, K.M., Carter, W.E.: Byrd, and Daniel P. Friedman. cKanren: miniKanren with Constraints. In: Proc. Scheme and Functional Programming (2011)"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10817-011-9226-1","volume":"49","author":"A.W. Appel","year":"2012","unstructured":"Appel, A.W., Dockins, R., Leroy, X.: A list-machine benchmark for mechanized metatheory. Journal of Automated Reasoning\u00a049(3), 453\u2013491 (2012)","journal-title":"Journal of Automated Reasoning"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification Theory. In: Handbook of Automated Reasoning, vol. 1, pp. 445\u2013532 (2001)","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"issue":"9","key":"16_CR4","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/S0950-5849(97)00017-7","volume":"39","author":"A.S. Bourjarwah","year":"1997","unstructured":"Bourjarwah, A.S., Saleh, K.: Compiler test case generation methods: a survey and assessment. Information & Software Technology\u00a039(9), 617\u2013625 (1997)","journal-title":"Information & Software Technology"},{"key":"16_CR5","unstructured":"Byrd, W.E.: Relational Programming in miniKanren: Techniques, Applications, and Implementations. PhD dissertation, Indiana University (2009)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Claessen, K., Duregard, J., Palka, M.H.: Generating Constrained Random Data with Uniform Distribution. In: Proc. Intl. Symp. Functional and Logic Programming, pp. 18\u201334 (2014)","DOI":"10.1007\/978-3-319-07151-0_2"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Claessen, K., Hughes, J.: QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs. In: Proc. ACM Intl. Conf. Functional Programming, pp. 268\u2013279 (2000)","DOI":"10.1145\/357766.351266"},{"key":"16_CR8","unstructured":"Colmerauer, A.: Equations and Inequations on Finite and Infinite Trees. In: Proc. Intl. Conf. Fifth Generation Computing Systems, pp. 85\u201399 (1984)"},{"key":"16_CR9","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Loding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","volume":"7","author":"H. Comon","year":"1989","unstructured":"Comon, H., Lescanne, P.: Equational Problems and Disunification. Journal of Symbolic Computation\u00a07, 371\u2013425 (1989)","journal-title":"Journal of Symbolic Computation"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Duregard, J., Jansson, P., Wang, M.: Feat: Functional Enumeration of Algebraic Types. In: Proc. ACM SIGPLAN Haskell Wksp, pp. 61\u201372 (2012)","DOI":"10.1145\/2430532.2364515"},{"key":"16_CR12","unstructured":"Felleisen, M., Findler, R.B., Flatt, M.: Semantics Engineering with PLT Redex. MIT Press (2010)"},{"key":"16_CR13","unstructured":"Fetscher, B.: The Random Generation of Well-Typed Terms. Northwestern University, NU-EECS-14-05 (2014)"},{"key":"16_CR14","unstructured":"Findler, R.B., Klein, C., Fetscher, B.: The Redex Reference (2014), http:\/\/docs.racket-lang.org\/redex"},{"issue":"5","key":"16_CR15","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. Functional Programming\u00a023(5), 594\u2013628 (2013)","journal-title":"J. Functional Programming"},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1147\/sj.94.0242","volume":"9","author":"K.V. Hanford","year":"1970","unstructured":"Hanford, K.V.: Automatic Generation of Test Cases. IBM Systems Journal\u00a09(4), 244\u2013257 (1970)","journal-title":"IBM Systems Journal"},{"issue":"1-3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J. Jaffar","year":"1998","unstructured":"Jaffar, J., Maher, M.J., Marriott, K., Stuckey, P.J.: The Semantics of Constraint Logic Programming. Journal of Logic Programming\u00a037(1-3), 1\u201346 (1998)","journal-title":"Journal of Logic Programming"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1017\/S0956796812000263","volume":"22","author":"A.J. Kennedy","year":"2012","unstructured":"Kennedy, A.J., Vytiniotis, D.: Every bit counts: The binary representation of typed data and programs. J. Functional Programming\u00a022, 529\u2013573 (2012)","journal-title":"J. Functional Programming"},{"key":"16_CR19","unstructured":"Klein, C.: Experience with Randomized Testing in Programming Language Metatheory. MS dissertation, Northwestern University (2009)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Klein, C., Clements, J., Dimoulas, C., Eastlund, C., Felleisen, M., Flatt, M., McCarthy, J.A., Rafkind, J., Tobin-Hochstadt, S., Findler, R.B.: Run Your Research: On the Effectiveness of Lightweight Mechanization. In: Proc. ACM Symp. Principles of Programming Languages (2012)","DOI":"10.1145\/2103656.2103691"},{"key":"16_CR21","unstructured":"Klein, C., Findler, R.B.: Randomized Testing in PLT Redex. In: Proc. Scheme and Functional Programming, pp. 26\u201336 (2009)"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Klein, C., Findler, R.B., Flatt, M.: The Racket virtual machine and randomized testing. In: Higher-Order and Symbolic Computation (2013)","DOI":"10.1007\/s10990-013-9091-1"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Kutsia, T.: Unification with Sequence Symbols and Flexible Arity Symbols and Its Extension with Pattern-Terms. In: Proc. Intl. Conf. Artificial Intelligence, Automated Reasoning, and Symbolic Computation, pp. 290\u2013304 (2002)","DOI":"10.1007\/3-540-45470-5_26"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Pa\u0142ka, M.H.: Testing an Optimising Compiler by Generating Random Lambda Terms. Licentiate dissertation, Chalmers University of Technology, G\u00f6teborg (2012)","DOI":"10.1145\/1982595.1982615"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Pa\u0142ka, M.H., Claessen, K., Russo, A., Hughes, J.: Testing an Optimising Compiler by Generating Random Lambda Terms. In: Proc. International Workshop on Automation of Software Test (2011)","DOI":"10.1145\/1982595.1982615"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Takikawa, A., Strickland, T.S., Tobin-Hochstadt, S.: Constraining Delimited Control with Contracts. In: Proc. Euro. Symp. Programming, pp. 229\u2013248 (2013)","DOI":"10.1007\/978-3-642-37036-6_14"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Yang, X., Chen, Y., Eide, E., Regehr, J.: Finding and Understanding Bugs in C Compilers. In: Proc. ACM Conf. Programming Language Design and Implementation, pp. 283\u2013294 (2011)","DOI":"10.1145\/1993316.1993532"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46669-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T02:59:59Z","timestamp":1651633199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46669-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466681","9783662466698"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46669-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}