A Lean library called Palamedes uses synthesis rules from generator semantics and catamorphism-anamorphism rewriting to automatically produce correct constrained random generators.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Sparse counting-sets reduce replication overhead in c-regex matching by tracking only essential counter values.
citing papers explorer
-
The Search for Constrained Random Generators
A Lean library called Palamedes uses synthesis rules from generator semantics and catamorphism-anamorphism rewriting to automatically produce correct constrained random generators.
-
Efficient Regex Matching with Sparse Counting-Sets
Sparse counting-sets reduce replication overhead in c-regex matching by tracking only essential counter values.