Fair enumeration combinators

DOI10.1017/S0956796817000107MaRDI QIDQ4625156zbMATH OpenOpenAlexFDO

Authors Max New, Burke Fetscher, Robert Bruce Findler, Jay McCarthy

Publication date 20 February 2019

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796817000107

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatorics in computer science (68R05)

Recommendations

• Tests and Proofs for Enumerative Combinatorics
• Do judge a test by its cover. Combining combinatorial and property-based testing
• Tests and proofs for custom data generators
• Beginner's luck: a language for property-based generators
• FUNCTIONAL PEARL: Enumerating the rationals

Cites work

• A list-machine benchmark for mechanized metatheory
• Compact serialization of Prolog terms (with Catalan skeletons, Cantor tupling and Gödel numberings)
• Constraining Delimited Control with Contracts
• Semantics engineering with PLT Redex

Describes a project that uses

Uses Software

• PLT Redex

This page was built for publication: Fair enumeration combinators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625156)