Safe Haskell	Safe-Inferred
Language	Haskell2010

PlutusCore.Generators.Hedgehog.AST

Synopsis

simpleRecursive :: DefaultUni fun ann) #
Replace all constants in a program failing the given predicate with newly generated ones that are guaranteed to satisfy the predicate (if such constants cannot be generated, this generator will fail).

type AstGen = Name]) #

The monad that generators run in. The environment is a list of names to choose from for generation of variables and binders.

runAstGen :: Name] #

Generate a fixed set of names which we will use, of only up to a short size to make it likely that we get reuse. We do not attempt not to generate reserved words such as all or abs as the classic syntax parsers (both PLC and PIR ones) can handle names of variables clashing with reserved words. In the readable syntax that would be troubling, though, but we don't have a parser for that anyway.

genName :: AstGen DefaultFun ())) #