okay so if you want to do a generator use this, if you want to do not a generator just remove the header
so yeah first thing for working towards a solution is that range fails if you try to give it something that isn't integers, but you can also use the built in alphabet string constants
come to think of it the actual challenge spec isn't completely clear about it but the remark about "Maddox" being "abecedarian in ASCII` implies "aa" should succeed
so you could use d to remove duplicates, but that would also remove duplicates which would otherwise be out of order
since ˢ is just ᵐ except it ignores elements that fail, to return the elements being filtered rather than some intermediate value in determining if they should be filtered out, you have to explicitly unify the input and output
...not entirely sure what you mean by boolean array
there is actually no concept of a truthy or falsy value, just success or failure
well actually implicit unification of adjacent variables is the only way things can be unified
and then input and output are implicitly present at the start and end of a predicate respectively
but what i mean by explicitly unify is that you have to place the input there explicitly to unify it with the output because it won't be unified with the output otherwise
i think the conceptual reason ∧ is "just break unification lol" is that it represents the conjunction of two separate chains of unified stuff, as opposed to ∨ which breaks unification but creates a disjunction instead