Feat: Functional enumeration of algebraic types

Haskell'12 - Proceedings of the 2012 ACM SIGPLAN Haskell Symposium 2012

Volumn , Issue , 2012, Pages 61-72

  Duregård, Jonas ^a   Jansson, Patrik ^a   Wang, Meng ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

enumeration; memoisation; property based testing

Indexed keywords

BIJECTIONS; BIJECTIVE FUNCTIONS; ENUMERATION; EXHAUSTIVE ENUMERATION; FINITE SUBSETS; HASKELL; LARGE GROUPS; MEMOISATION; NATURAL NUMBER; PROPERTY-BASED TESTING; RANDOM ACCESS; RANDOM SAMPLING; RECURSIONS; SOURCE CODES; SYNTAX TREE; TEST CASE;

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; TREES (MATHEMATICS);

AUTOMATIC TEST PATTERN GENERATION;

EID: 84867505779     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2364506.2364515     Document Type: Conference Paper

References (14)

1. J. Christiansen and S. Fischer. Easycheck: test data for free. In FLOPS'08, pages 322-336. Springer, 2008.
2. K. Claessen and J. Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. In ICFP '00, pages 268-279. ACM, 2000.
3. P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer. Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability and Computing, 13(4-5):577-625, 2004. doi: 10.1017/ S0963548304006315.
4. J. Dureg̊ard. Agata: Random generation of test data. Master's thesis, Chalmers University of Technology, 2009.
5. J. Dureg̊ard and P. Jansson. Embedded parser generators. In Haskell '11, pages 107-117. ACM, 2011.
6. P. Flajolet and B. Salvy. Computer algebra libraries for combinatorial structures. J. Symb. Comput., 20(5/6):653-671, 1995.
7. M. Hanus et al. Curry: An Integrated Functional Logic Language, version 0.8.2 edition, 2006. Available from http://www.informatik.uni-kiel.de/~curry/ report.html.
8. M. H. Pałka, K. Claessen, A. Russo, and J. Hughes. Testing an optimising compiler by generating random lambda terms. In AST '11, pages 91-97. ACM, 2011.
9. S. Peyton Jones, S. Marlow, and C. Elliot. Stretching the storage manager: weak pointers and stable names in Haskell. In IFL'99, LNCS. Springer, 1999.
10. C. Runciman, M. Naylor, and F. Lindblad. Smallcheck and lazy smallcheck: automatic exhaustive testing for small values. In Haskell '08, pages 37-48. ACM, 2008.
11. G. J. Uszkay and J. Carette. Available from http://hackage.haskell.org/ package/gencheck, 2012.
12. J. Wang. Generating random lambda calculus terms. Technical report, Boston University, 2005.
13. A. R. Yakushev and J. Jeuring. Enumerating well-typed terms generically. In AAIP 2009, volume 5812 of LNCS, pages 93-116. Springer, 2009.
14. B. A. Yorgey. Species and functors and types, oh my! In Haskell '10, pages 147-158. ACM, 2010.